Navigation Variable-based Multi-objective Particle Swarm Optimization for UAV Path Planning with Kinematic Constraints
Path planning is essential for unmanned aerial vehicles (UAVs) as it determines the path that the UAV needs to follow to complete a task. This work addresses this problem by introducing a new algorithm called navigation variable-based multi-objective particle swarm optimization (NMOPSO). It first models path planning as an optimization problem via the definition of a set of objective functions that include optimality and safety requirements for UAV operation. The NMOPSO is then used to minimize those functions through Pareto optimal solutions. The algorithm features a new path representation based on navigation variables to include kinematic constraints and exploit the maneuverable characteristics of the UAV. It also includes an adaptive mutation mechanism to enhance the diversity of the swarm for better solutions. Comparisons with various algorithms have been carried out to benchmark the proposed approach. The results indicate that the NMOPSO performs better than not only other particle swarm optimization variants but also other state-of-the-art multi-objective and metaheuristic optimization algorithms. Experiments have also been conducted with real UAVs to confirm the validity of the approach for practical flights. The source code of the algorithm is available at https://github.com/ngandng/NMOPSO.
Code (2)
Tasks
Metaheuristic OptimizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Dynamic Multi Objective Particle Swarm Optimization based on a New Environment Change Detection Strategy
The dynamic of real-world optimization problems raises new challenges to the traditional particle swarm optimization (PSO). Responding to these challenges, the dynamic optimization has received considerable attention ove…
Change DetectionA Study of the Fundamental Parameters of Particle Swarm Optimizers
The range of applications of traditional optimization methods are limited by the features of the object variables, and of both the objective and the constraint functions. In contrast, population-based algorithms whose op…
Evolutionary AlgorithmsArchive-based swarms
The Particle Swarm Optimization (PSO) algorithm updates each individual's velocity and position using its own prior best position and the best position found so far by any particle. Effective search for global optima can…
PositionUsing Variable Interaction Graphs to Improve Particle Swarm Optimization
This paper presents Variable Interaction Graph Particle Swarm Optimization (VIGPSO), an adaptation to Particle Swarm Optimization (PSO) that dynamically learns and exploits variable interactions during the optimization p…
A Novel Multi-Objective Velocity-Free Boolean Particle Swarm Optimization
This paper extends boolean particle swarm optimization to a multi-objective setting, to our knowledge for the first time in the literature. Our proposed new boolean algorithm, MBOnvPSO, is notably simplified by the omiss…
DiversityPosition