= Rapidly exploring random tree
{wiki=Rapidly_exploring_random_tree}
Rapidly exploring Random Trees (RRT) is an algorithm used primarily for path planning in high-dimensional spaces. It's particularly useful in robotics and motion planning where the goal is to find an efficient path from a starting point to a goal point while avoiding obstacles. \#\#\# Key Features of RRT: 1. **Random Sampling**: The RRT algorithm generates random samples in the space, which helps explore the configuration space of the robot or object being planned for.
Back to article page