EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F16%3APU120315" target="_blank" >RIV/00216305:26210/16:PU120315 - isvavai.cz</a>
Result on the web
<a href="http://www.mendel-conference.org" target="_blank" >http://www.mendel-conference.org</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
EFFICIENT NEAREST NEIGHBOR SEARCHING IN RRTS
Original language description
The cost of nearest-neighbor calls is one of the bottlenecks in the performance of sampling-based motion planning algorithms and particularly Rapidly-exploring Random Trees (RRT) algorithm. Although RRT 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 suggests the enhancement of this function. Through a series of simulation experiments we evaluate and compare the performance of RRT-based algorithms and report on the results verifying the efficiency of the suggested nearest neighbor searching method.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
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
MENDEL 2016 22nd Conference on Soft Computing
ISBN
978-80-214-5365-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
189-194
Publisher name
Neuveden
Place of publication
Brno
Event location
Brno
Event date
Jun 8, 2016
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—