Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution

We present decentralized algorithms for a class of stochastic and dynamic vehicle routing problems, known as the multiple-vehicle dynamic traveling repairperson problem (m-DTRP), in which demands arrive randomly over time and their locations have an arbitrary distribution, and the objective is to minimize the average waiting time between the appearance of a demand and the time it is visited by a vehicle. The best previously known control algorithms rely on centralized, a-priori task assignment, and are therefore of limited applicability in scenarios involving large ad-hoc networks of autonomous vehicles. By combining results from geometric probability and locational optimization, we provide a policy that solves, providing a constant-factor approximation to the optimal achievable performance, the decentralized version of the m-DTRP; such policy (i) does not rely on centralized and a priori task assignment, (ii) is spatially distributed, scalable to large networks, and adaptive to network changes. Simulation results are presented and discussed.

[1]  J. Michael Steele,et al.  Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..

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

[3]  Emilio Frazzoli,et al.  Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience , 2007, ROBOCOMM.

[4]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[5]  Timothy W. McLain,et al.  Coordinated target assignment and intercept for unmanned air vehicles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[6]  Martin,et al.  Finite size and dimensional dependence in the Euclidean traveling salesman problem. , 1996, Physical review letters.

[7]  Wright-Patterson Afb,et al.  UAV Cooperative Path Planning , 2000 .

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

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

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

[11]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[12]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[13]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[14]  Christos G. Cassandras,et al.  A Cooperative receding horizon controller for multivehicle uncertain environments , 2006, IEEE Transactions on Automatic Control.