{"id":"https://openalex.org/W4379086708","doi":"https://doi.org/10.1109/lcsys.2023.3278251","title":"A Convex Programming Approach to Multipoint Optimal Motion Planning for Unicycle Robots","display_name":"A Convex Programming Approach to Multipoint Optimal Motion Planning for Unicycle Robots","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4379086708","doi":"https://doi.org/10.1109/lcsys.2023.3278251"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2023.3278251","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/lcsys.2023.3278251","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048258521","display_name":"Mirko Leomanni","orcid":"https://orcid.org/0000-0002-4720-5447"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Mirko Leomanni","raw_affiliation_strings":["Department of Engineering, University of Perugia, Perugia, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4720-5447","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059780406","display_name":"Giuseppe Mollica","orcid":"https://orcid.org/0000-0001-6706-2570"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuseppe Mollica","raw_affiliation_strings":["Department of Engineering, University of Perugia, Perugia, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6706-2570","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057766674","display_name":"Alberto Dionigi","orcid":"https://orcid.org/0000-0003-0581-2086"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alberto Dionigi","raw_affiliation_strings":["Department of Engineering, University of Perugia, Perugia, Italy"],"raw_orcid":"https://orcid.org/0000-0003-0581-2086","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066104170","display_name":"Paolo Valigi","orcid":"https://orcid.org/0000-0002-0486-7678"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Valigi","raw_affiliation_strings":["Department of Engineering, University of Perugia, Perugia, Italy"],"raw_orcid":"https://orcid.org/0000-0002-0486-7678","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016925926","display_name":"Gabriele Costante","orcid":"https://orcid.org/0000-0002-8417-9372"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gabriele Costante","raw_affiliation_strings":["Department of Engineering, University of Perugia, Perugia, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8417-9372","affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Perugia, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5048258521"],"corresponding_institution_ids":["https://openalex.org/I27483092"],"apc_list":null,"apc_paid":null,"fwci":0.3532,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57820208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":null,"first_page":"1688","last_page":"1693"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9987999796867371,"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/T12158","display_name":"Guidance and Control Systems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/waypoint","display_name":"Waypoint","score":0.8886722326278687},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6991232633590698},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5887630581855774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5883522033691406},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5590265393257141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5162103772163391},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5131381154060364},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5100034475326538},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.468871146440506},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4514819085597992},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4247055649757385},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41198205947875977},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4030814468860626},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.40009453892707825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.349150151014328},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.1923130452632904},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1698887050151825},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.10066619515419006}],"concepts":[{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.8886722326278687},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6991232633590698},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5887630581855774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5883522033691406},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5590265393257141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5162103772163391},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5131381154060364},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5100034475326538},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.468871146440506},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4514819085597992},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4247055649757385},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41198205947875977},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4030814468860626},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.40009453892707825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.349150151014328},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.1923130452632904},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1698887050151825},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.10066619515419006},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcsys.2023.3278251","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/lcsys.2023.3278251","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1516027685","https://openalex.org/W1814533834","https://openalex.org/W1971086298","https://openalex.org/W1971998222","https://openalex.org/W2027928741","https://openalex.org/W2055014394","https://openalex.org/W2099454002","https://openalex.org/W2123871098","https://openalex.org/W2130527887","https://openalex.org/W2136209220","https://openalex.org/W2148761022","https://openalex.org/W2149211351","https://openalex.org/W2181845023","https://openalex.org/W2306644740","https://openalex.org/W2313274380","https://openalex.org/W2343568200","https://openalex.org/W2488710684","https://openalex.org/W2587537338","https://openalex.org/W2617410115","https://openalex.org/W2752444998","https://openalex.org/W2896943870","https://openalex.org/W2907149406","https://openalex.org/W2914986345","https://openalex.org/W2962963952","https://openalex.org/W2981460880","https://openalex.org/W3006050411","https://openalex.org/W3048351880","https://openalex.org/W3082243195","https://openalex.org/W3103346840","https://openalex.org/W3185165122","https://openalex.org/W4206138543","https://openalex.org/W4214628309","https://openalex.org/W6695664954","https://openalex.org/W6755646560"],"related_works":["https://openalex.org/W2688471429","https://openalex.org/W4360939124","https://openalex.org/W2077345734","https://openalex.org/W2899287767","https://openalex.org/W2275928629","https://openalex.org/W1978127373","https://openalex.org/W2915444871","https://openalex.org/W2612848489","https://openalex.org/W2863424594","https://openalex.org/W2605476180"],"abstract_inverted_index":{"An":[0],"important":[1],"extension":[2],"of":[3,16,40,74,85,92],"point-to-point":[4],"motion":[5,49,115],"planning":[6,50],"deals":[7],"with":[8,81],"navigating":[9],"a":[10,14,47,67,72,82,98,110],"robot":[11],"optimally":[12],"through":[13],"sequence":[15],"waypoints.":[17],"The":[18,113],"resulting":[19],"multipoint":[20,55],"problem":[21],"is":[22,52,63,117],"typically":[23],"nonconvex":[24],"due":[25],"to":[26,29,108,119],"the":[27,31,38,86],"requirement":[28],"optimize":[30],"waypoint":[32],"passage":[33],"time,":[34,79],"which":[35],"has":[36],"hindered":[37],"determination":[39],"globally":[41],"optimal":[42],"solutions.":[43],"In":[44],"this":[45,135],"letter,":[46],"new":[48],"technique":[51],"presented":[53],"for":[54],"problems":[56,93],"involving":[57],"unicycle":[58],"robots.":[59],"Our":[60],"main":[61],"finding":[62],"that,":[64],"by":[65],"adopting":[66],"cost":[68],"function":[69],"that":[70],"weights":[71],"combination":[73],"path":[75],"length":[76],"and":[77,128],"maneuver":[78],"together":[80],"suitable":[83],"tightening":[84],"control":[87],"input":[88],"constraints,":[89],"such":[90],"type":[91],"can":[94,102,130],"be":[95,103],"cast":[96],"as":[97],"convex":[99],"program.":[100],"This":[101],"solved":[104],"in":[105],"polynomial":[106],"time":[107],"obtain":[109],"global":[111],"optimum.":[112],"proposed":[114],"planner":[116],"compared":[118],"time-optimal":[120],"trajectory":[121],"generation":[122],"scheme":[123],"based":[124],"on":[125],"nonlinear":[126],"programming,":[127],"it":[129],"find":[131],"better":[132],"trajectories":[133],"than":[134],"method":[136],"while":[137],"being":[138],"computationally":[139],"faster.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}