Discretization-Based and Look-Ahead Algorithms for the Dubins Traveling Salesperson Problem

A new class of discretization-based look-ahead algorithms (DLAAs) for the Dubins traveling salesperson problem (DTSP) is presented that compares favorably with the existing algorithms from the literature. The discretization level and the length of the look-ahead horizon are the two parameters that uniquely determine a DLAA, and depending on the application in hand, their values can be easily modified to strike a balance between the execution time and the length of the resulting admissible tour. The time complexity of a DLAA is the sum of two terms, one linear in the number of targets (cities) and one that corresponds to the specification of an initial order for the targets. For instances of the DTSP with densely distributed targets, an algorithm that relies on clustering and leads to shorter tours than the DLAA is also presented.

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

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

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

[4]  J. A. Bather.  Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization , 1966 .

[5]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[6]  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..

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

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

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  Robin Sibson,et al.  SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[11]  Tal Shima,et al.  Motion planning algorithms for the Dubins Travelling Salesperson Problem , 2015, Autom..

[12]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

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

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

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

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

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

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

[19]  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 .

[20]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[21]  Marco Bibuli,et al.  Basic navigation, guidance and control of an Unmanned Surface Vehicle , 2008, Auton. Robots.

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

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