More generally, an approach based on the growth of several independent trees, such as the rapidly exploring random forest of trees, can lead to a straightforward parallelization. However, the focus of this paper lies elsewhere: Our Star Student Project objective is to provide a parallel version of the basic (single-tree) RRT algorithm. Furthermore, this study is not about parallelizing subroutines of RRT, as is done for collision detection, nor about parallelizing specific variants of RRT, as is done for the any-time RRT. Finally, we aim to reduce the runtime of RRT and not to improve the quality of the paths it returns. Only little work relates to Star Student Project is parallelizing RRT.
Project Support for : Ph.D/M.E/M.Tech/B.E/B.Tech/MCA/Msc/BCA/Diplomo
Department : Computer Science/ Information Technology/ Electronics
Star Student Project
More generally, an approach based on the growth of several independent trees, such as the rapidly exploring random forest of trees, can lead to a straightforward parallelization. However, the focus of this paper lies elsewhere: Our Star Student Project objective is to provide a parallel version of the basic (single-tree) RRT algorithm. Furthermore, this study is not about parallelizing subroutines of RRT, as is done for collision detection, nor about parallelizing specific variants of RRT, as is done for the any-time RRT. Finally, we aim to reduce the runtime of RRT and not to improve the quality of the paths it returns. Only little work relates to Star Student Project is parallelizing RRT.