Motion planning algorithms for the Dubins Travelling Salesperson Problem

Two motion planning algorithms for the so-called Dubins Travelling Salesperson Problem are presented, and compared via simulations with existing algorithms from the literature. The first algorithm-dubbed " k -step look-ahead algorithm"-stems naturally from the formulation of the Dubins Travelling Salesperson Problem as a minimum-time control problem and is suitable for obtaining short tours when the number of cities is relatively small. The second algorithm is an adaptation of the classic 2-Opt algorithm for the Travelling Salesperson Problem and can be applied to larger instances of the Dubins Travelling Salesperson Problem. In this sense, the two algorithms complement each other in terms of their range of applicability. Instead of being decoupled, the combinatorial and motion planning aspects of the Dubins Travelling Salesperson Problem are treated in an integrated manner by both algorithms and no assumptions are made on the magnitude of the intercity distances.

[1]  Jean-Daniel Boissonnat,et al.  Accessibility region for a car that only moves forwards along optimal paths , 1993 .

[2]  J.K. Hedrick,et al.  Path planning and control for multiple point surveillance by an unmanned aircraft in wind , 2006, 2006 American Control Conference.

[3]  Carmel Domshlak,et al.  Integrating Task and Motion Planning for Unmanned Aerial Vehicles , 2014 .

[4]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[5]  Xiang Ma,et al.  Receding Horizon Planning for Dubins Traveling Salesman Problems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[6]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[7]  Vikram Kapila,et al.  Optimal path planning for unmanned air vehicles with kinematic and tactical constraints , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[8]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[9]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[11]  Jean-Daniel Boissonnat,et al.  Shortest paths of Bounded Curvature in the Plane , 1991, Geometric Reasoning for Perception and Action.

[12]  M. L. Chambers.  The Mathematical Theory of Optimal Processes , 1965 .

[13]  Tal Shima,et al.  Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms , 2011, Comput. Oper. Res..

[14]  J. Sussmann,et al.  SHORTEST PATHS FOR THE REEDS-SHEPP CAR: A WORKED OUT EXAMPLE OF THE USE OF GEOMETRIC TECHNIQUES IN NONLINEAR OPTIMAL CONTROL. 1 , 1991 .

[15]  L. Bittner.  L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, E. F. Mishechenko, The Mathematical Theory of Optimal Processes. VIII + 360 S. New York/London 1962. John Wiley & Sons. Preis 90/– , 1963 .

[16]  L. Doyen,et al.  Multi-Target Control Problems , 1997 .

[17]  Ümit Özgüner,et al.  Motion planning for multitarget surveillance with mobile sensor agents , 2005, IEEE Transactions on Robotics.

[18]  Tal Shima,et al.  On the discretized Dubins Traveling Salesman Problem , 2017 .

[19]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[20]  Tal Shima,et al.  A Task and Motion Planning Algorithm for the Dubins Travelling Salesperson Problem , 2014 .

[21]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[22]  L. S. Pontryagin,et al.  Mathematical Theory of Optimal Processes , 1962 .

[23]  Raja Sengupta,et al.  A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints , 2007, IEEE Transactions on Automation Science and Engineering.

[24]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[25]  Jean-Pierre Aubin,et al.  Viability theory , 1991 .

[26]  Jean-Daniel Boissonnat,et al.  Shortest paths of bounded curvature in the plane , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.