{"id":"https://openalex.org/W4415221769","doi":"https://doi.org/10.1109/lra.2025.3621931","title":"Generating and Optimizing Topologically Distinct Guesses for Mobile Manipulator Path Planning With Path Constraints","display_name":"Generating and Optimizing Topologically Distinct Guesses for Mobile Manipulator Path Planning With Path Constraints","publication_year":2025,"publication_date":"2025-10-15","ids":{"openalex":"https://openalex.org/W4415221769","doi":"https://doi.org/10.1109/lra.2025.3621931"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2025.3621931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3621931","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation 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/A5039248150","display_name":"R. Y. Wong","orcid":"https://orcid.org/0000-0002-7689-1562"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Rufus Cheuk Yin Wong","raw_affiliation_strings":["Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027780100","display_name":"Mayank Sewlia","orcid":"https://orcid.org/0000-0001-6177-2141"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mayank Sewlia","raw_affiliation_strings":["Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045954668","display_name":"Adrian Wiltz","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Adrian Wiltz","raw_affiliation_strings":["Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055348953","display_name":"Dimos V. Dimarogonas","orcid":"https://orcid.org/0000-0001-7309-8086"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Dimos V. Dimarogonas","raw_affiliation_strings":["Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Division of Decision and Control Systems, School of EECS, Royal Institute of Technology (KTH), Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039248150"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30525281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"12","first_page":"12453","last_page":"12460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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":0.9993000030517578,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9796000123023987,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9675999879837036,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7767999768257141},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7148000001907349},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5914999842643738},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5734000205993652},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.5608000159263611},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4957999885082245},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.48649999499320984},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.4855000078678131}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7767999768257141},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7148000001907349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6323999762535095},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5914999842643738},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5734000205993652},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.5608000159263611},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4957999885082245},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.48649999499320984},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4790000021457672},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.40540000796318054},{"id":"https://openalex.org/C190727649","wikidata":"https://www.wikidata.org/wiki/Q1941532","display_name":"Mobile manipulator","level":4,"score":0.3671000003814697},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C8652668","wikidata":"https://www.wikidata.org/wiki/Q1340324","display_name":"Robot end effector","level":3,"score":0.35269999504089355},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.301800012588501},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2994999885559082},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.2992999851703644},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29739999771118164},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.2703000009059906},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.2574000060558319},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3621931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3621931","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1560270123","https://openalex.org/W1969483458","https://openalex.org/W1970101292","https://openalex.org/W1992787855","https://openalex.org/W2009124734","https://openalex.org/W2068127265","https://openalex.org/W2103776982","https://openalex.org/W2117828438","https://openalex.org/W2118897212","https://openalex.org/W2141664020","https://openalex.org/W2142224528","https://openalex.org/W2161819990","https://openalex.org/W2169528473","https://openalex.org/W2411856611","https://openalex.org/W2549200707","https://openalex.org/W2971244547","https://openalex.org/W3008835932","https://openalex.org/W3159537771","https://openalex.org/W3178318282","https://openalex.org/W4313482702","https://openalex.org/W4388328664","https://openalex.org/W4404100954"],"related_works":[],"abstract_inverted_index":{"Optimal":[0],"path":[1,39,101,110],"planning":[2,35,102],"is":[3,14,82],"prone":[4],"to":[5,7,22,43,49,68,84,87],"convergence":[6],"local,":[8],"rather":[9],"than":[10],"global,":[11],"optima.":[12,73],"This":[13,31],"often":[15],"the":[16,45,88,93,99,107],"case":[17],"for":[18],"mobile":[19,104],"manipulators":[20,105],"due":[21],"nonconvexities":[23],"induced":[24],"by":[25],"obstacles,":[26],"robot":[27],"kinematics":[28],"and":[29,41,64,111],"constraints.":[30,113],"paper":[32],"focuses":[33],"on":[34],"under":[36],"end":[37],"effector":[38],"constraints":[40],"attempts":[42],"circumvent":[44],"issue":[46],"of":[47,77,95,103,109],"converging":[48],"a":[50,55],"local":[51,72,80],"optimum.":[52,90],"We":[53,91],"propose":[54],"pipeline":[56,97],"that":[57],"first":[58],"discovers":[59],"multiple":[60,70],"homotopically":[61],"distinct":[62,71,79],"paths,":[63],"then":[65],"optimizes":[66],"them":[67],"obtain":[69],"The":[74],"best":[75],"out":[76],"these":[78],"optima":[81],"likely":[83],"be":[85],"close":[86],"global":[89],"demonstrate":[92],"effectiveness":[94],"our":[96],"in":[98,106],"optimal":[100],"presence":[108],"obstacle":[112]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-16T00:00:00"}