Variants of independence detection in SAT-based optimal multi-agent path finding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10381950" target="_blank" >RIV/00216208:11320/17:10381950 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-319-93581-2_7" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-93581-2_7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-93581-2_7" target="_blank" >10.1007/978-3-319-93581-2_7</a>
Alternative languages
Result language
angličtina
Original language name
Variants of independence detection in SAT-based optimal multi-agent path finding
Original language description
In multi-agent path finding (MAPF) on graphs, the task is to find paths for distinguishable agents so that each agent reaches its unique goal vertex from the given start while collisions between agents are forbidden. A cumulative objective function is often minimized in MAPF. The main contribution of this paper consists in integrating independence detection technique (ID) into a compilation-based MAPF solver that translates MAPF instances into propositional satisfiability (SAT). The independence detection technique in search-based solvers tries to decompose a given MAPF instance into instances consisting of small groups of agents with no interaction across groups. After the decomposition phase, small instances are solved independently and the solution of the original instance is combined from individual solutions to small instances. The presented experimental evaluation indicates significant reduction of the size of instances translated to the target SAT formalism and positive impact on the overall performance of the solver.
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/8G15027" target="_blank" >8G15027: INTEGRATION OF HEURISTIC SEARCH AND COMPILATION-BASED TECHNIQUES FOR MULTI-AGENT PATH-FINDING</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
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
Lecture Notes in Computer Science
ISBN
978-3-319-93580-5
ISSN
0302-9743
e-ISSN
neuvedeno
Number of pages
21
Pages from-to
116-136
Publisher name
Springer Verlag
Place of publication
Neuveden
Event location
Porto; Portugal
Event date
Feb 24, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000443493600007