{"id":"https://openalex.org/W7167063149","doi":"https://doi.org/10.48550/arxiv.2607.00065","title":"Optimal any-angle path planning in static and dynamic environments","display_name":"Optimal any-angle path planning in static and dynamic environments","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7167063149","doi":"https://doi.org/10.48550/arxiv.2607.00065"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00065","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00065","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00065","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085179469","display_name":"Yiyuan Zou","orcid":"https://orcid.org/0000-0002-3026-538X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zou, Yiyuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031742867","display_name":"Clark Borst","orcid":"https://orcid.org/0000-0001-9393-5304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Borst, Clark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9559999704360962,"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.9559999704360962,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.02319999970495701,"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"}},{"id":"https://openalex.org/T11082","display_name":"Spacecraft Dynamics and Control","score":0.003000000026077032,"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/motion-planning","display_name":"Motion planning","score":0.7702000141143799},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.669700026512146},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.6628000140190125},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6154000163078308},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.598800003528595},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5379999876022339},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.47040000557899475}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7702000141143799},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.669700026512146},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.6628000140190125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6155999898910522},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6154000163078308},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.598800003528595},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5379999876022339},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5076000094413757},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.47040000557899475},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3037000000476837},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26739999651908875},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00065","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00065","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00065","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00065","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Life below water","score":0.7083984613418579,"id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Any-angle":[0],"path":[1,6,82,236],"planning":[2,7,83,237],"extends":[3],"traditional":[4,123],"graph-based":[5],"by":[8,20],"allowing":[9],"movement":[10],"between":[11],"any":[12],"pair":[13],"of":[14,69,119],"vertices,":[15],"rather":[16],"than":[17,214,218],"being":[18],"restricted":[19],"predefined":[21],"edges.":[22],"It":[23],"can":[24,61,194],"find":[25],"straighter":[26],"and":[27,48,86,100,116,137,164,170,187,238],"shorter":[28],"paths":[29],"in":[30,41,66,97],"continuous":[31],"space":[32],"with":[33,177,208],"graphs,":[34],"making":[35],"it":[36],"particularly":[37],"suitable":[38,243],"for":[39,168,232,244],"navigation":[40],"open":[42,148],"areas":[43],"such":[44,201],"as":[45,202],"airspaces,":[46],"warehouses,":[47],"oceans.":[49],"Many":[50],"any-angle":[51,81,235],"path-planning":[52],"algorithms":[53],"have":[54],"been":[55],"proposed,":[56],"but":[57],"only":[58],"a":[59,240],"few":[60],"guarantee":[62],"optimal":[63,80,222,234],"solutions,":[64],"especially":[65],"the":[67,113,160,183,219,229],"presence":[68],"dynamic":[70,101,171,203],"obstacles.":[71],"To":[72,131],"address":[73],"this":[74,76,226],"challenge,":[75],"article":[77],"focuses":[78],"on":[79,84,159],"grids":[85],"introduces":[87,239],"two":[88,134],"general":[89],"techniques":[90],"that":[91],"accelerate":[92],"computation":[93],"while":[94],"preserving":[95],"optimality":[96],"both":[98],"static":[99,169],"environments:":[102],"1)":[103],"elliptical":[104],"forward":[105,138,151,178],"expansion,":[106],"which":[107,121],"leverages":[108],"ellipse-based":[109],"neighborhoods":[110],"to":[111,126,182,198],"restrict":[112],"search":[114],"space,":[115],"2)":[117],"field":[118],"view,":[120],"replaces":[122],"line-of-sight":[124],"methods":[125],"speed":[127],"up":[128],"visibility":[129],"checks.":[130],"integrate":[132],"these":[133],"techniques,":[135,162],"inverted":[136],"scanning":[139,143,152,210],"are":[140,166],"introduced.":[141],"Inverted":[142],"establishes":[144],"visual":[145],"connections":[146],"from":[147,155],"nodes,":[149],"whereas":[150],"initiates":[153],"scans":[154],"closed":[156],"nodes.":[157],"Building":[158],"proposed":[161],"Zeta*":[163,193],"Zeta*-SIPP":[165],"developed":[167],"environments":[172,204],"respectively.":[173],"Zeta*,":[174],"when":[175],"combined":[176],"scanning,":[179],"is":[180,212],"similar":[181],"state-of-the-art":[184,221],"algorithm":[185],"Anya":[186],"attains":[188],"comparable":[189],"performance.":[190],"Unlike":[191],"Anya,":[192],"be":[195],"readily":[196],"extended":[197],"other":[199],"settings,":[200],"(e.g.,":[205],"Zeta*-SIPP).":[206],"Zeta*-SIPP,":[207],"either":[209],"method,":[211],"more":[213],"20":[215],"times":[216],"faster":[217],"corresponding":[220],"planner":[223],"TO-AA-SIPP.":[224],"Overall,":[225],"research":[227],"identifies":[228],"key":[230],"requirements":[231],"achieving":[233],"unified":[241],"approach":[242],"different":[245],"environments.":[246]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}
