{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T16:41:31Z","timestamp":1792514491764,"version":"4.5.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.24963\/ijcai.2020\/565","type":"proceedings-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T12:12:10Z","timestamp":1594210330000},"page":"4084-4090","source":"Crossref","is-referenced-by-count":19,"title":["Iterative-Deepening Conflict-Based Search"],"prefix":"10.24963","author":[{"given":"Eli","family":"Boyarski","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Harabor","sequence":"additional","affiliation":[{"name":"Monash University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[{"name":"Monash University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liron","family":"Cohen","sequence":"additional","affiliation":[{"name":"University of Southern California (USC)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaoyang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}","theme":"Artificial Intelligence","location":"Yokohama, Japan","acronym":"IJCAI-PRICAI-2020","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2020,7,11]]},"end":{"date-parts":[[2020,7,17]]}},"container-title":["Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T02:16:00Z","timestamp":1594260960000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2020\/565"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2020\/565","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}