An Optimization Variant of Multi-Robot Path Planning is Intractable
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10053447" target="_blank" >RIV/00216208:11320/10:10053447 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An Optimization Variant of Multi-Robot Path Planning is Intractable
Original language description
An optimization variant of a problem of path planning for multiple robots is addressed in this work. A proof of the claim that optimal path planning for multiple robots is NP-complete is sketched in the paper.
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/GP201%2F09%2FP318" target="_blank" >GP201/09/P318: Constraint programming and Boolean satisfiability for artificial intelligence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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 AAAI Conference on Artificial Intelligence
ISBN
978-1-57735-463-5
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
—
Publisher name
AAAI Press
Place of publication
Menlo Park, CA, USA
Event location
Atlanta, GA, USA
Event date
Jul 11, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—