Three-Dimensional Path Planning for UAV Based on Multi-Strategy Dream Optimization Algorithm

基于多策略梦境优化算法的无人机三维路径规划

阅读:1

Abstract

The multi-strategy optimized dream optimization algorithm (MSDOA) is proposed to address the challenges of inadequate search capability, slow convergence, and susceptibility to local optima in intelligent optimization algorithms applied to UAV three-dimensional path planning, aiming to enhance the global search efficiency and accuracy of UAV path planning algorithms in 3D environments. First, the algorithm utilizes Bernoulli chaotic mapping for population initialization to widen individual search ranges and enhance population diversity. Subsequently, an adaptive perturbation mechanism is incorporated during the exploration phase along with a lens imaging reverse learning strategy to update the population, thereby improving the exploration ability and accelerating convergence while mitigating premature convergence. Lastly, an Adaptive Individual-level Mixed Strategy (AIMS) is developed to conduct a more flexible search process and enhance the algorithm's global search capability. The performance of the algorithm is evaluated through simulation experiments using the CEC2017 benchmark test functions. The results indicate that the proposed algorithm achieves superior optimization accuracy, faster convergence speed, and enhanced robustness compared to other swarm intelligence algorithms. Specifically, MSDOA ranks first on 28 out of 29 benchmark functions in the CEC2017 test suite, demonstrating its outstanding global search capability and conver-gence performance. Furthermore, UAV path planning simulation experiments conducted across multiple scenario models show that MSDOA exhibits stronger adaptability to complex three-dimensional environments. In the most challenging scenario, compared to the standard DOA, MSDOA reduces the best cost function fitness by 9% and decreases the average cost function fitness by 12%, thereby generating more efficient, smoother, and higher-quality flight paths.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。