{"id":"https://openalex.org/W4387385695","doi":"https://doi.org/10.1109/lra.2023.3322349","title":"A Homotopy Invariant Based on Convex Dissection Topology and a Distance Optimal Path Planning Algorithm","display_name":"A Homotopy Invariant Based on Convex Dissection Topology and a Distance Optimal Path Planning Algorithm","publication_year":2023,"publication_date":"2023-10-05","ids":{"openalex":"https://openalex.org/W4387385695","doi":"https://doi.org/10.1109/lra.2023.3322349"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2023.3322349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3322349","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/A5100675906","display_name":"Jinyuan Liu","orcid":"https://orcid.org/0009-0006-5930-3905"},"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":"Jinyuan Liu","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"],"raw_orcid":"https://orcid.org/0009-0006-5930-3905","affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033487036","display_name":"Minglei Fu","orcid":"https://orcid.org/0000-0002-4371-8667"},"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":"Minglei Fu","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-4371-8667","affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062282176","display_name":"Andong Liu","orcid":"https://orcid.org/0000-0003-2445-8457"},"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":"Andong Liu","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"],"raw_orcid":"https://orcid.org/0000-0003-2445-8457","affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019060617","display_name":"Wen\u2010An Zhang","orcid":"https://orcid.org/0000-0002-4355-2783"},"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":"Wenan Zhang","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-4355-2783","affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100427262","display_name":"Bo Chen","orcid":"https://orcid.org/0000-0001-6150-3881"},"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":"Bo Chen","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"],"raw_orcid":"https://orcid.org/0000-0001-6150-3881","affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7612,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89881395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"11","first_page":"7695","last_page":"7702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T13282","display_name":"Automated Road and Building Extraction","score":0.9685999751091003,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T12543","display_name":"Groundwater and Watershed Analysis","score":0.965399980545044,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9320999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6738285422325134},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.6510981917381287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6207908987998962},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5422767400741577},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5251462459564209},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5232597589492798},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.44466039538383484},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43105411529541016},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4269922971725464},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4237828850746155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4221884608268738},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38923749327659607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3019687831401825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.235153466463089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21340104937553406},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1604117453098297},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1570068895816803},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13531354069709778},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.11110654473304749},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1054430603981018}],"concepts":[{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6738285422325134},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.6510981917381287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6207908987998962},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5422767400741577},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5251462459564209},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5232597589492798},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44466039538383484},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43105411529541016},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4269922971725464},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4237828850746155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4221884608268738},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38923749327659607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3019687831401825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.235153466463089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21340104937553406},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1604117453098297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1570068895816803},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13531354069709778},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.11110654473304749},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1054430603981018},{"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/lra.2023.3322349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2023.3322349","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":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1496383623","https://openalex.org/W1567215980","https://openalex.org/W1957861458","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2041147344","https://openalex.org/W2108865768","https://openalex.org/W2128990851","https://openalex.org/W2294480821","https://openalex.org/W2735958714","https://openalex.org/W2792979370","https://openalex.org/W2962826218","https://openalex.org/W2963130659","https://openalex.org/W2996899864","https://openalex.org/W2999300229","https://openalex.org/W3041790910","https://openalex.org/W3102509322","https://openalex.org/W3150937970","https://openalex.org/W3162002595","https://openalex.org/W3192215177","https://openalex.org/W3197681200","https://openalex.org/W3206647606","https://openalex.org/W4281261114","https://openalex.org/W4383108851","https://openalex.org/W4388692454","https://openalex.org/W6838554315"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W3205592527","https://openalex.org/W4200172719","https://openalex.org/W4294360851","https://openalex.org/W2612665926","https://openalex.org/W2365712669","https://openalex.org/W1617152041","https://openalex.org/W2388654557","https://openalex.org/W2018146256"],"abstract_inverted_index":{"The":[0],"concept":[1],"of":[2,12,55,123,139,147,162,170],"path":[3,13,42,51,63,77,84,132,155,171],"homotopy":[4,22,41,62,76,117,165],"has":[5],"received":[6],"widely":[7],"attention":[8],"in":[9,15,78,133,167],"the":[10,49,61,68,74,121,124,130,145,148,159,163,168],"field":[11,169],"planning":[14,52,85,156,172],"recent":[16],"years.":[17],"In":[18],"this":[19,79],"letter,":[20],"a":[21,29,111,137],"invariant":[23,166],"based":[24,93],"on":[25,94],"convex":[26],"dissection":[27],"for":[28,60,106],"two-dimensional":[30],"bounded":[31],"Euclidean":[32],"space":[33],"is":[34,98,151],"developed,":[35],"which":[36,108],"can":[37],"efficiently":[38],"encode":[39],"all":[40],"classes":[43],"between":[44],"any":[45],"two":[46,56],"points.":[47],"Thereafter,":[48],"optimal":[50,69,83],"task":[53],"consists":[54],"steps:":[57],"(i)":[58],"search":[59],"class":[64],"that":[65,144],"may":[66],"contain":[67],"path,":[70],"and":[71,119],"(ii)":[72],"obtain":[73,129],"shortest":[75,131],"class.":[80,135],"Furthermore,":[81],"an":[82,102],"algorithm":[86,127,150],"called":[87],"CDT-RRT*":[88],"(Rapidly-exploring":[89],"Random":[90],"Tree":[91],"Star":[92],"Convex":[95],"Division":[96],"Topology)":[97],"proposed.":[99],"We":[100],"designed":[101],"efficient":[103],"sampling":[104],"formula":[105],"CDT-RRT*,":[107],"gives":[109],"it":[110,141],"tendency":[112],"to":[113,128],"actively":[114],"explore":[115],"unknown":[116],"classes,":[118],"incorporated":[120],"principles":[122],"Elastic":[125],"Band":[126],"each":[134],"Through":[136],"series":[138],"experiments,":[140],"was":[142,173],"determined":[143],"performance":[146],"proposed":[149],"comparable":[152],"with":[153],"state-of-the-art":[154],"algorithms.":[157],"Hence,":[158],"application":[160],"significance":[161],"developed":[164],"verified.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}