@inproceedings{a38d45065f9d473ba20a5d564bd7b43d,
title = "Iterative-deepening conflict-based search",
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.",
author = "Eli Boyarski and Ariel Felner and Daniel Harabor and Stuckey, {Peter J.} and Liron Cohen and Jiaoyang Li and Sven Koenig",
note = "Publisher Copyright: {\textcopyright} 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.; 29th International Joint Conference on Artificial Intelligence, IJCAI 2020 ; Conference date: 01-01-2021",
year = "2020",
month = jan,
day = "1",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",
pages = "4084--4090",
editor = "Christian Bessiere",
booktitle = "Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020",
}