Rapidly Exploring Random Trees Used for Mobile Robots Path Planning

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61388998%3A_____%2F05%3A00023029" target="_blank" >RIV/61388998:_____/05:00023029 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Rapidly Exploring Random Trees Used for Mobile Robots Path Planning

Original language description

Path planning problem in mobile robotics can be solved in several ways. Often used are probabilistic roadmaps and potential field algorithm. However, adding nonholonomic constraints into path planning algorithm can be difficult for those methods. Therefore the rapidly exploring random trees (RRT) algorithm was examined and paper illustrates its usability in path planning task for both legged (walking) and wheeled mobile robots.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Engineering Mechanics

ISSN

1802-1484

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

4

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

7

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—