{"id":"https://openalex.org/W4389665543","doi":"https://doi.org/10.1109/iros55552.2023.10341744","title":"CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space","display_name":"CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4389665543","doi":"https://doi.org/10.1109/iros55552.2023.10341744"},"language":"en","primary_location":{"id":"doi:10.1109/iros55552.2023.10341744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10341744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/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":true,"raw_author_name":"Jinyuan Liu","raw_affiliation_strings":["College of Information Engineering, Zhejiang University of Technology,Hangzhou,China,310023"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology,Hangzhou,China,310023","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,310023"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology,Hangzhou,China,310023","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,310023"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology,Hangzhou,China,310023","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","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,310023"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information Engineering, Zhejiang University of Technology,Hangzhou,China,310023","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011367029","display_name":"Ryhor Prakapovich","orcid":"https://orcid.org/0000-0002-3412-9174"},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]},{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Ryhor Prakapovich","raw_affiliation_strings":["United Institute of Informatics Problems of the National Academy of Sciences of Belarus,Minsk,Belarus,220012"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems of the National Academy of Sciences of Belarus,Minsk,Belarus,220012","institution_ids":["https://openalex.org/I4210105192","https://openalex.org/I151823869"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032575179","display_name":"Uladzislau Sychou","orcid":"https://orcid.org/0000-0002-1355-8965"},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]},{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Uladzislau Sychou","raw_affiliation_strings":["United Institute of Informatics Problems of the National Academy of Sciences of Belarus,Minsk,Belarus,220012"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems of the National Academy of Sciences of Belarus,Minsk,Belarus,220012","institution_ids":["https://openalex.org/I4210105192","https://openalex.org/I151823869"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5100675906"],"corresponding_institution_ids":["https://openalex.org/I55712492"],"apc_list":null,"apc_paid":null,"fwci":0.5739,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69570885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2224","last_page":"2231"},"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.9434000253677368,"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.9326000213623047,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8563793897628784},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6852003335952759},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6299660205841064},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6143243908882141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5460907220840454},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5339986085891724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5219178199768066},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4646795094013214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4568009078502655},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.45077019929885864},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44768738746643066},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4409591555595398},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4361611604690552},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4355141818523407},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.414935439825058},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4143049120903015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3882041573524475},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.35563328862190247},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2264363169670105},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.160519540309906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14529529213905334}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8563793897628784},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6852003335952759},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6299660205841064},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6143243908882141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5460907220840454},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5339986085891724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5219178199768066},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4646795094013214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4568009078502655},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.45077019929885864},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44768738746643066},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4409591555595398},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4361611604690552},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4355141818523407},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.414935439825058},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4143049120903015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3882041573524475},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.35563328862190247},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2264363169670105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.160519540309906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14529529213905334},{"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros55552.2023.10341744","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10341744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G8935830256","display_name":null,"funder_award_id":"2022YFE0121700","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1496383623","https://openalex.org/W1567215980","https://openalex.org/W1957861458","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2041147344","https://openalex.org/W2152064245","https://openalex.org/W2163178194","https://openalex.org/W2294424735","https://openalex.org/W2770250394","https://openalex.org/W2792979370","https://openalex.org/W2904612118","https://openalex.org/W2963130659","https://openalex.org/W2999300229","https://openalex.org/W3004407706","https://openalex.org/W3024383962","https://openalex.org/W3091295346","https://openalex.org/W3102509322","https://openalex.org/W3162002595","https://openalex.org/W3197681200","https://openalex.org/W3206647606","https://openalex.org/W4212845891","https://openalex.org/W4281261114","https://openalex.org/W4283780127","https://openalex.org/W4308068553","https://openalex.org/W4383108851"],"related_works":["https://openalex.org/W2300444527","https://openalex.org/W2348287729","https://openalex.org/W4253588386","https://openalex.org/W2377950158","https://openalex.org/W2810620529","https://openalex.org/W2368964068","https://openalex.org/W2100214387","https://openalex.org/W3112180780","https://openalex.org/W2367809275","https://openalex.org/W1562631103"],"abstract_inverted_index":{"The":[0],"Dijkstra":[1],"algorithm":[2,60,72,113,140],"is":[3,46,78,101],"a":[4,11,18,52,62,96,194,203,218,242],"classic":[5],"path":[6,26,70,87,146,183,201,233],"planning":[7,71,164,184],"method,":[8],"which":[9,80],"in":[10,35,61,95,202,217],"discrete":[12],"graph":[13],"space,":[14],"can":[15,81,114,141],"start":[16],"from":[17,88,186,234],"specified":[19],"source":[20,29],"node":[21,30],"and":[22,31,108,161,206],"find":[23,198],"the":[24,28,36,40,58,84,112,117,124,129,139,143,163,169,172,176,180,199,209,212,222,231],"shortest":[25],"between":[27],"all":[32,92,123,235],"other":[33,93],"nodes":[34],"graph.":[37],"However,":[38],"to":[39,55,91,188,197],"best":[41],"of":[42,57,122,147,166,179,211,220],"our":[43],"knowledge,":[44],"there":[45],"no":[47],"effective":[48],"method":[49,196],"that":[50,56,226],"achieves":[51],"function":[53],"similar":[54],"Dijkstra's":[59],"continuous":[63,98],"space.":[64,99],"In":[65,110,137,156,190],"this":[66,157],"study,":[67,158],"an":[68,152],"optimal":[69,86,118,145,182,200,232],"called":[73],"convex":[74],"dissection":[75],"topology":[76],"(CDT)-Dijkstra":[77],"developed,":[79],"quickly":[82,115],"compute":[83],"global":[85,144],"one":[89],"point":[90,131,150],"points":[94,170,236],"2D":[97,187],"CDT-Dijkstra":[100,227],"mainly":[102],"divided":[103],"into":[104],"two":[105],"stages:":[106],"SetInit":[107],"GetGoal.":[109],"SetInit,":[111],"obtain":[116],"CDT":[119],"encoding":[120],"set":[121],"cut":[125],"lines":[126],"based":[127],"on":[128,171],"initial":[130],"X":[132],"<inf":[133],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[134],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">init</inf>":[135],".":[136],"GetGoal,":[138],"return":[142],"any":[148],"goal":[149],"at":[151,237],"extremely":[153],"high":[154],"speed.":[155],"we":[159,192],"propose":[160,193],"prove":[162,208],"principle":[165],"considering":[167,248],"only":[168,229],"cutlines,":[173],"thus":[174],"reducing":[175],"state":[177],"space":[178],"distance":[181],"task":[185],"1D.":[189],"addition,":[191],"fast":[195],"homogeneous":[204],"class":[205],"theoretically":[207],"correctness":[210],"method.":[213],"Finally,":[214],"by":[215],"testing":[216],"series":[219],"environments,":[221],"experimental":[223],"results":[224],"demonstrate":[225],"not":[228],"plans":[230],"once,":[238],"but":[239],"also":[240],"has":[241],"significant":[243],"advantage":[244],"over":[245],"advanced":[246],"algorithms":[247],"certain":[249],"complex":[250],"tasks.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-13T08:25:38.343686","created_date":"2025-10-10T00:00:00"}