计算机与现代化 ›› 2025, Vol. 0 ›› Issue (06): 51-55.doi: 10.3969/j.issn.1006-2475.2025.06.008

• 算法设计与分析 • 上一篇    下一篇

基于改进烟花算法的多无人机路径规划


  

  1. (上海理工大学理学院,上海 200093)
  • 出版日期:2025-06-30 发布日期:2025-07-01
  • 作者简介: 作者简介:杨进(1978—),女,硕士生导师,博士,研究方向:智能优化,图论与组合优化,E-mail: yangjin0903@163.com; 陈步前(1998—),男,山东济宁人,硕士研究生,研究方向:无人机路径规划,E-mail: cbq981208@163.com。
  • 基金资助:
    基金项目:国家自然科学基金资助项目(12071293)

Multi-UAV Path Planning Based on Improved Fireworks Algorithm 

  1. (School of Science, University of Shanghai for Science and Technology, Shanghai 200093, China) 
  • Online:2025-06-30 Published:2025-07-01

摘要: 摘要:本文研究多个无人机在复杂环境下的路径规划,设计满足约束条件的目标函数。同时针对烟花算法在全局收敛和局部收敛上的不足,提出一种改进的烟花算法。在产生变异火花的过程中,利用Levy变异代替高斯变异生成变异火花,同时规避了算法原本容易在原点处陷入局部最优的问题;另外为了提升烟花算法的局部性以及个体之间的信息交换,引入一种深度信息交换策略来选择下一代的火花。将改进后的烟花算法和其他智能优化算法进行比较,仿真结果表明,改进后的烟花算法收敛速度以及稳定性具有显著优势,可以更好地进行多无人机的路径规划。

关键词: 关键词:路径规划, 烟花算法, 深度信息交换策略, Levy分布

Abstract: Abstract: In this paper, the path planning of multiple UAVs in complex environment is studied, and the objective function satisfying the constraints is designed. At the same time, aiming at the shortcomings of fireworks algorithm in global convergence and local convergence, an improved fireworks algorithm is proposed. In the process of generating variation spark, Levy variation is used instead of Gaussian variation to generate variation spark, and the problem that the algorithm is easy to fall into local optimal at the origin is avoided. In addition, in order to improve the locality of the fireworks algorithm and the information exchange between individuals, a deep information exchange strategy is introduced to select the next generation of sparks. By comparing the improved fireworks algorithm with other intelligent optimization algorithms, the simulation results show that the improved fireworks algorithm has significant advantages in convergence speed and stability, and can better carry out multi-UAV path planning. 

Key words: Key words: path planning, fireworks algorithm, deep information exchange strategy, Levy distribution

中图分类号: