The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Open accessAbstract
The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Applications of MAPF include automated warehouses, autonomous vehicles, and robotics. Research on MAPF has been flourishing in the past couple of years. Different MAPF research papers assume different sets of assumptions, e.g., whether agents can traverse the same road at the same time, and have different objective functions, e.g., minimize makespan or sum of agents' actions costs. These assumptions and objectives are sometimes implicitly assumed or described informally. This makes it difficult for establishing appropriate baselines for comparison in research papers, as well as making it difficult for practitioners to find the papers relevant to their concrete application. This paper aims to fill this gap and facilitate future research and practitioners by providing a unifying terminology for describing the common MAPF assumptions and objectives. In addition, we also provide pointers to two MAPF benchmarks. In particular, we introduce a new grid-based benchmark for MAPF, and demonstrate experimentally that it poses a challenge to contemporary MAPF algorithms.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
A Multiagent Approach to Autonomous Intersection Management
Dresner, K., & Stone, P. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2502 · Cited by 1,304
Benchmarks for Grid-Based Pathfinding
Sturtevant, N. R. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2197681 · Cited by 549
Self-citationFinding Optimal Solutions to Cooperative Pathfinding Problems
Standley, T. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7564 · Cited by 358
SIPP: Safe interval path planning for dynamic environments
Phillips, M., & Likhachev, M. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980306 · Cited by 350
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
Self-citationLifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
Ma, H., Li, J., Kumar, T. K. S., & Koenig, S. (2017) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/3091125.3091243 · Cited by 196
Self-citationSearch-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges
Felner, A., Stern, R., Shimony, S., Boyarski, E., Goldenberg, M., Sharon, G., Sturtevant, N., Wagner, G., & Surynek, P. (2021) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v8i1.18423 · Cited by 183
Self-citationMulti-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
Multi-Agent Path Finding with Delay Probabilities
Ma, H., Kumar, T. K. S., & Koenig, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.11035 · Cited by 131
Self-citation
Cited by
MotionBenchMaker: A Tool to Generate and Benchmark Motion Planning Datasets
Chamzas, C., Quintero-Pena, C., Kingston, Z., Orthey, A., Rakita, D., Gleicher, M., Toussaint, M., & Kavraki, L. E. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3133603 · Cited by 59
Fujitani, Y., Yamauchi, T., Miyashita, Y., & Sugawara, T. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2022.09.212 · Cited by 9
Metadata
- Authors
- Stern, R., Sturtevant, N., Felner, A., Koenig, S., Ma, H., Walker, T., Li, J., Atzmon, D., Cohen, L., Kumar, T. K., Barták, R., & Boyarski, E.
- Venue
- Proceedings of the International Symposium on Combinatorial Search
- Published
- 2021-09-01
- Volume
- 10
- Issue
- 1
- Pages
- 151-158
- ISSN
- 2832-9163 (ISSN-L)
- 2832-9171
- OpenAlex
- W2949992533
- Cited by
- 645
- References
- 24
- FWCI
- 34.48
- 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: Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. https://app.cochat.ai/papers/10.1609/socs.v10i1.18510
- The paper
- Stern, R., Sturtevant, N., Felner, A., Koenig, S., Ma, H., Walker, T., Li, J., Atzmon, D., Cohen, L., Kumar, T. K., Barták, R., & Boyarski, E. (2021). Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. Proceedings of the International Symposium on Combinatorial Search. https://doi.org/10.1609/socs.v10i1.18510
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.