Optimization of decisions when planning a UAV group mission with alternative depots

As new technologies develop, many optimization problems arise, generated by the problems of effective mission planning of individual UAVs and their groups (teams). The paper considers the problem of optimizing decisions when planning a UAV group mission to inspect or service a given set of customers (targets) in the presence of alternative depots. A substantive formulation and mathematical model of the problem of distributing targets by bases and UAVs and optimizing their routes when performing inspection and/or servicing a given set of targets with the condition of completing the route in certain reception areas (depots) and restrictions on UAV resources as a special combinatorial optimization problem are presented. To solve this problem, a max-min algorithm of ant systems has been developed, with the step-by-step interaction of ants to form solutions, as well as a special algorithm for deterministic local search. The results of a computational experiment are presented.