The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Open accessAbstract
We study optimal multirobot path planning on graphs (MPP) over four minimization objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance, the total arrival time, and the total distance. Having established previously that these objectives are distinct and NP-hard to optimize, in this paper, we focus on efficient algorithmic solutions for solving these optimal MPP problems. Toward this goal, we first establish a one-to-one solution mapping between MPP and a special type of multiflow network. Based on this equivalence and integer linear programming (ILP), we design novel and complete algorithms for optimizing over each of the four objectives. In particular, our exact algorithm for computing optimal makespan solutions is a first that is capable of solving extremely challenging problems with robot-vertex ratios as high as 100%. Then, we further improve the computational performance of these exact algorithms through the introduction of principled heuristics, at the expense of slight optimality loss. The combination of ILP model based algorithms and the heuristics proves to be highly effective, allowing the computation of 1.x-optimal solutions for problems containing hundreds of robots, densely populated in the environment, often in just seconds.
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
Cites
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Self-citationLaValle, S. M. (2006) · Cited by 4,177
Self-citationBehavior-based formation control for multirobot teams
Balch, T., & Arkin, R. C. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.736776 · Cited by 3,112
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,031
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Reciprocal Velocity Obstacles for real-time multi-agent navigation
van den Berg, J., Lin, M., & Manocha, D. (2008) · 2008 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2008.4543489 · Cited by 1,722
Cited by
Persistent and Robust Execution of MAPF Schedules in Warehouses
Honig, W., Kiesel, S., Tinka, A., Durham, J. W., & Ayanian, N. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2894217 · Cited by 139
Metadata
- Authors
- Yu, J., & LaValle, S. M.
- Venue
- IEEE Transactions on Robotics
- Published
- 2016-10
- Volume
- 32
- Issue
- 5
- Pages
- 1163-1177
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2241553860
- Cited by
- 331
- References
- 48
- FWCI
- 15.52
- 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: Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics. https://app.cochat.ai/papers/10.1109/tro.2016.2593448
- The paper
- Yu, J., & LaValle, S. M. (2016). Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2016.2593448
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.
