论文信息 - On the Stochastic TSP for the Dubins Vehicle

On the Stochastic TSP for the Dubins Vehicle

In this paper, we study the stochastic travelling salesperson problem for a vehicle that is constrained to move forwards with a bound on the minimum turning radius. For n uniformly distributed targets, it is known that the expected length of the optimal tour has a lower bound that is kn2/3 (where k is a constant that depends on the geometry of the area). We design a novel algorithm that performs within a constant factor of that lower bound. This proves that the expected length of the optimal tour of the Stochastic Dubins Travelling Salesperson Problem (SDTSP) is of the order of exactly n2/3.

M.A. Dahleh | S. Itani

[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] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .

[3] Sanjeev Arora,et al. Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

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

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

[6] Jean-Daniel Boissonnat,et al. Shortest path synthesis for Dubins non-holonomic robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

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

[8] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[9] H. Erzberger,et al. OPTIMUM HORIZONTAL GUIDANCE TECHNIQUES FOR AIRCRAFT , 1971 .