A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287454" target="_blank" >RIV/00216208:11320/14:10287454 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well
Original language description
This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). A novel very simple SAT encoding of CPF is proposed and compared with exist-ing elaborate encodings. The conducted experimental evaluation shown that the simple design of the encoding allows solving it faster than existing encodings for CPF in cases with higher density of 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 Pacific Rim International Conference on Artificial Intelligence
ISBN
978-3-319-13559-5
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
827-833
Publisher name
Springer
Place of publication
Australia
Event location
Australia
Event date
Dec 1, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—