Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning

E. Plaku and L. E. Kavraki, “Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning,” in IEEE International Conference on Robotics and Automation, Barcelona, Spain, 2005, pp. 3879–3884.


High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion planners that take full advantage of all the available resources. This paper shows how to effectively distribute the computation of the Sampling-based Roadmap of Trees (SRT) algorithm using a decentralized master-client scheme. The distributed SRT algorithm allows us to solve very high-dimensional problems that cannot be efficiently addressed with existing planners. Our experiments show nearly linear speedups with eighty processors and indicate that similar speedups can be obtained with several hundred processors.

Publisher: http://dx.doi.org/10.1109/ROBOT.2005.1570711

PDF preprint: http://kavrakilab.org/publications/plaku-kavraki2005distributed-sampling-based-roadmap.pdf