Pith. sign in

REVIEW 2 cited by

Tracking Progress in Multi-Agent Path Finding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.08446 v1 pith:N6Z6HONP submitted 2023-05-15 cs.AI cs.RO

Tracking Progress in Multi-Agent Path Finding

classification cs.AI cs.RO
keywords mapfmanyprogressexperimentationfindinglargemulti-agentpath
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications. Many works appear on this topic each year, and a large number of substantial advancements and performance improvements have been reported. Yet measuring overall progress in MAPF is difficult: there are many potential competitors, and the computational burden for comprehensive experimentation is prohibitively large. Moreover, detailed data from past experimentation is usually unavailable. In this work, we introduce a set of methodological and visualisation tools which can help the community establish clear indicators for state-of-the-art MAPF performance and which can facilitate large-scale comparisons between MAPF solvers. Our objectives are to lower the barrier of entry for new researchers and to further promote the study of MAPF, since progress in the area and the main challenges are made much clearer.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation

    cs.RO 2026-06 unverdicted novelty 6.0

    C-ORCA* and C-ORCA*-MAPF proactively prevent deadlocks in continuous MAPF using entire trajectories and spatial dependencies, outperforming prior methods in solve rate, runtime, and flowtime.

  2. Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding

    cs.RO 2026-02 conditional novelty 6.0

    ACCBS is a closed-loop CBS variant whose planning horizon grows with the available computation budget while reusing a single constraint tree, giving anytime behavior and conditional asymptotic optimality.