A Bat Algorithm with Mutation for UCAV Path Planning

Abstract EN

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments.

Original bat algorithm (BA) is used to solve the UCAV path planning problem.

Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating.

Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel.

This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA.

The realization procedure for original BA and this improved metaheuristic approach BAM is also presented.

To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA.

The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.