Motion planning using adaptive random walks

doi:10.1109/TRO.2004.833790

Motion planning using adaptive random walks

2005-02-01

40

PRE

AI

DOI：10.1109/TRO.2004.833790

Original

Original request for help

Save

Abstract

En 中文

We propose a novel single-shot motion-planning algorithm based on adaptive random walks. The proposed algorithm turns out to be simple to implement, and the solution it produces can be easily and efficiently optimized. Furthermore, the algorithm can incorporate adaptive components, so the developer is not-required to specify all the parameters of the random distributions involved, and the algorithm itself can adapt to the environment it is moving in. Proofs of the theoretical soundness of the algorithm are provided, as well as implementation details. Numerical comparisons with well-known algorithms illustrate its effectiveness.

Keywords:

adaptive sampling

holonomic path planning

stochastic processes

Motion planning using adaptive random walks

Abstract

Journal

Organization