Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319568" target="_blank" >RIV/00216208:11320/15:10319568 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally
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. The suggested reduced time expansion is especially beneficial in conjunction with a goal decomposition where agents are relocated one by one.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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 24rd International Joint Conference on Artificial Intelligence
ISBN
978-1-57735-738-4
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
1916-1922
Publisher name
IJCAI/AAAI
Place of publication
USA
Event location
Buenos Aires
Event date
Jul 20, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—