Path planning of multiple UAVs using MMACO and DE algorithm in dynamic environment

Cooperative path planning of multiple unmanned aerial vehicles is a complex task. The collision avoidance and coordination between multiple unmanned aerial vehicles is a global optimal issue. This research addresses the path planning of multi-colonies with multiple unmanned aerial vehicles in dynamic environment. To observe the model of whole scenario, we combine maximum-minimum ant colony optimization and differential evolution to make metaheuristic optimization algorithm. Our designed algorithm, controls the deficiencies of present classical ant colony optimization and maximum-minimum ant colony optimization, has the contradiction among the excessive information and global optimization. Moreover, in our proposed algorithm, maximum-minimum ant colony optimization is used to lemmatize the pheromone and only best ant of each colony is able to construct the path. However, the path escape by maximum-minimum ant colony optimization and it treated as the object for differential evolution constraints. Now, it is ensuring to find the best global colony, which provides optimal solution for the entire colony. Furthermore, the proposed approach has an ability to increase the robustness while preserving the global convergence speed. Finally, the simulation experiment results are performed under the rough dynamic environment containing some high peaks and mountains.