Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287455" target="_blank" >RIV/00216208:11320/14:10287455 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More
Original language description
This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task in CPF is to relocate a set of agents to given goal locations so that they do not collide with eachother. Recent findings indicate that a simple direct en-coding outperforms the more elaborate encodings based on binary encodings of multi-value state variables. The direct encoding is further improved by a hierar-chical build-up that uses auxiliary variables to reduce its size in this work. The conducted experimental evaluation shown that the simple design of the encod-ing together with new improvements which reduced its size significantly are key enablers for faster solving of the encoded CPFs than with existing encod-ings. It has been also shown that the SAT based methods dominates over A* based methods in environments with high occupancy by agents.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1287" target="_blank" >GAP103/10/1287: PlanEx: Bridging Planning and Execution</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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 13th Mexican International Conference on Artificial Intelligence
ISBN
978-3-319-13649-3
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
410-425
Publisher name
Springer
Place of publication
Mexico
Event location
Mexico
Event date
Nov 16, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—