粒子群优化
线路规划
计算机科学
数学优化
分类
稳健性(进化)
趋同(经济学)
平滑的
空战
最优化问题
遗传算法
早熟收敛
模拟
算法
机器学习
数学
生物化学
化学
经济
计算机视觉
基因
经济增长
标识
DOI:10.1109/icedcs60513.2023.00063
摘要
With the development and application of UAV technology, collaborative combat route planning with UAVs is attracting more and more attention. This paper studies the UAV cooperative air combat route planning problem based on multi-objective particle swarm optimization(MOPSO), aiming to provide an effective, safe, and reliable means of UAV combat coordination. First, the basic principle and steps of the particle swarm optimization algorithm are introduced as the definition and evaluation index of multi-objective optimization. An improved MOPSO is proposed. By introducing non-dominated sorting, crowding distance, and mutation operation, the convergence and diversity of the algorithm are improved. Second, the UAV cooperative air combat route planning model is established, including flight model and constraints, assignment of missions and target functions, and route generation and smoothing. The UAV cooperative air combat route planning problem is transformed into a multi-objective optimization problem. Finally, the effectiveness and superiority of the proposed algorithm and model are verified through experimentation and analysis. Compared with other comparison algorithms, it can get a better route map depending on satisfying constraints and has better stability and robustness.
科研通智能强力驱动
Strongly Powered by AbleSci AI