{"id":"https://openalex.org/W4401417118","doi":"https://doi.org/10.1109/icra57147.2024.10610073","title":"Tree-based Representation of Locally Shortest Paths for 2D k-Shortest Non-homotopic Path Planning","display_name":"Tree-based Representation of Locally Shortest Paths for 2D k-Shortest Non-homotopic Path Planning","publication_year":2024,"publication_date":"2024-05-13","ids":{"openalex":"https://openalex.org/W4401417118","doi":"https://doi.org/10.1109/icra57147.2024.10610073"},"language":"en","primary_location":{"id":"doi:10.1109/icra57147.2024.10610073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra57147.2024.10610073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-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/A5103090984","display_name":"Tong Yang","orcid":"https://orcid.org/0000-0002-2276-8534"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Tong Yang","raw_affiliation_strings":["Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027"],"affiliations":[{"raw_affiliation_string":"Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101455255","display_name":"Li Huang","orcid":"https://orcid.org/0000-0002-0980-2179"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Huang","raw_affiliation_strings":["Zhejiang University,Institute of Advanced Digital Technologies and Instrumentation,Hangzhou,China,310027"],"affiliations":[{"raw_affiliation_string":"Zhejiang University,Institute of Advanced Digital Technologies and Instrumentation,Hangzhou,China,310027","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100371984","display_name":"Yue Wang","orcid":"https://orcid.org/0000-0002-0278-2347"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yue Wang","raw_affiliation_strings":["Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027"],"affiliations":[{"raw_affiliation_string":"Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019081110","display_name":"Rong Xiong","orcid":"https://orcid.org/0000-0001-9318-9014"},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong Xiong","raw_affiliation_strings":["Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027"],"affiliations":[{"raw_affiliation_string":"Zhejiang University,State Key Laboratory of Industrial Control and Technology,Hangzhou,China,310027","institution_ids":["https://openalex.org/I55712492"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103090984"],"corresponding_institution_ids":["https://openalex.org/I55712492"],"apc_list":null,"apc_paid":null,"fwci":0.7873,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72425431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"16553","last_page":"16559"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9883000254631042,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9819999933242798,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7151656746864319},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6138599514961243},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5759283304214478},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.52665776014328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5237086415290833},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5223677754402161},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.51936274766922},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4124656915664673},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.41133832931518555},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4092761278152466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40291833877563477},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37371110916137695},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.23337984085083008},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18862563371658325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.145002543926239},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07007849216461182}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7151656746864319},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6138599514961243},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5759283304214478},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.52665776014328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5237086415290833},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5223677754402161},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.51936274766922},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4124656915664673},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.41133832931518555},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4092761278152466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40291833877563477},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37371110916137695},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.23337984085083008},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18862563371658325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.145002543926239},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07007849216461182},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra57147.2024.10610073","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra57147.2024.10610073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1514632510","https://openalex.org/W1649968962","https://openalex.org/W1967005434","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1992787855","https://openalex.org/W2002713832","https://openalex.org/W2033775003","https://openalex.org/W2092876423","https://openalex.org/W2117828438","https://openalex.org/W2128990851","https://openalex.org/W2161473822","https://openalex.org/W2163178194","https://openalex.org/W2411856611","https://openalex.org/W2549200707","https://openalex.org/W2996899864","https://openalex.org/W4238195818","https://openalex.org/W6685805576"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2365712669","https://openalex.org/W2357391150","https://openalex.org/W2358754422"],"abstract_inverted_index":{"A":[0],"novel":[1],"algorithm":[2,196],"to":[3,67,121,182],"solve":[4],"the":[5,89,92,106,131,140,147,156,166,184,187,194,200,203],"2D":[6],"k-shortest":[7],"non-homotopic":[8,50,82],"path":[9,98],"planning":[10,29],"(k-SNPP)":[11],"task":[12,19],"is":[13,20,34,119,150,197],"proposed":[14,120,188,195],"in":[15,40,105,177],"this":[16,114],"paper.":[17],"The":[18,127,190],"of":[21,71,91,143,155,162,186,193,202],"practical":[22],"significance":[23],"as":[24,56],"a":[25,116],"sub-module":[26],"for":[27,80,101,173,199],"higherlevel":[28],"and":[30,33,38,58,73,125,134,164],"scheduling":[31],"tasks,":[32],"gaining":[35],"increasing":[36],"attention":[37],"focus":[39],"recent":[41],"years.":[42],"There":[43],"have":[44],"existed":[45],"algorithms":[46,63],"that":[47,152],"explicitly":[48],"characterised":[49],"paths":[51,104],"using":[52],"topological":[53,117,137],"invariants":[54,76],"such":[55],"\u210e-signature":[57],"winding":[59],"number.":[60],"However,":[61],"these":[62],"are":[64,77,168,175],"inefficient":[65],"due":[66],"their":[68],"separate":[69],"treatment":[70],"topology":[72,124],"geometry:":[74],"Topological":[75],"singularly":[78],"utilised":[79],"distinguishing":[81],"property":[83],"among":[84],"paths,":[85,163],"which":[86,109],"significantly":[87],"increases":[88],"volume":[90],"robot":[93],"configuration":[94],"space.":[95],"Meanwhile,":[96],"distance-optimal":[97],"planners":[99],"search":[100],"locally":[102,169],"shortest":[103],"augmented":[107],"space,":[108],"becomes":[110],"extremely":[111],"time-consuming.":[112],"In":[113],"paper,":[115],"tree":[118,128,157],"simultaneously":[122],"leverage":[123],"geometry.":[126],"grows":[129],"from":[130],"starting":[132],"location":[133],"explores":[135],"all":[136,165],"routes,":[138],"until":[139],"best":[141],"k":[142],"its":[144],"leaves":[145],"reach":[146],"goal.":[148],"It":[149],"proven":[151],"different":[153,159],"branches":[154,167],"explore":[158],"homotopy":[160],"classes":[161],"shortest.":[170],"Comparative":[171],"experiments":[172],"k-SNPP":[174],"conducted":[176],"challenging":[178],"grid-based":[179],"simulated":[180],"environments":[181],"validate":[183],"performance":[185],"algorithm.":[189],"C++":[191],"implementation":[192],"released":[198],"benefit":[201],"robotics":[204],"community.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}