Preview

Mekhatronika, Avtomatizatsiya, Upravlenie

Advanced search

Routing of a Light Unmanned Aerial Vehicle in a Constant Wind Field with Account of Constraint on the Flight Duration

https://doi.org/10.17587/mau/17.206-210

Abstract

Recently, some articles have appeared which discuss the problem of preflight routing for the unmanned aerial vehicles (UAV). The importance of the problem is determined by the fact that its solving is necessary for flight planning and modeling of UAV with a view of an effective assessment of its mission. The above mentioned papers view routing as a sequence of flights over the setpoints with certain positioning data. The notion of route optimality is associated with, on the one hand, increasing amount of the setpoints included into the route and, on the other hand, with a decrease of the period of time for an en-route flight. In this case, consideration of the problem of routing with a constraint for the en-route flight time is of practical relevance. Thus, it is the amount of the setpoints potentially set by the route that must serve as a maximal criterion. It is quite clear that such statement may result in a situation, when some selected setpoints are out of the optimal route. The paper describes the methods of finding a light UAV circle trip which links the maximum of the equivalent setpoints in a constant wind field taking into account the time constraint. The selected route is the fastest of all the routes linking the setpoints. The methods envisage consecutive solving of the purposely set central and sub-related routing problems. Mathematically, they are the problems of linear Boolean programming. Thus, a flight route can be divided in two stages. At the first stage, it is necessary to define the maximum of the setpoints linked by the routes with the flight time, which does not exceed the one, which is allowed. At the second stage, one should define the fastest of the first stage routes. An example was introduced explaining the details and showing the performance capacity of the present flight routing procedure. The results can be used at the planning stage for modeling of UAV application with a view to improve assessment of its mission effectiveness, as well as for designing of special algorithms and software for the UAV controllers' working area.

About the Authors

D. V. Moiseev
Moscow Aviation Institute (National Research University)
Russian Federation


V. M. Trinh
Moscow Aviation Institute (National Research University)
Russian Federation


References

1. Гимадеев Р. Г., Моисеев В. С. Выбор оптимального маршрута облета беспилотным летательным аппаратом заданной совокупности районов выполнения полетных заданий // Вестник КГТУ им. А. Н. Туполева. 2014. № 3. С. 208-212.

2. Лебедев Г. Н., Ефимов А. В., Мирзоян Л. А. Метод маршрутизации облета неподвижных объектов при мониторинге наземной обстановки на основе динамического программирования // Мехатроника, автоматизация, управление. 2012. № 1. С. 63-70.

3. Nicola Ceccarelli, John J. Enright, Emilio Frazzoli, Steven J. Rasmussen and Corey J. Schumacher. Micro UAV Path Planning for Reconnaissance in Wind. Proceedings of the 2007 American Control Conference. New York City, USA, July 11-13, 2007.

4. Таргамадзе Р. Ч., Моисеев Д. В., Фам С. К. О рациональном выборе замкнутого маршрута полета легкого летательного аппарата с учетом прогноза ветра // Вестник ФГУП НПО им. С. А. Лавочкина. 2012. № 3. С. 76-83.

5. Моисеев Д. В. Существование и построение областей постоянства замкнутых маршрутов наискорейшего облета заданного набора точек в поле постоянного ветра // Научно-технический вестник Поволжья. 2015. № 4. С. 96-100.

6. Подлипьян П. Е., Максимов Н. А. Многофазный алгоритм решения задачи планирования полета группы беспилотных летательных аппаратов // Электронный журнал "Труды МАИ", 2011. Выпуск № 43. URL: http://www.mai.ru/science/trudy/published.php?ID =24769

7. Моисеев Д. В., Чинь В. М., Мозолев Л. А., Моисеева С. Г., Фам С. К. Маршрутизация полета легкого беспилотного летательного аппарата в поле постоянного ветра на основе решения разновидностей задачи коммивояжера // Электронный журнал "Труды МАИ", 2015, № 79. http://www.mai.ru/science/trudy/published.php?ID = 55782

8. Moiseev Dmitriy Victorovich, Pham Xuan Quyen, Trinh Van Minh. Setting optimal closed flight route of lightweight unmanned aerial vehicles with consideration of wind in flight area. Vietnam National University Ho Chi Minh City, Science and technology development journal, Vol. 17, No. K3-2014, c. 99-108.

9. Козлов М. В., Костюк Ф. В., Сорокин С. В., Тюленев А. В. Решение задачи коммивояжера методом целочисленного линейного программирования с последовательным исключением подциклов: описание и алгоритмическая реализация// Advanced Science. 2012. № 2. с. 124-141.

10. Козлов М. В., Костюк Ф. В., Сорокин С. В., Тюленев А. В. Решение задачи коммивояжера методом целочисленного линейного программирования с последовательным исключением подциклов: обоснование, тестовые испытания, применение // Advanced Science. 2012. № 2. с. 142-159.


Review

For citations:


Moiseev D.V., Trinh V.M. Routing of a Light Unmanned Aerial Vehicle in a Constant Wind Field with Account of Constraint on the Flight Duration. Mekhatronika, Avtomatizatsiya, Upravlenie. 2016;17(3):206-210. (In Russ.) https://doi.org/10.17587/mau/17.206-210

Views: 616


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1684-6427 (Print)
ISSN 2619-1253 (Online)