Recent Changes - Search:


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

Publication

E. Boyarski, A. Felner, R. Stern, G. Sharon, O. Betzalel, D. Tolpin and E. Shimony. ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. In Proceedings of the Symposium on Combinatorial Search (SoCS), pages 223-225, 2015.


Abstract: Conflict-Based Search (CBS) and its enhancements, Meta-Agent CBS and bypassing conflicts are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces two new improvements to CBS and incorporates them into a coherent, improved version of CBS, namely ICBS. Experimental results show that each of these improvements further reduces the runtime over the existing CBS-based approaches. When all improvements are combined, an even larger improvement is achieved, producing state-of-the art results for a number of domains.


Download the paper in pdf.

Edit - History - Print - Recent Changes - Search
Page last modified on October 06, 2024, at 07:32 AM