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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a… 
2017
2017
Informed Anytime Search for Continuous Planning Problems Jonathan D. Gammell Doctor of Philosophy Graduate Department of… 
2016
2016
This report presents a methodology to integrate vector field based motion planning techniques with optimal, differential… 
Review
2015
Review
2015
We recently introduced Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near… 
2014
2014
This paper proposes a sampling based kinodynamic planning technique for planning persistent monitoring trajectories for a sensing… 
2014
2014
The distance metric is a key component in RRT-based motion planning that deeply affects coverage of the state space, path quality… 
2010
2010
Rapidly-exploring Random Tree(RRT) algorithm is a practical and promising solution to motion planning problem.The algorithm… 
2007
2007
Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high degree-of… 
2004
2004
We propose an efficient algorithm for a single pursuer searching for an unpredictable static evader in a 2D environment. The…