Abstract
Conflict-Based Search (CBS) and its enhancements are among the strongest algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to guide the high-level search of CBS. In this work, we introduce two new admissible heuristics by reasoning about the pairwise dependency between agents. Empirically, CBS with both new heuristics significantly improves the success rate over CBS with the recent heuristic and reduces the number of expanded nodes and runtime by up to a factor of 50.
Original language | English |
---|---|
Title of host publication | Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 |
Editors | Pavel Surynek, William Yeoh |
Publisher | AAAI press |
Pages | 182-183 |
Number of pages | 2 |
ISBN (Electronic) | 9781577358084 |
State | Published - 2019 |
Externally published | Yes |
Event | 12th International Symposium on Combinatorial Search, SoCS 2019 - Napa, United States Duration: 16 Jul 2019 → 17 Jul 2019 |
Publication series
Name | Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 |
---|
Conference
Conference | 12th International Symposium on Combinatorial Search, SoCS 2019 |
---|---|
Country/Territory | United States |
City | Napa |
Period | 16/07/19 → 17/07/19 |
Bibliographical note
Publisher Copyright:Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
This paper is a short version of (Li et al. 2019). The research at the University of Southern California was supported by the National Science Foundation (NSF) under grant numbers 1409987, 1724392, 1817189 and 1837779 as well as a gift from Amazon. The research was also supported by the United States-Israel Binational Science Foundation (BSF) under grant number 2017692. ∗This paper is a short version of (Li et al. 2019). The research at the University of Southern California was supported by the National Science Foundation (NSF) under grant numbers 1409987, 1724392, 1817189 and 1837779 as well as a gift from Amazon. The research was also supported by the United States-Israel Binational Science Foundation (BSF) under grant number 2017692. Copyright ©c 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funders | Funder number |
---|---|
National Science Foundation | 1409987, 1724392, 1837779, 1817189 |
Bonfils-Stanton Foundation | |
Bloom's Syndrome Foundation | 2017692 |
United States-Israel Binational Science Foundation |