On Propositional Encodings of Cooperative Path-finding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126391" target="_blank" >RIV/00216208:11320/12:10126391 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Propositional Encodings of Cooperative Path-finding
Original language description
The approach to solving cooperative-path finding (CPF) as propositional satisfiability (SAT) is revisited in this paper. An alternative encoding that exploits multi-valued state variables representing locations where a given agent resides is suggested.
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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
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 24th International Conference on Tools with Artificial Intelligence
ISBN
978-0-7695-4915-6
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
524-531
Publisher name
IEEE Press
Place of publication
Athens
Event location
Athens, Greece
Event date
Nov 7, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—