The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
Open accessAbstract
In this paper, we study the structure and computational complexity of optimal multi-robot path planning problems on graphs. Our results encompass three formulations of the discrete multi-robot path planning problem, including a variant that allows synchronous rotations of robots along fully occupied, disjoint cycles on the graph. Allowing rotation of robots provides a more natural model for multi-robot path planning because robots can communicate.Our optimality objectives are to minimize the total arrival time, the makespan (last arrival time), and the total distance. On the structure side, we show that, in general, these objectives demonstrate a pairwise Pareto optimal structure and cannot be simultaneously optimized. On the computational complexity side, we extend previous work and show that, regardless of the underlying multi-robot path planning problem, these objectives are all intractable to compute. In particular, our NP-hardness proof for the time optimal versions, based on a minimal and direct reduction from the 3-satisfiability problem, shows that these problems remain NP-hard even when there are only two groups of robots (i.e. robots within each group are interchangeable).
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
(1979) · Cited by 43,841
Planning optimal paths for multiple robots on graphs
Yu, J., & LaValle, S. M. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631084 · Cited by 197
Self-citationComplete Algorithms for Cooperative Pathfinding Problems
Standley, T., & Korf, R. E. (2012) · Cited by 164
Multi-agent Path Planning and Network Flow
Yu, J., & LaValle, S. M. (2013) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-642-36279-8_10 · Cited by 164
Self-citationAn Optimization Variant of Multi-Robot Path Planning Is Intractable
Surynek, P. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7767 · Cited by 163
Cited by
Conflict-based search for optimal multi-agent pathfinding
Sharon, G., Stern, R., Felner, A., & Sturtevant, N. R. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.006 · Cited by 1,242
Trajectory Planning for Quadrotor Swarms
Honig, W., Preiss, J. A., Kumar, T. K. S., Sukhatme, G. S., & Ayanian, N. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2853613 · Cited by 315
Graph Neural Networks for Decentralized Multi-Robot Path Planning
Li, Q., Gama, F., Ribeiro, A., & Prorok, A. (2020) · 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros45743.2020.9341668 · Cited by 271
Project Silica: Towards Sustainable Cloud Archival Storage in Glass
Anderson, P., Aranas, E., Assaf, Y., Behrendt, R., Black, R., Caballero, M., Cameron, P., Canakci, B., Chatzieleftheriou, A., Clarke, R., et al. (2025) · ACM Transactions on Storage · doi:10.1145/3708996 · Cited by 13
Metadata
- Authors
- Yu, J., & LaValle, S.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2013-06-29
- Volume
- 27
- Issue
- 1
- Pages
- 1443-1449
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2191404279
- Cited by
- 413
- References
- 5
- FWCI
- 3.84
- Type
- conference paper
- Language
- en
- Open access
- diamond
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: Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. https://app.cochat.ai/papers/10.1609/aaai.v27i1.8541
- The paper
- Yu, J., & LaValle, S. (2013). Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v27i1.8541
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.