Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10372011" target="_blank" >RIV/00216208:11320/17:10372011 - isvavai.cz</a>
Result on the web
<a href="http://drops.dagstuhl.de/opus/volltexte/2018/8459/pdf/OASIcs-ICLP-2017-11.pdf" target="_blank" >http://drops.dagstuhl.de/opus/volltexte/2018/8459/pdf/OASIcs-ICLP-2017-11.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/OASIcs.ICLP.2017.11" target="_blank" >10.4230/OASIcs.ICLP.2017.11</a>
Alternative languages
Result language
angličtina
Original language name
Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding
Original language description
The multi-agent pathfinding (MAPF) problem has attracted considerable attention because of its relation to practical applications. The majority of solutions for MAPF are algorithmic. Recently, declarative solutions that reduce MAPF to encodings for off-the-shelf solvers have achieved remarkable success. We present a constraint-based declarative model for MAPF, together with its implementation in Picat, which uses SAT and MIP. We consider both the makespan and the sum-of-costs objectives, and propose a preprocessing technique for improving the performance of the model. Experimental results show that the implementation using SAT is highly competitive. We also analyze the high performance of the SAT solution by relating it to the SAT encoding algorithms that are used in the Picat compiler.
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)
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
Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)
ISBN
978-3-95977-058-3
ISSN
2190-6807
e-ISSN
neuvedeno
Number of pages
2
Pages from-to
1-2
Publisher name
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl, Germany
Event location
Melbourne, Australia
Event date
Aug 28, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—