A rapidly-exploring random tree (RRT) is a data structure and algorithm that is designed for efficiently searching nonconvex high-dimensional spaces. RRT is constructed incrementally in a way that ...