Optimal control-based UAV path planning with dynamically-constrained TSP with neighborhoods

This paper addresses path planning of an unmanned aerial vehicle (UAV) with remote sensing capabilities (or wireless communication capabilities). The goal of the path planning is to find a minimum-flight-time closed tour of the UAV visiting all executable areas of given remote sensing and communication tasks; in order to incorporate the nonlinear vehicle dynamics, this problem is regarded as a dynamically-constrained traveling salesman problem with neighborhoods. To obtain a close-to-optimal solution for the path planning in a tractable manner, a sampling-based roadmap algorithm that embeds an optimal control-based path generation process is proposed. The algorithm improves the computational efficiency by reducing numerical computations required for optimizing inefficient local paths, and by extracting additional information from a roadmap of a fixed number of samples. Comparative numerical simulations validate the efficiency of the presented algorithm in reducing computation time and improving the solution quality compared to previous roadmap-based planning methods.

[1]  Emilio Frazzoli,et al.  Traveling Salesperson Problems for the Dubins Vehicle , 2008, IEEE Transactions on Automatic Control.

[2]  Maria E. Orlowska,et al.  On the Optimal Robot Routing Problem in Wireless Sensor Networks , 2007 .

[3]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[4]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[5]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[6]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[7]  Joachim Gudmundsson,et al.  TSP with neighborhoods of varying size , 2005, J. Algorithms.

[8]  Mario Fernando Montenegro Campos,et al.  An evolutionary approach for the dubins' traveling salesman problem with neighborhoods , 2012, GECCO '12.

[9]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[10]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[11]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[12]  Rung Ching Chen,et al.  An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks , 2013, International Journal of Machine Learning and Cybernetics.

[13]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[14]  Fred W. Glover,et al.  Traveling salesman problem heuristics: Leading methods, implementations and latest advances , 2011, Eur. J. Oper. Res..

[15]  Keld Helsgaun,et al.  Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm , 2015, Mathematical Programming Computation.

[16]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesman Problem , 2012, IEEE Transactions on Automatic Control.

[17]  Jing-Sin Liu,et al.  Path planning of a data mule in wireless sensor network using an improved implementation of clustering-based genetic algorithm , 2013, 2013 IEEE Symposium on Computational Intelligence in Control and Automation (CICA).

[18]  S. Darbha,et al.  Sampling-Based Path Planning for a Visual Reconnaissance Unmanned Air Vehicle , 2012 .

[19]  Sajal K. Das,et al.  Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey , 2011, TOSN.

[20]  Anil V. Rao,et al.  GPOPS-II , 2014, ACM Trans. Math. Softw..

[21]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[22]  Jonathan Cole Smith,et al.  An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem , 2014, INFORMS J. Comput..

[23]  K. Obermeyer.  Path Planning for a UAV Performing Reconnaissance of Static Ground Targets in Terrain , 2009 .

[24]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[25]  Jianping Pan,et al.  A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements , 2013, IEEE Transactions on Mobile Computing.

[26]  João Pedro Hespanha,et al.  Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach , 2013, Algorithms.

[27]  Xing Zhang,et al.  A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets , 2014 .