Tracking Progress in Multi-Agent Path Finding
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:N6Z6HONPrecord.jsonopen to challenge →
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Cooperative-ORCA*: Real-Time Proactive Deadlock Avoidance for Continuous-Space Multi-Agent Navigation
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.