Abstract

Particle swarm optimization (PSO), one of the classical path planning algorithms, has been considered for unmanned aerial vehicle (UAV) path planning more frequently in recent years. A large amount of studies on UAV path planning based on modified PSO have been reported. However, most UAV path planning algorithms still optimize only one kind terrain problem which is mountain terrain. At the same time, many modified PSO algorithms also have some problems, such as insufficient convergence and unsatisfactory efficiency. In this paper, six kinds of terrain functions of UAV path planning are proposed to simulate real-world application. The terrain functions contain city, village without houses, village with houses, mountainous area without houses, mountainous area with houses, and mountainous area with a huge building. Inspired by CLPSO and BLPSO, we proposed a new double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems. The double-dynamic biogeography-based learning strategy replacing the traditional learning mechanism from the personal and global best particles is used to select the learning particles. In this strategy, each particle will learn from the better one of two selected particles which are not worse than itself. However, one random component of particle will replaced by corresponding component of other particle if all components of the particle only learn from itself. In this way, particles sufficiently learn from better objects and maintain the ability of jumping out of local optimality. The superiority of our algorithm is verified with four relevant algorithms, a PSO variant, and a BBO variant on the benchmark suite of CEC2015. Real-world application demonstrates that the algorithm we proposed outperforms four relevant algorithms, a PSO variant, and a BBO variant both in small-scale problems and large-scale problems. This paper shows a good application of our novel algorithm.

Highlights

  • unmanned aerial vehicle (UAV) path planning is designed in a space which represents environment experienced by UAV during its flight. e path is a link formed by the combination of all the points and the lines connecting them, and each path is a solution

  • We proposed a novel double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems

  • Double-dynamic biogeographybased learning particle swarm optimization is proposed based on above strategies. e process of DDBLPSO is described in Algorithm 1

Read more

Summary

Introduction

UAV path planning is designed in a space which represents environment experienced by UAV during its flight. e path is a link formed by the combination of all the points and the lines connecting them, and each path is a solution. UAV path planning is a multiobjective constraint problem, which is described as follows: min fi(X), i 1, 2, . Danger function is used to penalize the paths going through danger zones which is modelled as equation (6) in this paper. Collision function is used to penalize the paths colliding with ground or buildings which is modelled as follows:. We proposed a novel double-dynamic biogeography-based learning particle swarm optimization (DDBLPSO) algorithm to solve these problems. E algorithm considers the problem of insufficient convergence and accuracy and unsatisfactory efficiency for global optimization and can be applied to UAV path planning.

Literature Review
Relevant Algorithms
Numerical Simulations for Global Optimization
Applications in UAV Path Planning
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call