Rapidly-exploring random tree

Rapidly - exploring random tree (RRT ) (Eng. about fast erkundender random tree ) is a search algorithm (and its underlying tree data structure ), which randomly scans high-dimensional search spaces of possible paths. In robotics, the algorithm and variations thereof are often used for motion planning, ie for the planning of efficient movements, eg of gripping arms.