RRT-Path: a guided Rapidly exploring Random Tree

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
RRT-Path: a guided Rapidly exploring Random Tree
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
RRT-Path: a guided Rapidly exploring Random Tree
Popis výsledku anglicky
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.

Projekt
<a href="/cs/project/2C06005" target="_blank" >2C06005: Systém pro robotickou tele-výuku</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění
2009
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)