Parallelizing RRT on large-scale distributed-memory architectures
Résumé
This paper addresses the problem of parallelizing the Rapidly-exploring Random Tree (RRT) algorithm on large-scale distributed-memory architectures, using the Message Passing Interface. We compare three parallel versions of RRT based on classical parallelization schemes. We evaluate them on different motion planning problems and analyze the various factors influencing their performance.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...