Navigation variable-based multi-objective particle swarm optimization for UAV path planning with kinematic constraints
Thi Thuy Ngan Duong, Duy-Nam Bui & Manh Duong Phung Published in Neural Computing and Applications, 2025 DOI: 10.1007/s00521-024-10945-1 Paper Arxiv Code
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 meta-heuristic 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.
Demo
To run the NMOPSO algorithm:
- Download all the source files from this repository.
- Open MATLAB.
- Execute the main script by running
NMOPSO.m
.
Below are visualizations of the NMOPSO algorithm in action for different scenarios:
Citation: Thi Thuy Ngan Duong, Duy-Nam Bui & Manh Duong Phung. "Navigation variable-based multi-objective particle swarm optimization for UAV path planning with kinematic constraints," in Neural Computing and Applications. 2025.