A simple and efficient randomized algorithm is presented

for solving single-query path planning problems

in high-dimensional configuration spaces. The method

works by incrementally building two Rapidly-exploring

Random Trees (RRTs) rooted at the start and the goal

configurations.