{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T05:11:22Z","timestamp":1667365882111},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SOCS"],"abstract":"<jats:p>Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-Agent Path Finding (MAPF).\nAt its high level, CBS expands nodes by resolving conflicts.\nIn recent years, admissible heuristics were added to the high level of CBS.\nWe enhance all known heuristic functions for CBS by using information about the cost of resolving certain conflicts, with only a small computational overhead. We experimentally demonstrate that the improved heuristics contribute to making CBS even more efficient.<\/jats:p>","DOI":"10.1609\/socs.v12i1.18587","type":"journal-article","created":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T19:50:14Z","timestamp":1667332214000},"page":"213-215","source":"Crossref","is-referenced-by-count":0,"title":["Further Improved Heuristics For Conflict-Based Search"],"prefix":"10.1609","volume":"12","author":[{"given":"Eli","family":"Boyarski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Le Bodic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel D.","family":"Harabor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2021,7,21]]},"container-title":["Proceedings of the International Symposium on Combinatorial Search"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/18587\/18376","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/18587\/18376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T19:50:14Z","timestamp":1667332214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/view\/18587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,7,22]]}},"URL":"https:\/\/doi.org\/10.1609\/socs.v12i1.18587","relation":{},"ISSN":["2832-9163","2832-9171"],"issn-type":[{"value":"2832-9163","type":"electronic"},{"value":"2832-9171","type":"print"}],"subject":[],"published":{"date-parts":[[2021,7,21]]}}}