A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A10079015" target="_blank" >RIV/00216208:11320/09:10079015 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs
Original language description
The class of multi-robot path planning problem with bi-connected graphs is studied. A novel polynomial-time solving algorithm for this class of problem is proposed.
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
2009
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 2009 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
ISBN
978-1-4244-2788-8
ISSN
1050-4729
e-ISSN
—
Number of pages
7
Pages from-to
—
Publisher name
IEEE
Place of publication
NEW YORK
Event location
KOBE, Japan
Event date
May 12, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000276080400151