Abstract : 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.
https://hal.inria.fr/hal-01637460 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, November 17, 2017 - 3:43:25 PM Last modification on : Saturday, November 18, 2017 - 1:16:36 AM Long-term archiving on: : Sunday, February 18, 2018 - 3:48:11 PM
Jerzy Greblicki, Maciej Walczyński. Determination of the Optimal Routes for Autonomous Unmanned Aerial Vehicle Under Varying Wind with Using of the Traveling Salesman Problem Algorithm. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.334-341, ⟨10.1007/978-3-319-45378-1_30⟩. ⟨hal-01637460⟩