{"id":"https://openalex.org/W7128640373","doi":"https://doi.org/10.1109/icnsc66229.2025.00017","title":"Multi-UAV Path Planning in Complex 3D Terrain Using Genetic-Enhanced Nutcracker Optimization","display_name":"Multi-UAV Path Planning in Complex 3D Terrain Using Genetic-Enhanced Nutcracker Optimization","publication_year":2025,"publication_date":"2025-10-01","ids":{"openalex":"https://openalex.org/W7128640373","doi":"https://doi.org/10.1109/icnsc66229.2025.00017"},"language":null,"primary_location":{"id":"doi:10.1109/icnsc66229.2025.00017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc66229.2025.00017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Networking, Sensing and Control (ICNSC)","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/A5008693917","display_name":"Xiao Bo Dou","orcid":null},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao Dou","raw_affiliation_strings":["Tongji University,Department of Control, Science and Engineering,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tongji University,Department of Control, Science and Engineering,Shanghai,China","institution_ids":["https://openalex.org/I116953780"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088027010","display_name":"Cheng Peng Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng Gao","raw_affiliation_strings":["Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University,Shanghai,China","institution_ids":["https://openalex.org/I116953780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006206015","display_name":"Qi Kang","orcid":"https://orcid.org/0000-0001-7128-6913"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Kang","raw_affiliation_strings":["Department of Control Science and Engineering Tongji University,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Control Science and Engineering Tongji University,Shanghai,China","institution_ids":["https://openalex.org/I116953780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I116953780"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"40","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9847999811172485,"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.9847999811172485,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.0024999999441206455,"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.001500000013038516,"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/terrain","display_name":"Terrain","score":0.7037000060081482},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.603600025177002},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5730999708175659},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5717999935150146},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5318999886512756},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4814999997615814},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.45680001378059387},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.42669999599456787}],"concepts":[{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.7037000060081482},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.603600025177002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5950999855995178},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5730999708175659},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5717999935150146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.564300000667572},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5318999886512756},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.3977999985218048},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.3125},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2924000024795532},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28929999470710754},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C2775935494","wikidata":"https://www.wikidata.org/wiki/Q741964","display_name":"Search and rescue","level":3,"score":0.25769999623298645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc66229.2025.00017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc66229.2025.00017","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Networking, Sensing and Control (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Unmanned":[0],"aerial":[1],"vehicles":[2],"(UAVs)":[3],"are":[4],"increasingly":[5],"deployed":[6],"in":[7,27,49,134,140],"complex":[8,31,141],"missions":[9],"such":[10],"as":[11,56],"reconnaissance,":[12],"delivery,":[13],"and":[14,33,69,101,115,137],"search":[15,99],"operations.":[16],"Effective":[17],"path":[18,43,65],"planning":[19,44],"is":[20,54],"critical":[21],"for":[22,45],"enabling":[23],"UAV":[24],"autonomy,":[25],"especially":[26],"multi-agent":[28],"scenarios":[29],"involving":[30],"terrain":[32],"operational":[34],"constraints.":[35],"This":[36],"paper":[37],"addresses":[38],"the":[39,77,92],"problem":[40,53],"of":[41],"collaborative":[42],"multiple":[46],"UAVs":[47],"operating":[48],"mountainous":[50],"environments.":[51,143],"The":[52],"formulated":[55],"a":[57,83,106,110],"constrained":[58],"multi-objective":[59],"optimization":[60],"model":[61],"that":[62,86,125],"simultaneously":[63],"considers":[64],"length,":[66],"constraint":[67],"violations,":[68],"trajectory":[70],"smoothness.":[71],"To":[72],"solve":[73],"this,":[74],"we":[75],"propose":[76],"Genetic-Enhanced":[78],"Nutcracker":[79,93],"Optimization":[80,94],"Algorithm":[81,95],"(GNOA),":[82],"hybrid":[84],"metaheuristic":[85],"integrates":[87],"genetic":[88],"algorithm":[89],"operators":[90],"into":[91],"(NOA)":[96],"to":[97,119,131],"improve":[98],"diversity":[100],"convergence":[102],"performance.":[103],"GNOA":[104,126],"introduces":[105],"crossover-enhanced":[107],"foraging":[108],"strategy,":[109],"mutation-driven":[111],"cachesearch":[112],"recovery":[113],"mechanism,":[114],"adaptive":[116],"boundary":[117],"constraints":[118],"ensure":[120],"feasibility.":[121],"Experimental":[122],"results":[123],"demonstrate":[124],"achieves":[127],"superior":[128],"performance":[129],"compared":[130],"existing":[132],"algorithms":[133],"generating":[135],"collision-free":[136],"energy-efficient":[138],"trajectories":[139],"three-dimensional":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-02-12T00:00:00"}