无人机三维路径规划的多策略增强狼群算法

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Qiang Peng, Renjun Zhan, Husheng Wu, Aiai Wang, Yuanda Lai
{"title":"无人机三维路径规划的多策略增强狼群算法","authors":"Qiang Peng,&nbsp;Renjun Zhan,&nbsp;Husheng Wu,&nbsp;Aiai Wang,&nbsp;Yuanda Lai","doi":"10.1002/cpe.70095","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In this paper, a Multi-strategy Enhanced Wolf Pack Algorithm (MSEWPA) is proposed to address the three-dimensional (3D) path planning problem for unmanned aerial vehicles (UAVs) in complex environments. Initially, a mathematical model for 3D path planning is constructed, comprehensively considering constraints such as UAV operational efficiency, path safety risks, performance limitations, obstacle avoidance requirements, and noise limits in urban functional areas. Subsequently, the design of the MSEWPA algorithm is elaborated in detail, including the utilization of the Good Lattice Point (GLP) theory to optimize population initialization for enhanced global search capability, the integration of selection, crossover, and mutation operations from the Differential Evolution (DE) algorithm to augment the randomness of wandering, the introduction of a behavior transition factor for adaptive behavior adjustment, the incorporation of light propagation phenomena to improve random search capabilities during the running process, and the design of multiple siege strategies to guide the exploration of globally optimal solutions. To validate the robustness of the algorithm, sensitivity analysis is conducted on key parameters to determine their optimal settings, and ablation experiments are performed to verify the effectiveness of each improvement strategy. Experimental results on the CEC-2017 benchmark test functions demonstrate that MSEWPA excels in solving complex optimization problems, achieving rapid convergence to high-quality global optimal solutions. Furthermore, in four path planning problems of varying complexity, MSEWPA outperforms 11 other state-of-the-art metaheuristic optimization algorithms, demonstrating a strong balance between global and local exploration capabilities. This provides an effective solution for UAV 3D path planning.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 9-11","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multi-Strategy Enhanced Wolf Pack Algorithm for Three-Dimensional Path Planning of Unmanned Aerial Vehicles\",\"authors\":\"Qiang Peng,&nbsp;Renjun Zhan,&nbsp;Husheng Wu,&nbsp;Aiai Wang,&nbsp;Yuanda Lai\",\"doi\":\"10.1002/cpe.70095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>In this paper, a Multi-strategy Enhanced Wolf Pack Algorithm (MSEWPA) is proposed to address the three-dimensional (3D) path planning problem for unmanned aerial vehicles (UAVs) in complex environments. Initially, a mathematical model for 3D path planning is constructed, comprehensively considering constraints such as UAV operational efficiency, path safety risks, performance limitations, obstacle avoidance requirements, and noise limits in urban functional areas. Subsequently, the design of the MSEWPA algorithm is elaborated in detail, including the utilization of the Good Lattice Point (GLP) theory to optimize population initialization for enhanced global search capability, the integration of selection, crossover, and mutation operations from the Differential Evolution (DE) algorithm to augment the randomness of wandering, the introduction of a behavior transition factor for adaptive behavior adjustment, the incorporation of light propagation phenomena to improve random search capabilities during the running process, and the design of multiple siege strategies to guide the exploration of globally optimal solutions. To validate the robustness of the algorithm, sensitivity analysis is conducted on key parameters to determine their optimal settings, and ablation experiments are performed to verify the effectiveness of each improvement strategy. Experimental results on the CEC-2017 benchmark test functions demonstrate that MSEWPA excels in solving complex optimization problems, achieving rapid convergence to high-quality global optimal solutions. Furthermore, in four path planning problems of varying complexity, MSEWPA outperforms 11 other state-of-the-art metaheuristic optimization algorithms, demonstrating a strong balance between global and local exploration capabilities. This provides an effective solution for UAV 3D path planning.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 9-11\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70095\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70095","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

针对无人机在复杂环境下的三维路径规划问题,提出了一种多策略增强狼群算法(MSEWPA)。首先,综合考虑无人机运行效率、路径安全风险、性能限制、避障要求、城市功能区噪声限制等约束条件,构建了三维路径规划的数学模型。随后,详细阐述了MSEWPA算法的设计,包括利用Good Lattice Point (GLP)理论优化种群初始化以增强全局搜索能力,整合差分进化(DE)算法的选择、交叉和突变操作以增强漫游的随机性,引入行为转移因子进行自适应行为调整,以及引入自适应行为调整。结合光传播现象,提高运行过程中的随机搜索能力,设计多重攻城策略,指导全局最优解的探索。为了验证算法的鲁棒性,对关键参数进行敏感性分析,确定其最优设置,并进行烧蚀实验,验证各改进策略的有效性。在CEC-2017基准测试函数上的实验结果表明,MSEWPA在解决复杂优化问题方面表现出色,能够快速收敛到高质量的全局最优解。此外,在四个不同复杂性的路径规划问题中,MSEWPA优于其他11种最先进的元启发式优化算法,展示了全局和局部勘探能力之间的强大平衡。这为无人机三维路径规划提供了有效的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multi-Strategy Enhanced Wolf Pack Algorithm for Three-Dimensional Path Planning of Unmanned Aerial Vehicles

In this paper, a Multi-strategy Enhanced Wolf Pack Algorithm (MSEWPA) is proposed to address the three-dimensional (3D) path planning problem for unmanned aerial vehicles (UAVs) in complex environments. Initially, a mathematical model for 3D path planning is constructed, comprehensively considering constraints such as UAV operational efficiency, path safety risks, performance limitations, obstacle avoidance requirements, and noise limits in urban functional areas. Subsequently, the design of the MSEWPA algorithm is elaborated in detail, including the utilization of the Good Lattice Point (GLP) theory to optimize population initialization for enhanced global search capability, the integration of selection, crossover, and mutation operations from the Differential Evolution (DE) algorithm to augment the randomness of wandering, the introduction of a behavior transition factor for adaptive behavior adjustment, the incorporation of light propagation phenomena to improve random search capabilities during the running process, and the design of multiple siege strategies to guide the exploration of globally optimal solutions. To validate the robustness of the algorithm, sensitivity analysis is conducted on key parameters to determine their optimal settings, and ablation experiments are performed to verify the effectiveness of each improvement strategy. Experimental results on the CEC-2017 benchmark test functions demonstrate that MSEWPA excels in solving complex optimization problems, achieving rapid convergence to high-quality global optimal solutions. Furthermore, in four path planning problems of varying complexity, MSEWPA outperforms 11 other state-of-the-art metaheuristic optimization algorithms, demonstrating a strong balance between global and local exploration capabilities. This provides an effective solution for UAV 3D path planning.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信