English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

. The problem of planning the mission of a set of heterogeneous unmanned aerial vehicles (UAVs)is considered, which is to survey and/or service a given set of targets in the field. A mathematical model of the problem and algorithms for its solving that is based on deterministic local search, as well as optimization by ant colonies are proposed. The efficiency of algorithms is investigated based on the results of solving problems with real objects in the field. The relative error of the results of each algorithm was obtained, which allowed to compare their efficiency.The purpose of the paper is to solve a routing problem in different ways to reduce overall mission cost and compare the efficiency. The problem statement considers multiple starting points and destinations (depots) for UAVs with determined capacity, so algorithms proposed in the paper are designed to optimize the initial placement. Each UAV has a maximum flight distance because of an energy limit, though vehicles can be recharged by visiting one of previously placed depots. The mission goal is to visit all the given targets while minimizing the overall cost, so fuel consumption over distance, depot placement, and resources needed to survey and/or service of the target by each UAV are considered as components of the final cost metric to be minimized considering a set of specific constraints.Results. To solve the given UAV routing problem, a max-min algorithm of ant systems was developed, which features step-by-step interaction of ants to form solutions, a hybrid taboo search algorithm and a deterministic local search algorithm - the decay vector method. The developed algorithms were tested both on the known travelling salesman problems, and on specially developed problems with multiple depots and additional restrictions. Conclusions. The proposed algorithms which are based on ant colony optimization are compared both in terms of accuracy and computation time. A hybrid algorithm achieved slightly better score, though computation time has increased. Keywords: routing, combinatorial optimization, UAV, local search, ant colony optimization algorithms.

Formalization of the Problem of Optimization of Base Places and Routes of the UAV Group