{"id":"https://openalex.org/W7161130432","doi":"https://doi.org/10.3390/a19050393","title":"Three-Dimensional UAV Omnidirectional Path Planning Algorithm Based on Urban Obstacle Environment","display_name":"Three-Dimensional UAV Omnidirectional Path Planning Algorithm Based on Urban Obstacle Environment","publication_year":2026,"publication_date":"2026-05-14","ids":{"openalex":"https://openalex.org/W7161130432","doi":"https://doi.org/10.3390/a19050393"},"language":"en","primary_location":{"id":"doi:10.3390/a19050393","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050393","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/a19050393","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100610198","display_name":"Yijie Zhang","orcid":"https://orcid.org/0000-0003-1594-1789"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yijie Zhang","raw_affiliation_strings":["School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China"],"raw_orcid":"https://orcid.org/0000-0003-1594-1789","affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China","institution_ids":["https://openalex.org/I111599522"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053859634","display_name":"Jizhou Chen","orcid":"https://orcid.org/0009-0009-6218-0960"},"institutions":[{"id":"https://openalex.org/I111599522","display_name":"Jiangnan University","ror":"https://ror.org/04mkzax54","country_code":"CN","type":"education","lineage":["https://openalex.org/I111599522"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jizhou Chen","raw_affiliation_strings":["School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214200, China","institution_ids":["https://openalex.org/I111599522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111599522"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":7.2205,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97326843,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"19","issue":"5","first_page":"393","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9767000079154968,"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.9767000079154968,"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.00559999980032444,"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/T11133","display_name":"UAV Applications and Optimization","score":0.0026000000070780516,"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.7994999885559082},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.7681000232696533},{"id":"https://openalex.org/keywords/omnidirectional-antenna","display_name":"Omnidirectional antenna","score":0.738099992275238},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6608999967575073},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6414999961853027},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6085000038146973},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.5476999878883362},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4472000002861023}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7994999885559082},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.7681000232696533},{"id":"https://openalex.org/C24027999","wikidata":"https://www.wikidata.org/wiki/Q2176348","display_name":"Omnidirectional antenna","level":3,"score":0.738099992275238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6862000226974487},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6608999967575073},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6414999961853027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6265000104904175},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.5476999878883362},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4472000002861023},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4300000071525574},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C2777953668","wikidata":"https://www.wikidata.org/wiki/Q684116","display_name":"Omnidirectional camera","level":4,"score":0.36820000410079956},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3612000048160553},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35040000081062317},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33559998869895935},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.32420000433921814},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.2671000063419342},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25619998574256897}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19050393","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050393","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3514a8f27a704dbb949369688f711539","is_oa":true,"landing_page_url":"https://doaj.org/article/3514a8f27a704dbb949369688f711539","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 5, p 393 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19050393","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19050393","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8105195760726929}],"awards":[{"id":"https://openalex.org/G5451269634","display_name":null,"funder_award_id":"62402200","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1976930960","https://openalex.org/W2142156433","https://openalex.org/W2468618434","https://openalex.org/W4394837524","https://openalex.org/W4405784966","https://openalex.org/W4407500937","https://openalex.org/W4409593380","https://openalex.org/W4411552368","https://openalex.org/W4411787425","https://openalex.org/W4414050905","https://openalex.org/W4416748565","https://openalex.org/W7130649042","https://openalex.org/W7159792769"],"related_works":[],"abstract_inverted_index":{"To":[0],"address":[1],"the":[2,12,45,113,134],"challenges":[3],"of":[4,47],"high":[5],"computational":[6],"complexity,":[7],"inferior":[8],"path":[9,15,23,49,56,92,108,155],"performance,":[10],"and":[11,17,50,80,84,91,101,127],"balance":[13],"between":[14],"quality":[16],"efficiency":[18],"in":[19,140,157],"traditional":[20],"3D":[21,37],"omnidirectional":[22,38,55],"planning":[24,156],"algorithms":[25],"for":[26,35,78,152],"UAVs,":[27],"this":[28],"study":[29],"proposes":[30],"an":[31,149],"innovative":[32],"precision":[33],"algorithm":[34,42,67,115,136],"solving":[36],"shortest":[39],"paths.":[40],"The":[41],"innovatively":[43],"introduces":[44],"concepts":[46],"circling":[48],"overpass":[51],"path,":[52],"reducing":[53],"three-dimensional":[54],"computation":[57],"to":[58,68,99,121,125,130],"two-dimensional":[59],"processing.":[60],"It":[61],"designs":[62],"a":[63,117],"three-view":[64],"obstacle":[65,71],"detection":[66],"achieve":[69],"efficient":[70],"avoidance":[72],"judgment,":[73],"formulates":[74],"separate":[75],"path-solving":[76],"strategies":[77],"discrete":[79],"continuous":[81],"obstacles,":[82],"respectively,":[83],"obtains":[85],"optimal":[86],"solutions":[87],"through":[88],"recursive":[89],"adjustments":[90],"optimization.":[93],"Experimental":[94],"results":[95],"demonstrate":[96],"that":[97],"compared":[98,120,124,129],"A*":[100],"Theta*":[102],"algorithms,":[103],"our":[104],"approach":[105],"achieves":[106,116],"shorter":[107],"lengths":[109],"with":[110],"superior":[111],"stability;":[112],"proposed":[114,135],"21.86%":[118],"reduction":[119],"RRT*,":[122],"10.48%":[123],"A*,":[126],"0.89%":[128],"Lazy_Theta*.":[131],"In":[132],"addition,":[133],"exhibits":[137],"enhanced":[138],"adaptability":[139],"high-obstacle":[141],"environments":[142],"(particularly":[143],"irregular":[144],"obstacles).":[145],"These":[146],"findings":[147],"provide":[148],"effective":[150],"solution":[151],"complex":[153],"spatial":[154],"UAV":[158],"applications.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-05-15T00:00:00"}