DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00355521" target="_blank" >RIV/68407700:21240/21:00355521 - isvavai.cz</a>
Result on the web
<a href="https://ojs.aaai.org/index.php/SOCS/article/view/18567" target="_blank" >https://ojs.aaai.org/index.php/SOCS/article/view/18567</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Original language description
The task in multi-agent path finding (MAPF) is to find non- conflicting paths connecting agents’ start and goal positions. The MAPF problem is often compiled to Boolean satisfia- bility (SAT) and solved by existing SAT solvers. Contem- porary compilation approaches of MAPF to SAT regard the SAT solver as an external tool whose task is to return an as- signment of all decision variables of a Boolean model of the input MAPF instance. We present in this paper a novel compi- lation scheme called DPLL(MAPF) in which the consistency checking of partial assignments of decision variables with re- spect to the MAPF rules is integrated directly into the SAT solver. This scheme allows for far more automated compila- tion where the SAT solver and the consistency checking pro- cedure work together simultaneously to create the Boolean model and to search for its satisfying assignment.
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
<a href="/en/project/GA19-17966S" target="_blank" >GA19-17966S: intALG-MAPFg: Intelligent Algorithms for Generalized Variants of Multi-Agent Path Finding</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
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 International Symposium on Combinatorial Search
ISBN
9781713834557
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
153-155
Publisher name
Association for the Advancement of Artificial Intelligence (AAAI)
Place of publication
Palo Alto, California
Event location
Virtual conference
Event date
Jul 26, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—