Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 183

The DOI matches its Crossref record.

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges

Open access
Felner, Ariel, Stern, Roni, Shimony, Solomon, Boyarski, Eli, Goldenberg, Meir, Sharon, Guni, Sturtevant, Nathan, Wagner, Glenn, Surynek, Pavel · 2021 · Proceedings of the International Symposium on Combinatorial Search

Abstract

Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this research area, numerous diverse search-based techniques were developed in the past 6 years for optimally solving MAPF under the sum-of-costs objective function. In this paper we survey these techniques, while placing them into the wider context of the MAPF field of research. Finally, we provide analytical and experimental comparisons that show that no algorithm dominates all others in all circumstances. We conclude by listing important future research directions.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/socs.v8i1.18423

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 183

Metadata

Authors
Felner, A., Stern, R., Shimony, S., Boyarski, E., Goldenberg, M., Sharon, G., Sturtevant, N., Wagner, G., & Surynek, P.
Venue
Proceedings of the International Symposium on Combinatorial Search
Published
2021-09-01
Volume
8
Issue
1
Pages
29-37
ISSN
  • 2832-9163 (ISSN-L)
  • 2832-9171
OpenAlex
W2730530972
Cited by
183
References
0
FWCI
8.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: Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. https://app.cochat.ai/papers/10.1609/socs.v8i1.18423
The paper
Felner, A., Stern, R., Shimony, S., Boyarski, E., Goldenberg, M., Sharon, G., Sturtevant, N., Wagner, G., & Surynek, P. (2021). Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. Proceedings of the International Symposium on Combinatorial Search. https://doi.org/10.1609/socs.v8i1.18423

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.