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.
Author supplied keywords
Cite
CITATION STYLE
Greblicki, J., & Walczyński, M. (2016). Determination of the optimal routes for autonomous unmanned aerial vehicle under varying wind with using of the traveling salesman problem algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9842 LNCS, pp. 334–341). Springer Verlag. https://doi.org/10.1007/978-3-319-45378-1_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
