The DOI matches its Crossref record.
Dynamic Vehicle Routing for Robotic Systems
Open accessAbstract
Recent years have witnessed great advancements in the science and technology of autonomy, robotics, and networking. This paper surveys recent concepts and algorithms for dynamic vehicle routing (DVR), that is, for the automatic planning of optimal multivehicle routes to perform tasks that are generated over time by an exogenous process. We consider a rich variety of scenarios relevant for robotic applications. We begin by reviewing the basic DVR problem: demands for service arrive at random locations at random times and a vehicle travels to provide on-site service while minimizing the expected wait time of the demands. Next, we treat different multivehicle scenarios based on different models for demands (e.g., demands with different priority levels and impatient demands), vehicles (e.g., motion constraints, communication, and sensing capabilities), and tasks. The performance criterion used in these scenarios is either the expected wait time of the demands or the fraction of demands serviced successfully. In each specific DVR scenario, we adopt a rigorous technical approach that relies upon methods from queueing theory, combinatorial optimization, and stochastic geometry. First, we establish fundamental limits on the achievable performance, including limits on stability and quality of service. Second, we design algorithms, and provide provable guarantees on their performance with respect to the fundamental limits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“Future research should also develop approaches to deal with data uncertainty [35, 206].”
BackgroundData-Enabled Predictive Control: In the Shallows of the DeePC
Coulson, J., Lygeros, J., & Dorfler, F. (2019) · 2019 18th European Control Conference (ECC) · doi:10.23919/ecc.2019.8795639 · Cited by 628
Control of robotic mobility-on-demand systems: A queueing-theoretical perspective
Zhang, R., & Pavone, M. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915581863 · Cited by 367
Self-citationLearning Model Predictive Control for Iterative Tasks. A Data-Driven Control Framework
Rosolia, U., & Borrelli, F. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2753460 · Cited by 341
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams
Mathew, N., Smith, S. L., & Waslander, S. L. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2015.2461213 · Cited by 301
Self-citation
Metadata
- Authors
- Bullo, F., Frazzoli, E., Pavone, M., Savla, K., & Smith, S. L.
- Venue
- Proceedings of the IEEE
- Published
- 2011-09
- Volume
- 99
- Issue
- 9
- Pages
- 1482-1504
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2064155562
- Cited by
- 224
- References
- 0
- FWCI
- 63.18
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Vehicle Routing for Robotic Systems. https://app.cochat.ai/papers/10.1109/jproc.2011.2158181
- The paper
- Bullo, F., Frazzoli, E., Pavone, M., Savla, K., & Smith, S. L. (2011). Dynamic Vehicle Routing for Robotic Systems. Proceedings of the IEEE. https://doi.org/10.1109/jproc.2011.2158181
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.