Rapidly-exploring random tree

Known as: Informed RRT*, Rapidly-exploring random graph, Rapidly exploring random tree 
A rapidly exploring random tree (RRT) is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space… (More)
Wikipedia

Related topics

Related topics

12 relations
AlgorithmAny-angle path planningDijkstra's algorithmFractal
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
PaRRT: Parallel rapidly exploring random tree (RRT) based on MapReduce
The basic Rapidly Exploring Random Trees (RRT) method is recognized as a very effective solution to resolve motion planning… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 5
Is this relevant?
2017
2017
Experimental Study of Parameters for Rapidly-exploring Random Tree Algorithm
The Rapidly-exploring Random Tree (RRT) is a useful path planning algorithm and has been extensively researched in recent years… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2016
2016
Dynamic Region-biased Rapidly-exploring Random Trees
Current state-of-the-art motion planners rely on samplingbased planning to explore the problem space for a solution. However… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2015
2015
Kinodynamic Planner Dual-Tree RRT (DT-RRT) for Two-Wheeled Mobile Robots Using the Rapidly Exploring Random Tree
We propose a new trajectory generation scheme called dual-tree rapidly exploring random tree (DT-RRT), which is designed on the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2013
2013
Rapidly-exploring random tree based memory efficient motion planning
This paper presents a modified version of the RRT* motion planning algorithm, which limits the memory required for storing the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Adapting a Rapidly-Exploring Random Tree for Automated Planning
Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2010
2010
Information-rich Path Planning with General Constraints using Rapidly-exploring Random Trees
This paper introduces the Information-rich Rapidly-exploring Random Tree (IRRT), an extension of the RRT algorithm that embeds… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Mobile robot path planning based on an improved rapidly-exploring random tree in unknown environment
To deal with the path planning of mobile robot in unknown environment, an improved rapidly-exploring random tree (RRT) is… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
An obstacle-based rapidly-exploring random tree
Tree-based path planners have been shown to be well suited to solve various high dimensional motion planning problems. Here we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?