On Parallel RRTs for Multi-robot Systems

Abstract

Rapidly-exploring Random Trees are planning algorithms recently introduced for a broad class of path planning problems. In this paper we provide three different ways to better the performance of such algorithms. Numerical results obtained implementing them over a parallel system outline an optimal speed up.