Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmAny-angle path planningDijkstra's algorithmFractal

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Rapidly-exploring Random Trees for Testing Automated Vehicles
One of the expectations from fully or partially automated vehicles is to never cause an accident and actively avoid dangerous… 
Review
2019
Review
2019
Systematic Literature Review of Sampling Process in Rapidly-Exploring Random Trees
Path planning is one of the most important process on applications such as navigating autonomous vehicles, computer graphics… 
Highly Cited
2015
Highly Cited
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… 
Highly Cited
2014
Highly Cited
2014
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning… 
Highly Cited
2013
Highly Cited
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… 
Highly Cited
2013
Highly Cited
2013
A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees
The computationally efficient search for robust feasible paths for unmanned aerial vehicles (UAVs) in the presence of uncertainty… 
2011
2011
Anytime synchronized-biased-greedy rapidly-exploring random tree path planning in two dimensional complex environments
A new synchronized biased-greedy RRT is proposed which leverages the strengths of the biased and greedy RRTs. It combines the… 
Highly Cited
2011
Highly Cited
2011
Decentralized path planning for multi-agent teams in complex environments using rapidly-exploring random trees
This paper presents a novel approach to address the challenge of planning paths for multi-agent systems operating in complex… 
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… 
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)