Dynamic vehicle routing with stochastic time constraints

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2010, Pages 1460-1467

  Pavone, Marco ^a   Frazzoli, Emilio ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC VEHICLE ROUTING; DYNAMIC VEHICLE ROUTING PROBLEMS; ERGODICS; LIGHT LOADS; LOWER BOUNDS; NUMBER OF VEHICLES; OPTIMAL NUMBER; ROBOTIC VEHICLES; SERVICE DEMAND; SERVICE POLICY; SIMULATION RESULT; STEADY STATE PROBABILITIES; TIME CONSTRAINTS; TIME OF ARRIVAL; WAITING TIME; WELLPOSEDNESS;

OPTIMIZATION; ROBOTICS; ROBOTS; STOCHASTIC SYSTEMS; VEHICLES;

AUTOMOBILE EXHIBITIONS;

EID: 77955806259     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2010.5509222     Document Type: Conference Paper

References (15)

1. H. N. Psaraftis. Dynamic vehicle routing problems. In B. Golden and A. Assad, editors, Vehicle Routing: Methods and Studies, pages 223-248. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1988.
2. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(1):60-76, 1993.
3. M. Pavone, E. Frazzoli, and F. Bullo. Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution. In Proc. IEEE Conf. on Decision and Control, pages 4869-4874, New Orleans, LA, December 2007.
4. P. Toth and D. Vigo. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2002.
5. F. Baccelli, P. Boyer, and G. Hebuterne. Single-server queues with impatient customers. Advances in Applied Probability, 16(4):887-905, 1984.
6. A. R. Ward and P. W. Glynn. A diffusion approximation for a markovian queue with reneging. Queueing Syst. Theory Appl., 43(1/2):103-128, 2003.
7. N. Bisnik, A. Abouzeid, and V. Isler. Stochastic event capture using mobile sensors subject to a quality metric. IEEE Transactions on Robotics, 23:676-692, 2007.
8. M. Pavone, N. Bisnik, E. Frazzoli, and V. Isler. A stochastic and dynamic vehicle routing problem with time windows and customer impatience. Mobile Networks and Applications, 14(3):350-364, 2009.
9. J. M. Steele. Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space. Mathematics of Operations Research, 15(4):749, 1990.
10. G. Percus and O. C. Martin. Finite size and dimensional dependence of the Euclidean traveling salesman problem. Physical Review Letters, 76(8):1188-1191, 1996.
11. S. Asmussen. Applied Probability and Queues. Springer-Verlag, New York, NY, second edition, 2003.
12. S. Jr. Stidham. Regenerative processes in the theory of queues, with applications to the alternating-priority queue. Advances in Applied Probability, 4(3):542-577, 1972.
13. J. Cortés, S. Martínez, and F. Bullo. Spatially-distributed coverage optimization and control with limited-range interactions. ESAIM. Control, Optimisation & Calculus of Variations, 11:691-719, 2005.
14. N. N. Krasovskii. Stability of Motion: Applications of Lyapunov's Second Method to Differential Systems and Equations with Delay. Stanford University Press, CA, USA, 1963.
15. K. Laventall and J. Cortés. Coverage control by multi-robot networks with limited-range anisotropic sensory. International Journal of Control, 82(6):1113-1121, 2009.