mapf.info

webmaster: Sven Koenig

Learn all about Multi-Agent Path Finding (MAPF)

Software

Optimized C++ implementation of Priority-Based Search (PBS) by Jiaoyang Li, see the accompanying publication (although less efficient code was used for the experiments in that paper)
C++ implementation of CBSH2-RTC (the successor of CBSH2), a version of CBS with heuristics and a variety of symmetry-breaking techniques, by Jiaoyang Li, see the accompanying publication
C++ implementation of Rolling-Horizon Collision Resolution (RHCR) by Jiaoyang Li, see the accompanying publication
C++ implementation of Explicit Estimation Conflict-Based Search (EECBS) by Jiaoyang Li, see the accompanying publication
C++ implementation of MAPF with Large Neighborhood Search by Jiaoyang Li, see the accompanying publications for MAPF-LNS and MAPF-LNS2
C++/Python implementation of LT-CBS for CBS-based lazy train path finding by Zhe (Mke) Chen
C++ implementation of (E)CBS by Wolfgang Hoenig
C++ implementation of many SAT-based MAPF solvers by Pavel Surynek
C++ implementation of SMT-based MAPF solvers by Pavel Surynek
Tool for visualizing MAPF plans by Petr Koupý
C++ implementation of Branch-Cut-and-Price (BCP) by Edward Lam
C++ implementation of prioritized path finding with continuous time for agents of different sizes and speeds (AA-SIPP(m)) by Anton Andreychuk and Konstantin Yakovlev
C++ implementation of CBS with continuous time (Continuous-CBS) by Anton Andreychuk and Konstantin Yakovlev
C++ implementation of Iterative Deepening CBS (IDCBS) by Eli Boyarski
C++ implementation of Extended Increasing Cost Tree Search (Extended ICTS) for non-unit cost domains by Thayne Walker
C# implementation of Enhanced Partial Expansion A* (EPEA*), Increasing Cost Tree Search (ICTS), and some other MAPF algorithms by Eli Boyarski

Home Page
MAPF Info MAPF News Mailing List Meetings Publications Researchers Benchmarks Software Apps Tutorials Class Projects

(last updated in 2022)