The Determining the Flight Routes of Unmanned Aerial Vehicles Groups Based on Improved Ant Colony Algorithms
Hennadii Khudov, Олександр Олексенко, Vadym Lukianchuk, Volodymyr Herasymenko, Yaroslav Yaroshenko, Oleksiy Ishchenko, D. Ikaіev, Олег Головченко, Anatolii Volobuiev, Yevhen Drob, Yuriy Solomonenko, Irina Khizhnyak
Abstract
It is proposed to use an improved ant colony algorithm to determine the flight paths of unmanned aerial vehicles groups to the objects of intrest. A study was conducted on the application of the MAX-MIN Ant System to simultaneously determine the flight paths of several groups of unmanned aerial vehicles from different airfields to different objects of interest. Obstacles in the path of the unmanned aerial vehicles flight are also taken into account. As an example, the problem of a unmanned aerial vehicles breakthrough of an air defense system is considered. The number of unmanned aerial vehicles required to destroy the object of impact with a given probability is taken into account. The efficiency of the algorithm in the conditions of non - stationary environment is also investigated. Keywords— unmanned aerial vehicle, group, ant colony algorithm, route, flight, optimization