Probabilistic Analysis of RRT Trees

Konrad Anand, Luc Devroye

This thesis presents analysis of the properties and run-time of the Rapidly-exploring Random Tree (RRT) algorithm. It is shown that the time for the RRT with stepsize $\epsilon$ to grow c…