This paper presents a motion planning algorithm capable of exploiting the experience gained in previous path computations in the same static workspace. The algorithm takes advantage of a parallel approach to speed up computation and compile a graph retaining useful knowledge about the environment. Experimental results assess the performance improvement of the experience-based planner over the parallel implementation of a well-known probabilistic motion planning algorithm.
ERPP: an experience-based randomized path planner
REGGIANI, MONICA
2000
Abstract
This paper presents a motion planning algorithm capable of exploiting the experience gained in previous path computations in the same static workspace. The algorithm takes advantage of a parallel approach to speed up computation and compile a graph retaining useful knowledge about the environment. Experimental results assess the performance improvement of the experience-based planner over the parallel implementation of a well-known probabilistic motion planning algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
