title: ÐÐ¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð¿ÐµÑÐµÐ´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ Ð±ÐµÑÐ¿Ð¸Ð»Ð¾ÑÐ½ÑÑ Ð»ÐµÑÐ°ÑÐµÐ»ÑÐ½ÑÑ Ð°Ð¿Ð¿Ð°ÑÐ°ÑÐ¾Ð²
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Optimization of unmanned aerial vehicle routes
Creators: name: ÐÐ¸, ÐÑÐºÐ°Ð´Ð¸Ð¹
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2024
Subjects: Ð·Ð°Ð´Ð°ÑÐ° ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÐµÑÐ°
Ð¼ÐµÑÐ¾Ð´ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ Ð¿ÐµÑÐµÐ±Ð¾ÑÐ°
Ð¼ÐµÑÐ¾Ð´ Ð±Ð»Ð¸Ð¶Ð°Ð¹ÑÐµÐ³Ð¾ ÑÐ¾ÑÐµÐ´Ð°
Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¸Ð¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¼ÑÑÐ°Ð²ÑÑ
traveling salesman problem
complete search method
nearest neighbor method
genetic algorithm
ant algorithm

description: Ð¢ÐµÐ¼Ð° Ð²ÑÐ¿ÑÑÐºÐ½Ð¾Ð¹ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ: Â«ÐÐ¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð¿ÐµÑÐµÐ´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ Ð±ÐµÑÐ¿Ð¸Ð»Ð¾ÑÐ½Ð¾Ð³Ð¾ Ð»ÐµÑÐ°ÑÐµÐ»ÑÐ½Ð¾Ð³Ð¾ Ð°Ð¿Ð¿Ð°ÑÐ°ÑÐ°Â». ÐÐ°Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° ÑÐ°Ð·Ð±Ð¾ÑÑ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÑÐµÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÐµÑÐ°, Ð¸Ñ Ð°Ð½Ð°Ð»Ð¸Ð·Ñ, Ð²ÑÐ±Ð¾ÑÑ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¼ÐµÑÐ¾Ð´Ð° Ð¸ ÑÐ¾ÑÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ð³Ð¾ Ð¿ÑÐ¸Ð»Ð¾Ð¶ÐµÐ½Ð¸Ñ Ð´Ð»Ñ ÑÐ¾ÑÐ¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð¼Ð°ÑÑÑÑÑÐ° Ð¿ÑÐ¸ Ð·Ð°Ð´Ð°Ð½Ð½ÑÑ ÐºÐ¾Ð¾ÑÐ´Ð¸Ð½Ð°ÑÐ°Ñ. ÐÐ°Ð´Ð°ÑÐ¸, ÐºÐ¾ÑÐ¾ÑÑÐµ ÑÐµÑÐ°Ð»Ð¸ÑÑ Ð² ÑÐ¾Ð´Ðµ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ: 1) ÐÐ±Ð·Ð¾Ñ ÑÐ¾Ð²ÑÐµÐ¼ÐµÐ½Ð½Ð¾Ð³Ð¾ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸Ñ Ð±ÐµÑÐ¿Ð¸Ð»Ð¾ÑÐ½ÑÑ Ð»ÐµÑÐ°ÑÐµÐ»ÑÐ½ÑÑ Ð°Ð¿Ð¿Ð°ÑÐ°ÑÐ¾Ð². 2) ÐÐ¾ÑÑÐ°Ð½Ð¾Ð²ÐºÐ° Ð¸ Ð¾Ð¿Ð¸ÑÐ°Ð½Ð¸Ðµ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÐµÑÐ°; 3) ÐÑÐ¸Ð²ÐµÐ´ÐµÐ½Ð¸Ðµ Ð¸ Ð¾Ð±Ð·Ð¾Ñ ÑÐµÑÑÑÐµÑ ÑÑÑÐµÑÑÐ²ÑÑÑÐ¸Ñ Ð¼ÐµÑÐ¾Ð´Ð¾Ð² ÑÐµÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÐµÑÐ° (Ð¼ÐµÑÐ¾Ð´ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ Ð¿ÐµÑÐµÐ±Ð¾ÑÐ°, Ð¼ÐµÑÐ¾Ð´ Ð±Ð»Ð¸Ð¶Ð°Ð¹ÑÐµÐ³Ð¾ ÑÐ¾ÑÐµÐ´Ð°, Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¸Ð¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸ Ð¶Ð°Ð´Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼); 4) Ð¡ÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð¸ Ð°Ð½Ð°Ð»Ð¸Ð· Ð¼ÐµÑÐ¾Ð´Ð¾Ð² Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¼Ð°ÑÑÑÑÑÐ°; 5) Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ð³Ð¾ Ð¿ÑÐ¸Ð»Ð¾Ð¶ÐµÐ½Ð¸Ñ, ÑÐµÐ°Ð»Ð¸Ð·ÑÑÑÐµÐ³Ð¾ Ð¼ÐµÑÐ¾Ð´Ñ ÑÐµÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÑÑÐ°. Ð ÑÐ¾Ð´Ðµ Ð²ÑÐ¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ ÑÐ°Ð±Ð¾ÑÑ Ð±ÑÐ»Ð¸ ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ñ Ð¸ Ð¿ÑÐ¾Ð°Ð½Ð°Ð»Ð¸Ð·Ð¸ÑÐ¾Ð²Ð°Ð½Ñ ÑÐµÑÑÑÐµ ÑÐ°Ð·Ð»Ð¸ÑÐ½ÑÑ Ð¼ÐµÑÐ¾Ð´Ð° ÑÐµÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÐµÑÐ°: Ð¼ÐµÑÐ¾Ð´ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ Ð¿ÐµÑÐµÐ±Ð¾ÑÐ°, Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¼ÑÑÐ°Ð²ÑÑ, Ð¼ÐµÑÐ¾Ð´ Ð±Ð»Ð¸Ð¶Ð°Ð¹ÑÐµÐ³Ð¾ ÑÐ¾ÑÐµÐ´Ð° Ð¸ Ð³ÐµÐ½ÐµÑÐ¸ÑÐµÑÐºÐ¸Ð¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼.Â  ÐÑÐ¾Ð²ÐµÐ´ÐµÐ½ ÑÑÐ°Ð²Ð½Ð¸ÑÐµÐ»ÑÐ½ÑÐ¹ Ð°Ð½Ð°Ð»Ð¸Ð· Ð¼ÐµÑÐ¾Ð´Ð¾Ð² Ñ ÑÐµÐ»ÑÑ Ð¾Ð¿ÑÐµÐ´ÐµÐ»Ð¸ÑÑ Ð½Ð°Ð¸Ð±Ð¾Ð»ÐµÐµ ÑÑÑÐµÐºÑÐ¸Ð²Ð½ÑÐ¹ Ð¸ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½ÑÐ¹ Ð´Ð»Ñ ÑÐ¾ÑÐ¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¼Ð°ÑÑÑÑÑÐ°. Ð ÐµÐ·ÑÐ»ÑÑÐ°ÑÑÂ  ÑÑÐ°Ð²Ð½Ð¸ÑÐµÐ»ÑÐ½Ð¾Ð³Ð¾Â  Ð°Ð½Ð°Ð»Ð¸Ð·Ð°Â  Ð¿Ð¾Ð´ÑÐ²ÐµÑÐ´Ð¸Ð»Ð¸, ÑÑÐ¾Â  Ð¼ÐµÑÐ¾Ð´ Ð±Ð»Ð¸Ð¶Ð°Ð¹ÑÐµÐ³Ð¾ ÑÐ¾ÑÐµÐ´Ð° ÑÐ²Ð»ÑÐµÑÑÑ Ð½Ð°Ð¸Ð±Ð¾Ð»ÐµÐµ ÑÐ¾ÑÐ½ÑÐ¼ Ð¸ Ð±ÑÑÑÑÑÐ¼, Ð¾Ð±ÐµÑÐ¿ÐµÑÐ¸Ð²Ð°Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ðµ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ðµ Ð¼Ð°ÑÑÑÑÑÐ°. ÐÐ° Ð¾ÑÐ½Ð¾Ð²Ðµ Ð¿Ð¾Ð»ÑÑÐµÐ½Ð½ÑÑ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐ¾Ð² Ð±ÑÐ»Ð¾ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð¾ Ð¸ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð¾ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ðµ Ð¿ÑÐ¸Ð»Ð¾Ð¶ÐµÐ½Ð¸Ðµ, Ð¿ÑÐµÐ´Ð½Ð°Ð·Ð½Ð°ÑÐµÐ½Ð½Ð¾Ðµ Ð´Ð»Ñ ÑÐ¾ÑÐ¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¼Ð°ÑÑÑÑÑÐ° Ð±ÐµÑÐ¿Ð¸Ð»Ð¾ÑÐ½Ð¾Ð³Ð¾ Ð»ÐµÑÐ°ÑÐµÐ»ÑÐ½Ð¾Ð³Ð¾ Ð°Ð¿Ð¿Ð°ÑÐ°ÑÐ° (ÐÐÐÐ) Ð² ÑÐ°Ð¼ÐºÐ°Ñ Ð¿Ð¾Ð¸ÑÐºÐ¾Ð²Ð¾-ÑÐ¿Ð°ÑÐ°ÑÐµÐ»ÑÐ½ÑÑ Ð¾Ð¿ÐµÑÐ°ÑÐ¸Ð¹ Ð¿ÑÐ¸ Ð·Ð°Ð´Ð°Ð½Ð½ÑÑ ÐºÐ¾Ð¾ÑÐ´Ð¸Ð½Ð°ÑÐ°Ñ. Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ðµ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ðµ Ð¿ÑÐ¸Ð»Ð¾Ð¶ÐµÐ½Ð¸Ðµ ÑÑÐ¿ÐµÑÐ½Ð¾ Ð²ÑÐ¿Ð¾Ð»Ð½ÑÐµÑ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ðµ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¼Ð°ÑÑÑÑÑÐ° Ð¸ Ð¿ÑÐµÐ´Ð¾ÑÑÐ°Ð²Ð»ÑÐµÑ Ð¸Ð½ÑÐ¾ÑÐ¼Ð°ÑÐ¸Ñ Ð¾ ÐµÐ³Ð¾ Ð´Ð»Ð¸Ð½Ðµ. ÐÑÐ¾Ð¼Ðµ ÑÐ¾Ð³Ð¾, Ð¾Ð½Ð¾ ÑÐ°ÐºÐ¶Ðµ Ð¿Ð¾Ð·Ð²Ð¾Ð»ÑÐµÑ ÑÐ¾ÑÑÐ°Ð½ÑÑÑ HTML-ÐºÐ°ÑÑÑ Ñ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð½ÑÐ¼ Ð¼Ð°ÑÑÑÑÑÐ¾Ð¼, ÑÑÐ¾ Ð¾Ð±ÐµÑÐ¿ÐµÑÐ¸Ð²Ð°ÐµÑ Ð²Ð¸Ð·ÑÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ñ Ð¸ ÑÐ´Ð¾Ð±Ð½ÑÐ¹ Ð´Ð¾ÑÑÑÐ¿ Ðº ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐ°Ð¼.
description: Theme of the final qualification work: âOptimization of routes of unmanned aerial vehicle movementâ. This work is devoted to the analysis of methods for solving the problem of the traveling salesman, their analysis, selection of the optimal method and compilation of a software application for the formation of the route at given coordinates. The tasks that were solved during the research: 1) Review of the modern use of unmanned aerial vehicles; 2) Formulation and description of the traveling salesperson problem; 3) Introduction and review of four existing methods for solving the traveling salesperson problem (brute-force method, nearest neighbor method, genetic algorithm and greedy algorithm); 4) Comparison and analysis of the methods in constructing the optimal route; 5) Development of a software application that realizes the methods of solving the traveling salesperson problem. In the course of the work, we have considered and analyzed four different methods of solving the traveling salesperson problem: the method of complete search, the ant algorithm, the nearest neighbor method, and the genetic algorithm.Â  A comparative analysis of the methods was conducted to determine the most efficient and optimal one for forming the optimal route. The results of the comparative analysis confirmed that the nearest-neighbor method is the most accurate and fastest, providing optimal route construction. Based on the results obtained, a software application was developed and implemented to form the optimal route of an unmanned aerial vehicle (UAV) in search and rescue operations at given coordinates. The developed software application successfully calculates the optimal route and provides information about its length. In addition, it also allows saving an HTML map with the constructed route, which provides visualization and easy access to the results.