UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319563" target="_blank" >RIV/00216208:11320/15:10319563 - isvavai.cz</a>
Result on the web
<a href="https://www.aaai.org/ocs/index.php/SOCS/SOCS15/paper/viewFile/11245/10626" target="_blank" >https://www.aaai.org/ocs/index.php/SOCS/SOCS15/paper/viewFile/11245/10626</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding
Original language description
Solving cooperative path finding (CPF) by translating it to propositional satisfiability represents a viable option in highly constrained situations. The task in CPF is to relocate agents from their initial positions to given goals in a collision free manner. In this paper, we propose a reduced time expansion that is focused on makespan sub-optimal solving of the problem. The suggested reduced time expansion is especially beneficial in conjunction with a goal decomposition where agents are relocated oneby one.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
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 8th Annual Symposium on Combinatorial Search
ISBN
978-1-57735-732-2
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
236-237
Publisher name
AAAI
Place of publication
USA
Event location
Ein Gedi, Israel
Event date
Jun 11, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)