{"id":"https://openalex.org/W7168158243","doi":"https://doi.org/10.1007/978-981-92-3432-5_14","title":"UAV 3D Path Planning Based on Multi-strategy Collabo Rative Improved Coati Optimization Algorithm","display_name":"UAV 3D Path Planning Based on Multi-strategy Collabo Rative Improved Coati Optimization Algorithm","publication_year":2026,"publication_date":"2026-07-13","ids":{"openalex":"https://openalex.org/W7168158243","doi":"https://doi.org/10.1007/978-981-92-3432-5_14"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-92-3432-5_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-92-3432-5_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5110929503","display_name":"Jiayi Gao","orcid":"https://orcid.org/0000-0001-5313-2857"},"institutions":[{"id":"https://openalex.org/I47689461","display_name":"Northeast Forestry University","ror":"https://ror.org/02yxnh564","country_code":"CN","type":"education","lineage":["https://openalex.org/I47689461"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiayi Gao","raw_affiliation_strings":["College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China","institution_ids":["https://openalex.org/I47689461"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042034443","display_name":"Lixin Mu","orcid":null},"institutions":[{"id":"https://openalex.org/I47689461","display_name":"Northeast Forestry University","ror":"https://ror.org/02yxnh564","country_code":"CN","type":"education","lineage":["https://openalex.org/I47689461"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lixin Mu","raw_affiliation_strings":["College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China","institution_ids":["https://openalex.org/I47689461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048634513","display_name":"Y ZHANG","orcid":null},"institutions":[{"id":"https://openalex.org/I47689461","display_name":"Northeast Forestry University","ror":"https://ror.org/02yxnh564","country_code":"CN","type":"education","lineage":["https://openalex.org/I47689461"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yu Zhang","raw_affiliation_strings":["College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Control and Information Engineering, Northeast Forestry University, Harbin, 15000, China","institution_ids":["https://openalex.org/I47689461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048634513"],"corresponding_institution_ids":["https://openalex.org/I47689461"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"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":"165","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8468999862670898,"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.8468999862670898,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.031199999153614044,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11133","display_name":"UAV Applications and Optimization","score":0.022099999710917473,"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/benchmark","display_name":"Benchmark (surveying)","score":0.6510999798774719},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6097999811172485},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5740000009536743},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5534999966621399},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.542900025844574},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.539900004863739},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.5220999717712402},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.46209999918937683}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7712000012397766},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6510999798774719},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6097999811172485},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5740000009536743},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5534999966621399},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.539900004863739},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.5220999717712402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5015000104904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4921000003814697},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.39800000190734863},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.26510000228881836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-92-3432-5_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-92-3432-5_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6389409303665161,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W4223954537","https://openalex.org/W4225164013","https://openalex.org/W4285816226","https://openalex.org/W4307722364","https://openalex.org/W4308731068","https://openalex.org/W4324092551","https://openalex.org/W4365141897","https://openalex.org/W4385483766","https://openalex.org/W4389057130","https://openalex.org/W4391542888","https://openalex.org/W4393343391","https://openalex.org/W4398234220","https://openalex.org/W4400195210","https://openalex.org/W4402169579","https://openalex.org/W4405842187","https://openalex.org/W4409146838","https://openalex.org/W4413679786"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-14T00:00:00"}