Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding
Keywords:Conflict Based Search, Heuristics, Multi-agent path finding
Conflict-Based Search (CBS) and its enhancements are among the strongest algorithms for the multi-agent path-finding problem. However,existing variants of CBS do not use any heuristics that estimate future work. In this paper, we introduce different admissible heuristics for CBS by aggregating cardinal conflicts among agents. In our experiments, CBS with these heuristics outperforms previous state-of-the-art CBS variants by up to a factor of five.
How to Cite
Felner, A., Li, J., Boyarski, E., Ma, H., Cohen, L., Kumar, T. K. S., & Koenig, S. (2018). Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. Proceedings of the International Conference on Automated Planning and Scheduling, 28(1), 83-87. https://doi.org/10.1609/icaps.v28i1.13883