mapf.info

webmaster: Sven Koenig

Learn all about Multi-Agent Path Finding (MAPF)

Publication

E. Boyarski, A. Felner, D. Harabor, P. Stuckey, L. Cohen, J. Li and S. Koenig. Iterative-Deeping Conflict-Based Search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages (in print), 2020.


Abstract: Conflict-Based Search (CBS) is a leading algorithm for optimal Multi-Agent Path Finding (MAPF). CBS variants typically compute MAPF solutions using some form of A* search. However, they often do so under strict time limits so as to avoid exhausting the available memory. In this paper, we present IDCBS, an iterative-deepening variant of CBS which can be executed without exhausting the memory and without strict time limits. IDCBS can be substantially faster than CBS due to incremental methods that it uses when processing CBS nodes.


Download the paper in pdf.


(last updated in 2020)