This email address is being protected from spambots. You need JavaScript enabled to view it.
 
+7 (4912) 72-03-73
 
Интернет-портал РГРТУ: http://rsreu.ru

UDC 621.396

OPTIMIZING THE ROUTE OF UNMANNED AERIAL VEHICLES WITH RADIOREPEATERS

V. I. Dmitriev, full Professor, PhD, Professor of the Radiocommunication Department of the Military Communication Academy, This email address is being protected from spambots. You need JavaScript enabled to view it.
S. A. Grushevoy, postgraduate student of the Military Academy of Communications; This email address is being protected from spambots. You need JavaScript enabled to view it.

A comparative analysis of methods for optimizing the route of movement of unmanned aerial vehicles with radio communication repeaters in case of spatially distributed foci of emergency situations (forest fires, floods) is made on a certain example of practical importance. The aim of the paper is a comparative analysis of the methods for solving traveling salesman problem for a particular, practically important case. The task is presented in a logistical interpretation and solved using several methods for solving the traveling salesman problem known. The dimension of the problem makes it possible to implement a complete search of all variants as a standard of the optimal (shortest) route. The standard compares the results of applying methods: branches and boundaries, mu ravine colonies, genetic algorithm and the «greedy» algorithm based on the rule of the nearest neighbor. The high quality of problem solution was confirmed with the use of the ant colony method, however, for a sufficiently large dimension of the problem, it is promising to solve multiple traveling salesman problem with the clustering of emergencies and the use of a complete enumeration of routes variants for the movement of unmanned aerial vehicles. The measure of problem solution quality is the proximity of the solution obtained to the ideal solution, which is obtained by a complete search of UAV routes variants.

Key words: route optimization, traveling salesman problem

 Download