{"id":"https://openalex.org/W4415005388","doi":"https://doi.org/10.1016/j.cor.2025.107296","title":"An adaptive and efficient path planning algorithm for UAV navigation in complex environments","display_name":"An adaptive and efficient path planning algorithm for UAV navigation in complex environments","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4415005388","doi":"https://doi.org/10.1016/j.cor.2025.107296"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2025.107296","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107296","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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":null,"display_name":"Yonggang Wang","orcid":"https://orcid.org/0009-0008-7807-8103"},"institutions":[{"id":"https://openalex.org/I166846921","display_name":"Liaoning Shihua University","ror":"https://ror.org/00k6c4h29","country_code":"CN","type":"education","lineage":["https://openalex.org/I166846921"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yonggang Wang","raw_affiliation_strings":["School of Information and Control Engineering, Liaoning Petrochemical University, West Section of Dandong Road No. 1, Fushun, 113001, Liaoning, China"],"raw_orcid":"https://orcid.org/0009-0008-7807-8103","affiliations":[{"raw_affiliation_string":"School of Information and Control Engineering, Liaoning Petrochemical University, West Section of Dandong Road No. 1, Fushun, 113001, Liaoning, China","institution_ids":["https://openalex.org/I166846921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100621243","display_name":"Guo\u2010Liang Wang","orcid":"https://orcid.org/0000-0001-8877-3064"},"institutions":[{"id":"https://openalex.org/I166846921","display_name":"Liaoning Shihua University","ror":"https://ror.org/00k6c4h29","country_code":"CN","type":"education","lineage":["https://openalex.org/I166846921"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Guoliang Wang","raw_affiliation_strings":["School of Information and Control Engineering, Liaoning Petrochemical University, West Section of Dandong Road No. 1, Fushun, 113001, Liaoning, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Control Engineering, Liaoning Petrochemical University, West Section of Dandong Road No. 1, Fushun, 113001, Liaoning, China","institution_ids":["https://openalex.org/I166846921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100621243"],"corresponding_institution_ids":["https://openalex.org/I166846921"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":2.2665,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90152212,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"185","issue":null,"first_page":"107296","last_page":"107296"},"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.9984999895095825,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/maxima-and-minima","display_name":"Maxima and minima","score":0.7246000170707703},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6973999738693237},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6276999711990356},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5145000219345093},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.504800021648407},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.444599986076355},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4375},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.4154999852180481},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4117000102996826}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7246000170707703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7235000133514404},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6973999738693237},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6276999711990356},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5145000219345093},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.504800021648407},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.444599986076355},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4250999987125397},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.4154999852180481},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4117000102996826},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.39340001344680786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3869999945163727},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.37940001487731934},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.32690000534057617},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3093999922275543},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C2986897749","wikidata":"https://www.wikidata.org/wiki/Q231761","display_name":"Potential field","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2025.107296","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107296","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2386605224","display_name":null,"funder_award_id":"JYTMS20231435","funder_id":"https://openalex.org/F4320324560","funder_display_name":"Department of Education of Liaoning Province"},{"id":"https://openalex.org/G3996668734","display_name":null,"funder_award_id":"LJ212510148009","funder_id":"https://openalex.org/F4320324560","funder_display_name":"Department of Education of Liaoning Province"}],"funders":[{"id":"https://openalex.org/F4320324560","display_name":"Department of Education of Liaoning Province","ror":"https://ror.org/0022v2454"},{"id":"https://openalex.org/F4320329351","display_name":"Liaoning Shihua University","ror":"https://ror.org/00k6c4h29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1935926926","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W2008972180","https://openalex.org/W2098029503","https://openalex.org/W2099144379","https://openalex.org/W2141664020","https://openalex.org/W2169528473","https://openalex.org/W2211552581","https://openalex.org/W2608726595","https://openalex.org/W2977220028","https://openalex.org/W3005963491","https://openalex.org/W3019349330","https://openalex.org/W3095040535","https://openalex.org/W3102121895","https://openalex.org/W3113070793","https://openalex.org/W3201311488","https://openalex.org/W4225814850","https://openalex.org/W4239504258","https://openalex.org/W4285108207","https://openalex.org/W4304480790","https://openalex.org/W4307403081","https://openalex.org/W4308310328","https://openalex.org/W4313479325","https://openalex.org/W4365800070","https://openalex.org/W4376623178","https://openalex.org/W4377289394","https://openalex.org/W4387963799","https://openalex.org/W4388208469","https://openalex.org/W4391057946","https://openalex.org/W4392638773","https://openalex.org/W4394770855","https://openalex.org/W4401415679","https://openalex.org/W4403918572","https://openalex.org/W4404905824","https://openalex.org/W4405747352","https://openalex.org/W4408663193"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-10-10T00:00:00"}