Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies

We introduce a problem in which demands arrive stochastically on a line segment, and upon arrival, move with a fixed velocity perpendicular to the segment. We design a receding horizon service policy for a vehicle with speed greater than that of the demands, based on the translational minimum Hamiltonian path (TMHP). We consider Poisson demand arrivals, uniformly distributed along the segment. For a fixed segment width and fixed vehicle speed, the problem is governed by two parameters; the demand speed and the arrival rate. We establish a necessary condition on the arrival rate in terms of the demand speed for the existence of any stabilizing policy. We derive a sufficient condition on the arrival rate in terms of the demand speed that ensures stability of the TMHP-based policy. When the demand speed tends to the vehicle speed, every stabilizing policy must service the demands in the first-come-first-served (FCFS) order; and the TMHP-based policy becomes equivalent to the FCFS policy which minimizes the expected time before a demand is serviced. When the demand speed tends to zero, the sufficient condition on the arrival rate for stability of the TMHP-based policy is within a constant factor of the necessary condition for stability of any policy. Finally, when the arrival rate tends to zero for a fixed demand speed, the TMHP-based policy becomes equivalent to the FCFS policy which minimizes the expected time before a demand is serviced. We numerically validate our analysis and empirically characterize the region in the parameter space for which the TMHP-based policy is stable.

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

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

[3]  Eitan Zemel,et al.  Probabilistic analysis of geometric location problems , 1984, Ann. Oper. Res..

[4]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .

[5]  Rajeev Motwani,et al.  Approximating Capacitated Routing and Delivery Problems , 1999, SIAM J. Comput..

[6]  J. Papastavrou A stochastic and dynamic routing policy using branching processes with state dependent immigration , 1996 .

[7]  Yuichi Asahiro,et al.  Grasp and Delivery for Moving Objects on Broken Lines , 2007, Theory of Computing Systems.

[8]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[9]  Joao P. Hespanha,et al.  Dynamic vehicle routing with moving demands - Part II: High speed demands or low arrival rates , 2009, 2009 American Control Conference.

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

[11]  J.K. Hedrick,et al.  Border patrol and surveillance missions using multiple unmanned air vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[12]  Emilio Frazzoli,et al.  Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, IEEE Transactions on Automatic Control.

[13]  Emilio Frazzoli,et al.  Cooperative UAV Routing with Limited Sensor Range , 2006 .

[14]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[15]  Moshe Kress,et al.  Models of sensor operations for border surveillance , 2008 .

[16]  Francesco Bullo,et al.  A dynamic boundary guarding problem with translating targets , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[17]  Francesco Bullo,et al.  Vehicle placement to intercept moving targets , 2010, ACC 2010.

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

[19]  Emilio Frazzoli,et al.  Distributed policies for equitable partitioning: Theory and applications , 2008, 2008 47th IEEE Conference on Decision and Control.

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

[21]  R. D'Andrea,et al.  The RoboFlag competition , 2003, Proceedings of the 2003 American Control Conference, 2003..

[22]  D.B. Kingston,et al.  Time-dependent cooperative assignment , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

[24]  Rufus Isaacs,et al.  Differential Games , 1965 .

[25]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[26]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[27]  Emilio Frazzoli,et al.  Dynamic Vehicle Routing with Priority Classes of Stochastic Demands , 2009, SIAM J. Control. Optim..

[28]  Bengt J. Nilsson,et al.  Approximation Results for Kinetic Variants of TSP , 2002, Discret. Comput. Geom..

[29]  Emilio Frazzoli,et al.  Distributed and Adaptive Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, ArXiv.

[30]  Francesco Bullo,et al.  The dynamic team forming problem: Throughput and delay for unbiased policies , 2009, Syst. Control. Lett..

[31]  Alex Zelikovsky,et al.  The moving-target traveling salesman problem , 2003, J. Algorithms.

[32]  J. N. Newman Approximations for the Bessel and Struve functions , 1984 .

[33]  Munther A. Dahleh,et al.  A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints , 2008, IEEE Transactions on Automatic Control.

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

[35]  L. Few The shortest path and the shortest road through n points , 1955 .

[36]  Francesco Bullo,et al.  Vehicle placement to intercept moving targets , 2010, Proceedings of the 2010 American Control Conference.

[37]  Joao P. Hespanha,et al.  Dynamic vehicle routing with moving demands - Part I: Low speed demands and high arrival rates , 2009, 2009 American Control Conference.

[38]  Emilio Frazzoli,et al.  A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience , 2009, Mob. Networks Appl..

[39]  Emilio Frazzoli,et al.  Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications , 2009, IEEE Transactions on Automatic Control.