Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10287451" target="_blank" >RIV/00216208:11320/14:10287451 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs
Original language description
This paper addresses makespan optimal solving of cooperative path-finding problem (CPF) by translating it to propositional satisfiability (SAT). The task is to relocate set of agents to given goal positions so that they do not collide with each other. Anovel SAT encoding of CPF is suggested. The novel encoding uses the concept of matching in a bipartite graph to separate spatial constraint of CPF from consideration of individual agents. The separation allowed reducing the size of encoding significantly. The conducted experimental evalua-tion shown that novel encoding can be solved faster than exist-ing encodings for CPF and also that the SAT based methods dominates over A* based methods in environment densely occupied by agents.
Czech name
—
Czech description
—

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

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

Article name in the collection
Proceedings of the 26th International Conference on Tools with Artificial Intelligence
ISBN
978-1-4799-6572-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
875-882
Publisher name
IEEE
Place of publication
Greece
Event location
Greece
Event date
Nov 10, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)