An ant colony algorithm for drone path planning

The UAV path planning described in this paper is to use the ant colony algorithm to plan the path of the UAV in two-dimensional space. Because of these shortcomings of the traditional ant colony algorithm, this paper first explains what the traditional ant colony algorithm is, as well as some defects of the traditional ant colony algorithm. Then an improved method is used to solve the ant colony algorithm, the basic central idea is to add a new set of ants to the original ant colony algorithm, so that the path algorithm can be calculated from both ends. When two sets of ants meet, you can add up the two sets of paths, and the optimal path is obtained. At the same time, the starting point can be set differently on the algorithm, the setting of obstacles can also be changed, the final path is compared to see what is different between the two algorithms, whether the resulting path changes.