Rapidly-exploring Random Tree (RRT)

Rapidly-exploring Random Tree (RRT) is an algorithm used in robotics and path planning to efficiently explore complex spaces. It incrementally builds a tree by randomly sampling points within the space and connecting these points to the nearest node in the existing tree if the path is feasible. This approach quickly covers large and complex areas, helping to find a path from start to goal while avoiding obstacles. RRT is valued for its speed and effectiveness in high-dimensional problems, making it suitable for navigating robots and autonomous vehicles in uncertain or intricate environments.