DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA19-17966S" target="_blank" >GA19-17966S: intALG-MAPFg: Inteligentní algoritmy pro zobecněné varianty multi-agetního hledání cest</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the International Symposium on Combinatorial Search

ISBN

9781713834557

ISSN

—

e-ISSN

—

Počet stran výsledku

3

Strana od-do

153-155

Název nakladatele

Association for the Advancement of Artificial Intelligence (AAAI)

Místo vydání

Palo Alto, California

Místo konání akce

Virtual conference

Datum konání akce

26. 7. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—