Cooperative Planning in Multiple Robots Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03120129" target="_blank" >RIV/68407700:21230/06:03120129 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Cooperative Planning in Multiple Robots Systems
Original language description
Search and rescue mission is an application of cooperative path planning. Paths for robots are planned according to criterion to find victims as fast as possible. Solution is based on decomposition of inspection task and solution of Multiple Traveling Salesmen Problem with MinMax criterion.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0567" target="_blank" >1M0567: Centre for Applied Cybernetics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2006
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
WORKSHOP 2006
ISBN
80-01-03439-9
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
144-145
Publisher name
ČVUT
Place of publication
Praha
Event location
Praha
Event date
Feb 20, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—