ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
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.
Cite
Text
Boyarski et al. "ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Boyarski et al. "ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/boyarski2015ijcai-icbs/)BibTeX
@inproceedings{boyarski2015ijcai-icbs,
title = {{ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding}},
author = {Boyarski, Eli and Felner, Ariel and Stern, Roni and Sharon, Guni and Tolpin, David and Betzalel, Oded and Shimony, Solomon Eyal},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {740-746},
url = {https://mlanthology.org/ijcai/2015/boyarski2015ijcai-icbs/}
}