The RRT algorithms and a spatial index
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F14%3APU110141" target="_blank" >RIV/00216305:26210/14:PU110141 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The RRT algorithms and a spatial index
Original language description
The Rapidly-exploring Random Trees algorithm (RRT), based on incremental sampling, is a popular and powerful tool for motion planning problems. Although the RRT algorithm returns the solution relatively quickly, the computational cost of every new algorithm loop increases as the tree grows because of the nearest neighbor searching procedure. This paper solves this problem and improves the RRT performance using a spatial index. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms with and without a spatial index. We report on the results verifying the efficiency of the use of a spatial index
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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
20th International Conference on Soft Computing, MENDEL 2014 (id 22122)
ISBN
978-80-214-4984-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
279-284
Publisher name
Neuveden
Place of publication
Neuveden
Event location
Brno University of Technology
Event date
Jun 25, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—