A scalable distributed RRT for motion planning
- Additional Document Info
- View All
Rapidly-exploring Random Tree (RRT), like other sampling-based motion planning methods, has been very successful in solving motion planning problems. Even so, sampling-based planners cannot solve all problems of interest efficiently, so attention is increasingly turning to parallelizing them. However, one challenge in parallelizing RRT is the global computation and communication overhead of nearest neighbor search, a key operation in RRTs. This is a critical issue as it limits the scalability of previous algorithms. We present two parallel algorithms to address this problem. The first algorithm extends existing work by introducing a parameter that adjusts how much local computation is done before a global update. The second algorithm radially subdivides the configuration space into regions, constructs a portion of the tree in each region in parallel, and connects the subtrees,i removing cycles if they exist. By subdividing the space, we increase computation locality enabling a scalable result. We show that our approaches are scalable. We present results demonstrating almost linear scaling to hundreds of processors on a Linux cluster and a Cray XE6 machine. 2013 IEEE.
name of conference
2013 IEEE International Conference on Robotics and Automation (ICRA)
2013 IEEE International Conference on Robotics and Automation
author list (cited authors)
Jacobs, S. A., Stradford, N., Rodriguez, C., Thomas, S., & Amato, N. M.
complete list of authors
Jacobs, Sam Ade||Stradford, Nicholas||Rodriguez, Cesar||Thomas, Shawna||Amato, Nancy M