Encyclopedia of Systems and Control

2015 Edition
| Editors: John Baillieul, Tariq Samad

Multi-vehicle Routing

  • Emilio Frazzoli
  • Marco Pavone
Reference work entry
DOI: https://doi.org/10.1007/978-1-4471-5058-9_218


Multi-vehicle routing problems in systems and control theory are concerned with the design of control policies to coordinate several vehicles moving in a metric space, in order to complete spatially localized, exogenously generated tasks in an efficient way. Control policies depend on several factors, including the definition of the tasks, of the task generation process, of the vehicle dynamics and constraints, of the information available to the vehicles, and of the performance objective. Ensuring the stability of the system, i.e., the uniform boundedness of the number of outstanding tasks, is a primary concern. Typical performance objectives are represented by measures of quality of service, such as the average or worst-case time a task spends in the system before being completed or the percentage of tasks that are completed before certain deadlines. The scalability of the control policies to large groups of vehicles often drives the choice of the information structure, requiring distributed computation.


Cooperative control Decentralized control Dynamic routing Networked robots Task allocation 
This is a preview of subscription content, log in to check access.


  1. Bertsimas DJ, van Ryzin GJ (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper Res 39:601–615Google Scholar
  2. Bullo F, Frazzoli E, Pavone M, Savla K, Smith SL (2011) Dynamic vehicle routing for robotic systems. Proc IEEE 99(9):1482–1504Google Scholar
  3. Golden B, Raghavan S, Wasil E (2008) The vehicle routing problem: latest advances and new challenges. Volume 43 of operations research/computer science interfaces. Springer, New YorkGoogle Scholar
  4. Jaillet P, Wagner MR (2006) Online routing problems: value of advanced information and improved competitive ratios. Transp Sci 40(2):200–210Google Scholar
  5. Pavone M (2010) Dynamic vehicle routing for robotic networks. PhD thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of TechnologyGoogle Scholar
  6. Pavone M, Savla K, Frazzoli E (2009) Sharing the load. IEEE Robot Autom Mag 16(2):52–61Google Scholar
  7. Steele JM (1990) Probabilistic and worst case analyses of classical problems of combinatorial optimization in Euclidean space. Math Oper Res 15(4):749MathSciNetGoogle Scholar
  8. Toth P, Vigo D (eds) (2001) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia. ISBN:0898715792Google Scholar
  9. Van Hentenryck P, Bent R, Upfal E (2009) Online stochastic optimization under time constraints. Ann Oper Res 177(1):151–183Google Scholar
  10. Vazirani V (2001) Approximation algorithms. Springer, New YorkGoogle Scholar

Copyright information

© Springer-Verlag London 2015

Authors and Affiliations

  • Emilio Frazzoli
    • 1
  • Marco Pavone
    • 2
  1. 1.Massachusetts Institute of TechnologyCambridge, MAUSA
  2. 2.Stanford UniversityStanfordUSA