Horbulin V.P., Hulianytskyi L.F., Sergienko I.V.
Optimization of UAV team routes at the availability of alternative and dynamic depots

The paper considers route optimization problems for unmanned aerial vehicles (UAV), which act as a team when inspecting or supporting a given set of objects in the presence of alternative and dynamic depots (starting and/or landing sites) and resource constraints. Problem definition and mathematical models are proposed. Such problems, in particular, include UAV flight planning problems, which use mobile platforms as a depot. The optimization criteria are both the total length of the routes and the number of UAVs involved. Algorithms for solving formulated combinatorial optimization problems based on ant colony optimization, tabu search, and exhaustive search have been developed and implemented. The results of the computational experiment are presented. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: ant algorithms, dynamic depot, gremlins, route optimization, tabu search, UAV, Ant colony optimization, Antennas, Combinatorial optimization, Tabu search, Combinatorial optimization problems, Computational experiment, Flight planning, Mobile platform, Optimization criteria, Problem definition, Resource Constraint, Route optimization, Unmanned aerial vehicles (UAV)

Cite:
Horbulin V.P., Hulianytskyi L.F., Sergienko I.V. (2020). Optimization of UAV team routes at the availability of alternative and dynamic depots. Cybernetics and Systems Analysis, 56 (2), 31–41. doi: https://doi.org/10.1007/s10559-020-00235-8 http://jnas.nbuv.gov.ua/article/UJRN-0001103869 [In Ukrainian].