UAV path planning with multiagent Ant Colony system approach

In this study, a solution approach of the problem of globally optimal trajectory planning of Unmanned Aerial Vehicle (UAV) has been proposed modeling as Ant Colony Optimization (ACO) with a multiagent structure. The solution of UAV's route problem in environments that have a large number of control points and obstacles such as radars and mountain is very complex and can be solved with the help of the different optimization algorithms. The proposed method is modeled on Netlogo, an agent-based programming environment. Simulation results show that the ACO greatly optimize the route length and reduce the average flight time for UAV's route planning.

[1]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Serkan Balli,et al.  Ant Colony Optimization In Multi-Agent Systems With NetLogo , 2013 .

[3]  Guray Yilmaz,et al.  2D path planning for UAVs in radar threatening environment using simulated annealing algorithm , 2015, 2015 International Conference on Unmanned Aircraft Systems (ICUAS).

[4]  Serkan Balli,et al.  Çok Etmenli Sistemlerde NetLogo İle Karınca Kolonisi Optimizasyonu , 2013 .

[5]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[6]  Ozgur Koray Sahingoz,et al.  Solving asymmetric traveling salesman problem using genetic algorithm , 2015, 2015 23nd Signal Processing and Communications Applications Conference (SIU).

[7]  Ozgur Koray Sahingoz,et al.  A UAV path planning with parallel ACO algorithm on CUDA platform , 2014, 2014 International Conference on Unmanned Aircraft Systems (ICUAS).