Determination of the Optimal Routes for Autonomous Unmanned Aerial Vehicle Under Varying Wind with Using of the Traveling Salesman Problem Algorithm

详细信息    查看全文

• 关键词：Multicopters ; UAV ; Traveling salesman problem (TSP) ; Drone routing problem (DRP)
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9842
• 期：1
• 页码：334-341
• 全文大小：966 KB
• 参考文献：1.Clark, R.M.: Uninhabited Combat Aerial Vehicles: Airpower by the People, for the People, But Not with the People. CADRE Paper No. 8. Air University Press, Maxwell Air Force Base, Montgomery, AL (2000)
  2.Howard, F.: Orville and Wilbur: The Story of the Wright Brothers. Hale, London (1988). ISBN 0-7090-3244-7
  3.Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)MathSciNet CrossRef MATH
  4.Papadimitriou, C.H.: The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM J. Comput. 21(3), 450–465 (1992)MathSciNet CrossRef MATH
  5.Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization. Wiley, New York (1997)
  6.Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1295–1304 (2007)
  
• 作者单位：Jerzy Greblicki (15)
  Maciej Walczyński (16)
  
  15. Faculty of Electronics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372, Wrocław, Poland
  16. General Tadeusz Kościuszko Military Academy of Land Forces in Wroclaw, Czajkowskiego 109, 51-150, Wrocław, Poland
  
• 丛书名：Computer Information Systems and Industrial Management
• ISBN：978-3-319-45378-1
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9842

文摘

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.