Cooperative Path Planning of Multiple UAVs by using Max–Min Ant Colony Optimization along with Cauchy Mutant Operator

In a dynamic environment with wind forces and tornadoes, eliminating fluctuations and noise is critical to get the optimal results. Avoiding collision and simultaneous arrival of multiple unmanned aerial vehicles (multi-UAVs) is also a great problem. This paper addresses the cooperative path planning of multi-UAVs with in a dynamic environment. To deal with the aforementioned issues, we combine the maximum–minimum ant colony optimization (MMACO) and Cauchy Mutant (CM) operators to make a bio-inspired optimization algorithm. Our proposed algorithm eliminates the limitations of classical ant colony optimization (ACO) and MMACO, which has the issues of the slow convergence speed and a chance of falling into local optimum. This paper chooses the CM operator to enhance the MMACO algorithm by comparing and examining the varying tendency of fitness function of the local optimum position and the global optimum position when taking care of multi-UAVs path planning problems. It also makes sure that the algorithm picks the shortest route possible while avoiding collision. Additionally, the proposed method is more effective and efficient when compared to the classic MMACO. Finally, the simulation experiment results are performed under the dynamic environment containing wind forces and tornadoes.