We propose a simple collision-free motion planning algorithm that, by adopting the lazy approach, statistically yields improved runtime performance in comparison with classical rapidly-exploring random tree (RRT). Lazy RRT (with laziness at the edges only) can be regarded as an asymptotically suboptimal sampling-based motion planning algorithm, which trades off optimality for velocity. Two simulation scenarios characterized by a suitably structured environ- ment are considered to evaluate the effectiveness of the proposed approach.
On edge-lazy RRT collision checking in sampling-based motion planning
RICCIARDI CELSI L;
2021-01-01
Abstract
We propose a simple collision-free motion planning algorithm that, by adopting the lazy approach, statistically yields improved runtime performance in comparison with classical rapidly-exploring random tree (RRT). Lazy RRT (with laziness at the edges only) can be regarded as an asymptotically suboptimal sampling-based motion planning algorithm, which trades off optimality for velocity. Two simulation scenarios characterized by a suitably structured environ- ment are considered to evaluate the effectiveness of the proposed approach.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
