The Traveling Salesman Problem for the Reeds-Shepp Car and the Differential Drive Robot

In this paper we consider variations on the traveling salesman problem for the Reeds-Shepp car and differential drive robot. We consider the problem of finding the shortest path compatible with the dynamics of such models through a set of points. We present algorithms that asymptotically perform within a deterministic constant factor of the optimum, for any distribution of points. In addition, we consider a version of such problems in which the target points are dynamically generated by a stochastic process with uniform spatial density. In such a case, the objective will be to minimize the expected waiting time between the appearance of a target and the time it is visited by the vehicle. We present algorithms that (i) ensure stability of the system, for all target generation rates, and (ii) provably perform within a constant factor of the optimum

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

[3]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[4]  Devin J. Balkcom,et al.  Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles , 2002, Int. J. Robotics Res..

[5]  P. Souéres,et al.  Set of reachable positions for a car , 1994, IEEE Transactions on Automatic Control.

[6]  François G. Pin,et al.  Time-Optimal Trajectories for Mobile Robots With Two Independently Driven Wheels , 1994, Int. J. Robotics Res..

[7]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

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

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

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

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

[12]  Devin J. Balkcom,et al.  Extremal trajectories for bounded velocity mobile robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[13]  P. Souéres,et al.  Shortest paths synthesis for a car-like robot , 1996, IEEE Trans. Autom. Control..

[14]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[15]  Shang Zhi,et al.  A proof of the queueing formula: L=λW , 2001 .

[16]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[17]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..