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.
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… 
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… 
2017
2017
Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees
A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a… 
Review
2015
Review
2015
Robotic motion planning in unknown dynamic environments: Existing approaches and challenges
Path planning with obstacles avoidance in dynamic environments is a crucial issue in robotics. Numerous approaches have been… 
2014
2014
Forage RRT — An efficient approach to task-space goal planning for high dimensional systems
Achieving efficient end-effector planning for manipulators in real world workspaces is challenging due to the fact that planning… 
2010
2010
Path Planning Based on Fuzzy Rolling Rapidly-exploring Random Tree for Mobile Robot
The mobile robot path planning in an unknown environment is studied.The rapidly-exploring random tree(RRT) algorithm is combined… 
2010
2010
Adaptive Weighted Rapidly-exploring Random Tree Algorithm
Rapidly-exploring Random Tree(RRT) algorithm is a practical and promising solution to motion planning problem.The algorithm… 
2009
2009
Improved Path Planning Based on Rapidly-Exploring Random Tree for Mobile Robot in Unknown Environment
An improved path planning algorithm is proposed by combining rapidly-exploring random tree (RRT) and rolling path planning.In… 
2006
2006
Extension of the Rapidly Exploring Random Tree Algorithm with Key Configurations for Nonholonomic Motion Planning
The rapidly exploring random tree (RRT) algorithm is a randomized path planning method specifically designed for robots with… 
2004
2004
Planning to find an unpredictable evader using rapidly-exploring random tree
We propose an efficient algorithm for a single pursuer searching for an unpredictable static evader in a 2D environment. The… 
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)