Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F18%3A00323160" target="_blank" >RIV/68407700:21240/18:00323160 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem
Original language description
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant. Recently, a SAT-based approached was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we present SAT-based unbounded- and bounded- suboptimal algorithms and compare them to relevant algorithms. Experimental results show that in many case the SAT-based solver significantly outperforms the search-based solvers.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Eleventh International Symposium on Combinatorial Search
ISBN
978-1-57735-802-2
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
90-105
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Stockholm
Event date
Jul 14, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—