A travelling salesman problem for a class of heterogeneous multi-vehicle systems

In this work we formulate and study a Travelling Salesman Problem (TSP) for a scenario in which two different vehicles cooperate so as to perform a desired task in an optimal way. In particular we consider the problem where a fast vehicle with a short operative range has to be coordinated with a carrier vehicle, typically slower but with virtually infinite operativity range, in order to visit in the shortest time a given collection of points.

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

[2]  Emanuele Garone,et al.  Traveling Salesman Problem for a Class of Carrier-Vehicle Systems , 2011 .

[3]  Thomas Brylawski,et al.  The lattice of integer partitions , 1973, Discret. Math..

[4]  F. Bullo,et al.  Decentralized algorithms for vehicle routing in a stochastic time-varying environment , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

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

[7]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[8]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[10]  Eric Feron,et al.  An Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem ∗ , 2005 .

[11]  Jean-Daniel Boissonnat,et al.  A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract) , 1996, SCG '96.

[12]  Planning Algorithms for a Class of Heterogeneous Multi-Vehicle Systems. , 2010 .

[13]  Emanuele Garone,et al.  Cooperative path planning for a class of carrier-vehicle systems. , 2008, 2008 47th IEEE Conference on Decision and Control.

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