On the Dubins Traveling Salesman Problem

We study the traveling salesman problem for a Dubins vehicle. We prove that this problem is NP-hard, and provide lower bounds on the approximation ratio achievable by some recently proposed heuristics. We also describe new algorithms for this problem based on heading discretization, and evaluate their performance numerically.

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

[2]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[3]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[4]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[5]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[6]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

[7]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[8]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

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

[11]  P. Souéres,et al.  The Shortest path synthesis for non-holonomic robots moving forwards , 1994 .

[12]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

[13]  Pankaj K. Agarwal,et al.  Approximation algorithms for curvature-constrained shortest paths , 1996, SODA '96.

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

[15]  Sung Yong Shin,et al.  Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points , 2000, ESA.

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

[17]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[18]  F. Bullo,et al.  On Traveling Salesperson Problems for Dubins’ vehicle: stochastic and dynamic environments , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[19]  Emilio Frazzoli,et al.  UAV ROUTING IN A STOCHASTIC, TIME-VARYING ENVIRONMENT , 2005, IFAC Proceedings Volumes.

[20]  F. Bullo,et al.  On the point-to-point and traveling salesperson problems for Dubins' vehicle , 2005, Proceedings of the 2005, American Control Conference, 2005..

[21]  Swaroop Darbha,et al.  A Resource Allocation Algorithm for Multi-Vehicle Systems with Non holnomic Constraints , 2005 .

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

[23]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

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

[25]  M.A. Dahleh,et al.  On the Stochastic TSP for the Dubins Vehicle , 2007, 2007 American Control Conference.

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

[27]  Jerome Le Ny,et al.  Performance optimization for unmanned vehicle systems , 2008 .

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

[29]  Richard J. Kenefic.  Finding Good Dubins Tours for UAVs Using Particle Swarm Optimization , 2008, J. Aerosp. Comput. Inf. Commun..

[30]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.