webmaster: Sven Koenig

Learn all about Multi-Agent Path Finding (MAPF)


A. Botea, D. Bonusi and P. Surynek. Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 5563-5567, 2018.

Abstract: We present and evaluate diBOX, an algorithm for multi-agent path finding on strongly biconnected directed graphs. diBOX runs in polynomial time, computes suboptimal solutions and is complete for instances on strongly biconnected digraphs with at least two unoccupied positions. A detailed empirical analysis shows a good scalability for diBOX.

Download the paper in pdf.

(last updated in 2019)