|
Abstract : |
We present our current progress on the design and analysis of path planning algorithms based on Rapidlyexploring Random Trees (RRTs). The basis for our methods is the incremental construction of search trees that attempt to rapidly and uniformly explore the state space, oering benets that are similar to those obtained by other successful randomized planning methods; however, RRTs are particularly suited for problems that involve dierential constraints. Basic properties of RRTs are established, including convergence to a uniform coverage of nonconvex spaces. Several planners based on RRTs are discussed and compared. Experimental results are presented for planning problems that involve holonomic constraints for rigid and articulated bodies, manipulation, nonholonomic constraints, kinodynamic constraints, kinematic closure constraints, and up to twelve degrees of freedom. Key open issues and areas of future research are also discussed. 1, |
