{"id":"https://openalex.org/W4324095036","doi":"https://doi.org/10.1017/s026357472300022x","title":"Time-optimal path following for non-redundant serial manipulators using an adaptive path-discretization","display_name":"Time-optimal path following for non-redundant serial manipulators using an adaptive path-discretization","publication_year":2023,"publication_date":"2023-03-13","ids":{"openalex":"https://openalex.org/W4324095036","doi":"https://doi.org/10.1017/s026357472300022x"},"language":"en","primary_location":{"id":"doi:10.1017/s026357472300022x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s026357472300022x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CC97C8DC27C6F795BE3DA80B866FF7AF/S026357472300022Xa.pdf/div-class-title-time-optimal-path-following-for-non-redundant-serial-manipulators-using-an-adaptive-path-discretization-div.pdf","source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CC97C8DC27C6F795BE3DA80B866FF7AF/S026357472300022Xa.pdf/div-class-title-time-optimal-path-following-for-non-redundant-serial-manipulators-using-an-adaptive-path-discretization-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074207060","display_name":"Tobias Marauli","orcid":"https://orcid.org/0000-0003-1117-0315"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Tobias Marauli","raw_affiliation_strings":["Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049498640","display_name":"Hubert Gattringer","orcid":"https://orcid.org/0000-0002-8846-9051"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hubert Gattringer","raw_affiliation_strings":["Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112392532","display_name":"Andreas M\u00fcller","orcid":"https://orcid.org/0000-0002-4468-2651"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Andreas M\u00fcller","raw_affiliation_strings":["Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Robotics, Johannes Kepler University Linz, Altenberger Strasse 69, 4040 Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074207060"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":0.7315,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.6914999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"41","issue":"6","first_page":"1856","last_page":"1871"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11394","display_name":"Dynamics and Control of Mechanical Systems","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equidistant","display_name":"Equidistant","score":0.7734368443489075},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.623145341873169},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6155704259872437},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.5964776873588562},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5232716798782349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.490403413772583},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.4851313531398773},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.4771299362182617},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4703134596347809},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.43085721135139465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40707144141197205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4031149744987488},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3381851315498352},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.26741620898246765},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15487626194953918},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13991659879684448},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13665932416915894},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.0780298113822937}],"concepts":[{"id":"https://openalex.org/C158245278","wikidata":"https://www.wikidata.org/wiki/Q4386982","display_name":"Equidistant","level":2,"score":0.7734368443489075},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.623145341873169},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6155704259872437},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.5964776873588562},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5232716798782349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.490403413772583},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.4851313531398773},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.4771299362182617},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4703134596347809},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.43085721135139465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40707144141197205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4031149744987488},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3381851315498352},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.26741620898246765},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15487626194953918},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13991659879684448},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13665932416915894},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0780298113822937},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.0},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s026357472300022x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s026357472300022x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CC97C8DC27C6F795BE3DA80B866FF7AF/S026357472300022Xa.pdf/div-class-title-time-optimal-path-following-for-non-redundant-serial-manipulators-using-an-adaptive-path-discretization-div.pdf","source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"},{"id":"pmh:oai:epub.jku.at/:8582472","is_oa":true,"landing_page_url":"https://epub.jku.at/doi/10.1017/S026357472300022X","pdf_url":"https://epub.jku.at/obvulioa/content/titleinfo/8582472/full.pdf","source":{"id":"https://openalex.org/S4306401788","display_name":"University Library Linz repository (Johannes Kepler Universitat Linz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121883995","host_organization_name":"Johannes Kepler University of Linz","host_organization_lineage":["https://openalex.org/I121883995"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1017/s026357472300022x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s026357472300022x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CC97C8DC27C6F795BE3DA80B866FF7AF/S026357472300022Xa.pdf/div-class-title-time-optimal-path-following-for-non-redundant-serial-manipulators-using-an-adaptive-path-discretization-div.pdf","source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4000000059604645,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4324095036.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1549549923","https://openalex.org/W1968009415","https://openalex.org/W1972394793","https://openalex.org/W1974511160","https://openalex.org/W1992938531","https://openalex.org/W2051664786","https://openalex.org/W2055576996","https://openalex.org/W2057085614","https://openalex.org/W2074668827","https://openalex.org/W2099454002","https://openalex.org/W2106682900","https://openalex.org/W2140220871","https://openalex.org/W2155612543","https://openalex.org/W2159806973","https://openalex.org/W2182510773","https://openalex.org/W2240885390","https://openalex.org/W2519318326","https://openalex.org/W2784320602","https://openalex.org/W2902825402","https://openalex.org/W3197307827","https://openalex.org/W4240172577","https://openalex.org/W4254092770","https://openalex.org/W4256673617","https://openalex.org/W4288860337","https://openalex.org/W6683816568"],"related_works":["https://openalex.org/W2055230676","https://openalex.org/W2373708349","https://openalex.org/W2370379095","https://openalex.org/W2064284991","https://openalex.org/W2385837322","https://openalex.org/W2546071705","https://openalex.org/W2354382931","https://openalex.org/W2123581415","https://openalex.org/W1795697503","https://openalex.org/W4312721425"],"abstract_inverted_index":{"Abstract":[0],"The":[1,118,146,158],"time-optimal":[2],"path":[3,16,36,89],"following":[4,167],"(OPF)":[5],"problem":[6,60],"is":[7,61,91,121,132,148,160],"to":[8,103,108,142],"find":[9],"a":[10,14,58,82,151,163],"time":[11,22],"evolution":[12],"along":[13],"prescribed":[15],"in":[17,45,84,99,170],"task":[18,74,100,171],"space":[19,75,101],"with":[20,138],"shortest":[21],"duration.":[23],"Numerical":[24],"solution":[25,127],"algorithms":[26],"rely":[27],"on":[28],"an":[29,104,143],"algorithm-specific":[30],"(usually":[31],"equidistant)":[32],"sampling":[33,83],"of":[34,53,128],"the":[35,43,50,54,88,94,109,125,129],"parameter.":[37],"This":[38,77],"does":[39],"not":[40],"account":[41],"for":[42,72,124,162],"dynamics":[44],"joint":[46,64,85,116],"space,":[47,86],"that":[48,62,134],"is,":[49],"actual":[51],"motion":[52],"robot,":[55],"however.":[56],"Moreover,":[57],"well-known":[59],"large":[63],"velocities":[65],"are":[66],"obtained":[67],"when":[68],"approaching":[69],"singularities,":[70],"even":[71],"slow":[73],"motions.":[76],"can":[78],"be":[79],"avoided":[80],"by":[81,93],"where":[87],"parameter":[90],"replaced":[92],"arc":[95],"length.":[96],"Such":[97],"discretization":[98],"leads":[102],"adaptive":[105,119],"refinement":[106,120],"according":[107],"nonlinear":[110],"forward":[111],"kinematics":[112],"and":[113,155],"guarantees":[114],"bounded":[115],"velocities.":[117],"also":[122],"beneficial":[123],"numerical":[126],"problem.":[130],"It":[131],"shown":[133],"this":[135],"yields":[136],"trajectories":[137],"improved":[139],"continuity":[140],"compared":[141],"equidistant":[144],"sampling.":[145],"OPF":[147],"reformulated":[149],"as":[150],"second-order":[152],"cone":[153],"programming":[154],"solved":[156],"numerically.":[157],"approach":[159],"demonstrated":[161],"6-DOF":[164],"industrial":[165],"robot":[166],"various":[168],"paths":[169],"space.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2023-03-14T00:00:00"}