bsuirДоклады БГУИРDoklady BGUIR1729-76482708-0382БГУИРbsuir-1094Research ArticleЭЛЕКТРОНИКА, РАДИОФИЗИКА, РАДИОТЕХНИКА, ИНФОРМАТИКАELECTRONICS, RADIOPHYSICS, RADIOENGINEERING, INFORMATICSМЕТОДИКА РАСЧЕТА ТРАЕКТОРИЙ ПОЛЕТА БЕСПИЛОТНЫХ ЛЕТАТЕЛЬНЫХ АППАРАТОВ ДЛЯ НАБЛЮДЕНИЯ ЗА МЕСТНОСТЬЮAlgorithm of building UAV flight trajectories for static target surveillanceМарковА. В.MarkovA. V.

Марков Александр Владимирович - к.т.н., доцент, заведующий кафедрой систем управления

220013, г. Минск, ул. Гикало, 5

тел. +375-17-293-86-02

Markau Aliaksandr Uladzimiravich - PhD, associate, head of control systems department

220013, Republic of Belarus, Minsk, Gikalo st., 5

tel. +375-17-293-86-02

markov@bsuir.byСиманьковВ. И.SimankovV. I.

аспирант кафедры систем управления

PG student of control systems department

Белорусский государственный университет информатики и радиоэлектроникиBelarusian state university of informatics and radioelectronics201904062019045763Copyright © Марков А.В., Симаньков В.И., 20192019Марков А.В., Симаньков В.И.Markov A.V., Simankov V.I.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://doklady.bsuir.by/jour/article/view/1094

В статье приведен алгоритм решения задачи построения траектории полета беспилотных летательных аппаратов для наблюдения за статическими целями. Алгоритм обеспечивает близкий к минимальному путь и учитывает ограничение на минимальный радиус поворота.

We describe an algorithm building UAV flight path for static targets surveillance. The algorithm provides a sub minimal path and takes into consideration limitation by the maximum turning radius.

задача коммивояжерапуть Дубинсабеспилотный летательный аппаратtravelling salesman problemDubins pathunmanned aerial vehicleReferencesShkel A.M., Lumelsky V. Classification of the Dubins set // Robotics and Autonomous Systems. 2001. Vol. 34. P. 179–202.Shkel A.M., Lumelsky V. Classification of the Dubins set // Robotics and Autonomous Systems. 2001. Vol. 34. P. 179–202.Dolinskaya I., Maggiar A. Time-optimal trajectories with bounded curvature in anisotropic medium // The International Journal of Robotics Research. 2012. Vol. 12-02. P. 1–48.Dolinskaya I., Maggiar A. Time-optimal trajectories with bounded curvature in anisotropic medium // The International Journal of Robotics Research. 2012. Vol. 12-02. P. 1–48.Walker A. Hard Real-Time Motion Planning for Autonomous Vehicles // PhD thesis, Swinburne University, 2011.Walker A. Hard Real-Time Motion Planning for Autonomous Vehicles // PhD thesis, Swinburne University, 2011.Dubins Orienteering Problem / R. Penicka [et al.] // IEEE robotics and automation letters. 2017. Vol 2, iss. 2. P. 1210–1217.Dubins Orienteering Problem / R. Penicka [et al.] // IEEE robotics and automation letters. 2017. Vol 2, iss. 2. P. 1210–1217.Helsgaun K. An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic // European Journal of Operational Research. 2000. № 121. P. 106–130.Helsgaun K. An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic // European Journal of Operational Research. 2000. № 121. P. 106–130.LKH Version 2.0.7 (November 2012). [Electronic resourse]. URL: http://www.akira.ruc.dk/~keld/research/LKH. (date of access: 01.04.2017).LKH Version 2.0.7 (November 2012). [Electronic resourse]. URL: http://www.akira.ruc.dk/~keld/research/LKH. (date of access: 01.04.2017).Isaacs J.T., Hespanha J.P. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. // Algorithms. 2013. Vol. 6. P. 84–99.Isaacs J.T., Hespanha J.P. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. // Algorithms. 2013. Vol. 6. P. 84–99.Xu J., He L., Pan J. A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements // IEEE Transactions on Mobile Computing. 2013. № 12. P. 1308–1320.Xu J., He L., Pan J. A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements // IEEE Transactions on Mobile Computing. 2013. № 12. P. 1308–1320.

The authors declare that there are no conflicts of interest present.