%0 Conference Proceedings
%T Determination of the Optimal Routes for Autonomous Unmanned Aerial Vehicle Under Varying Wind with Using of the Traveling Salesman Problem Algorithm
%+ Wroclaw University of Science and Technology
%+ Tadeusz Kościuszko Land Forces Military Academy
%A Greblicki, Jerzy
%A Walczyński, Maciej
%Z Part 5: Scheduling in Manufacturing and Other Applications
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Vilnius, Lithuania
%Y Khalid Saeed
%Y Władysław Homenda
%I Springer International Publishing
%3 Computer Information Systems and Industrial Management
%V LNCS-9842
%P 334-341
%8 2016-09-14
%D 2016
%R 10.1007/978-3-319-45378-1_30
%K Multicopters
%K UAV
%K Traveling salesman problem (TSP)
%K Drone routing problem (DRP)
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X The goal of this paper is to propose and test the algorithm for traveling salesman problem (TSP) for autonomous unmanned aerial vehicles. In this paper we consider the situation when the multicopter is flying under a variable wind and is intended to visit indicated points. We analyze the efficiency of the algorithm in case of limited flying time on a constant height.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01637460/document
%2 https://inria.hal.science/hal-01637460/file/419526_1_En_30_Chapter.pdf
%L hal-01637460
%U https://inria.hal.science/hal-01637460
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-9842