Three-dimensional UAV Path Planning Based on LBDBO Blgorithm

In the process of solving unmanned aerial vehicle (UAV) path planning problems, the dung beetle algorithm has limitations in global exploration capability and is prone to getting trapped in local optima. An improved dung beetle algorithm for UAV path planning is proposed. Firstly, a three-dimensional mission space model and a cost function for UAV path planning are established; secondly, a Logistic-Tent chaotic mapping, a variational strategy combining Levy flight and Brownian motion, and a cubic B-spline curve to generate smooth paths are added to the dung beetle algorithm; finally, the improved dung beetle algorithm is tested and applied to three-dimensional path planning. Simulation experiments proves that the improved dung beetle algorithm is superior and the solved paths are feasible and of higher quality compared with other algorithms.