About: The RRT algorithms and a spatial index     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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
  • 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 (en)
Title
  • The RRT algorithms and a spatial index
  • The RRT algorithms and a spatial index (en)
skos:prefLabel
  • The RRT algorithms and a spatial index
  • The RRT algorithms and a spatial index (en)
skos:notation
  • RIV/00216305:26210/14:PU110141!RIV15-MSM-26210___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 43531
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/14:PU110141
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Motion planning, Rapidly-exploring random trees algorithm, spatial index (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [79B432F2C9FD]
http://linked.open...v/mistoKonaniAkce
  • Brno University of Technology
http://linked.open...i/riv/mistoVydani
  • Neuveden
http://linked.open...i/riv/nazevZdroje
  • 20th International Conference on Soft Computing, MENDEL 2014 (id 22122)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Matoušek, Radomil
  • Gulina, Irina
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 978-80-214-4984-8
http://localhost/t...ganizacniJednotka
  • 26210
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software