{"id":"https://openalex.org/W4416922560","doi":"https://doi.org/10.1109/iccais67508.2025.11262111","title":"A Three-Dimensional Path Planning Algorithm for Low-Altitude Transportation","display_name":"A Three-Dimensional Path Planning Algorithm for Low-Altitude Transportation","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W4416922560","doi":"https://doi.org/10.1109/iccais67508.2025.11262111"},"language":null,"primary_location":{"id":"doi:10.1109/iccais67508.2025.11262111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccais67508.2025.11262111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 14th International Conference on Control, Automation and Information Sciences (ICCAIS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100444142","display_name":"Weifeng Liu","orcid":"https://orcid.org/0000-0001-9537-8767"},"institutions":[{"id":"https://openalex.org/I110440473","display_name":"Xi'an University of Science and Technology","ror":"https://ror.org/046fkpt18","country_code":"CN","type":"education","lineage":["https://openalex.org/I110440473"]},{"id":"https://openalex.org/I51622183","display_name":"Shaanxi University of Science and Technology","ror":"https://ror.org/034t3zs45","country_code":"CN","type":"education","lineage":["https://openalex.org/I51622183"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weifeng Liu","raw_affiliation_strings":["School of Electrical and Control Engineering Shaanxi University of Science and Technology,Xi’an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Control Engineering Shaanxi University of Science and Technology,Xi’an,China","institution_ids":["https://openalex.org/I110440473","https://openalex.org/I51622183"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033550574","display_name":"Zhijian Hu","orcid":"https://orcid.org/0000-0002-8789-6246"},"institutions":[{"id":"https://openalex.org/I110440473","display_name":"Xi'an University of Science and Technology","ror":"https://ror.org/046fkpt18","country_code":"CN","type":"education","lineage":["https://openalex.org/I110440473"]},{"id":"https://openalex.org/I51622183","display_name":"Shaanxi University of Science and Technology","ror":"https://ror.org/034t3zs45","country_code":"CN","type":"education","lineage":["https://openalex.org/I51622183"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zijun Hu","raw_affiliation_strings":["School of Electrical and Control Engineering Shaanxi University of Science and Technology,Xi’an,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Control Engineering Shaanxi University of Science and Technology,Xi’an,China","institution_ids":["https://openalex.org/I110440473","https://openalex.org/I51622183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088652181","display_name":"Shihao Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I50760025","display_name":"Hangzhou Dianzi University","ror":"https://ror.org/0576gt767","country_code":"CN","type":"education","lineage":["https://openalex.org/I50760025"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shihao Zhao","raw_affiliation_strings":["School of Automation Hangzhou Dianzi University,Hangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automation Hangzhou Dianzi University,Hangzhou,China","institution_ids":["https://openalex.org/I50760025"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43618999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8722000122070312,"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.8722000122070312,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.01860000006854534,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11106","display_name":"Data Management and Algorithms","score":0.016599999740719795,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/motion-planning","display_name":"Motion planning","score":0.7264999747276306},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6029000282287598},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5101000070571899},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4941999912261963},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4690999984741211},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4607999920845032},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.39969998598098755},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.39640000462532043}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7264999747276306},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6029000282287598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5848000049591064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5576000213623047},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5101000070571899},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4941999912261963},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4690999984741211},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4607999920845032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4302999973297119},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.39640000462532043},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.34290000796318054},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C39118121","wikidata":"https://www.wikidata.org/wiki/Q1034047","display_name":"Transportation planning","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.27810001373291016},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.2734000086784363},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.27090001106262207},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C47796450","wikidata":"https://www.wikidata.org/wiki/Q508378","display_name":"Intelligent transportation system","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccais67508.2025.11262111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccais67508.2025.11262111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 14th International Conference on Control, Automation and Information Sciences (ICCAIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8579713843","display_name":null,"funder_award_id":"62376147","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W3151306683","https://openalex.org/W3193878267","https://openalex.org/W4376870616","https://openalex.org/W4386220236","https://openalex.org/W4389487195","https://openalex.org/W4396812335","https://openalex.org/W4399851766","https://openalex.org/W4402653818","https://openalex.org/W4403534159","https://openalex.org/W4408135070","https://openalex.org/W4409681965","https://openalex.org/W4411802217","https://openalex.org/W4414270400"],"related_works":[],"abstract_inverted_index":{"A":[0],"hierarchical":[1],"multi-objective":[2],"optimization":[3,58,73],"method":[4],"is":[5],"proposed":[6],"for":[7,26,49,60,75,104],"path":[8,24,47,80,101],"planning":[9,25,48,102],"in":[10],"low-altitude":[11,105],"logistics":[12,106],"transportation.":[13,107],"The":[14],"first-level":[15,61],"transportation":[16,33,62,77],"uses":[17],"an":[18,96],"improved$\\mathrm{A}^{*}$algorithm":[19],"to":[20,43],"achieve":[21],"the":[22,31,56,71],"shortest":[23],"urban":[27],"trunk":[28],"transportation,":[29],"while":[30,86],"second-level":[32,76],"employs":[34],"a":[35,39],"3D$\\mathrm{A}^{*}$algorithm":[36],"combined":[37],"with":[38],"risk":[40,72,81],"cost":[41],"function":[42],"complete":[44],"obstacle":[45],"avoidance":[46],"end":[50],"delivery.":[51],"Simulation":[52],"results":[53],"show":[54],"that":[55],"time":[57,66],"algorithm":[59,74],"can":[63,78],"reduce":[64],"flight":[65],"by":[67,83,90],"13":[68],"%,":[69],"and":[70,98],"decrease":[79],"value":[82],"41.8":[84],"%":[85],"improving":[87],"search":[88],"efficiency":[89],"3.85":[91],"%.":[92],"This":[93],"research":[94],"provides":[95],"efficient":[97],"safe":[99],"intelligent":[100],"solution":[103]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-12-02T00:00:00"}