Abstract
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.
Original language | English |
---|---|
Pages | 169-170 |
Number of pages | 2 |
State | Published - 2017 |
Event | 10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States Duration: 16 Jun 2017 → 17 Jun 2017 |
Conference
Conference | 10th Annual Symposium on Combinatorial Search, SoCS 2017 |
---|---|
Country/Territory | United States |
City | Pittsburgh |
Period | 16/06/17 → 17/06/17 |
Bibliographical note
Publisher Copyright:Copyright © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
This paper is supported by a project commissioned by the New Energy and Industrial Technology Development Organization Japan (NEDO) and the joint grant of the Israel Min- Figure 2: Runtimes of unbounded and bounded algorithms (ϵ = 0.01) on DAO maps brc202d, den520d, and ost003d. This paper is supported by a project commissioned by the New Energy and Industrial Technology Development Organization Japan (NEDO) and the joint grant of the Israel Ministry of Science and the Czech Ministry of Education Youth and Sports number 8G15027. istry of Science and the Czech Ministry of Education Youth and Sports number 8G15027.
Funders | Funder number |
---|---|
Czech Ministry of Education Youth and Sports | 8G15027 |
Ministerstvo Školství, Mládeže a Tělovýchovy | |
New Energy and Industrial Technology Development Organization | |
New Energy and Industrial Technology Development Organization | |
Ministry of Defense |