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.
Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.334-341, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_30〉
https://hal.inria.fr/hal-01637460
Contributeur : Hal Ifip
<>
Soumis le : vendredi 17 novembre 2017 - 15:43:25
Dernière modification le : samedi 18 novembre 2017 - 01:16:36
Document(s) archivé(s) le : dimanche 18 février 2018 - 15:48:11
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. Khalid Saeed; Władysław Homenda. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9842, pp.334-341, 2016, Computer Information Systems and Industrial Management. 〈10.1007/978-3-319-45378-1_30〉. 〈hal-01637460〉
