RRT-Path: a guided Rapidly exploring Random Tree
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00158239" target="_blank" >RIV/68407700:21230/09:00158239 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
RRT-Path: a guided Rapidly exploring Random Tree
Original language description
During last decade Rapidly Exploring random trees (RRT) became widely used for solving a motion planning problem in various areas. Poor performance of these algorithms has been noticed in environments with narrow passages. Several variants have been developed to address this issue. This paper presents a new variation of the RRT designed for sampling environments with narrow passages. Performance of the proposed method has been experimentally verified and results are compared with the original RRT, RRT-Bidirectional na RRT-Blossom algorithms.
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/2C06005" target="_blank" >2C06005: A System for robotic e-learning</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
Robot Motion and Control 2009
ISBN
978-1-84882-984-8
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Heidelberg
Event location
Czerniejewo
Event date
Jun 1, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—