By Topic

Motion planning using adaptive random walks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Carpin ; Sch. of Eng. & Sci., Int. Univ. Bremen, Germany ; G. Pillonetto

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.

Published in:

IEEE Transactions on Robotics  (Volume:21 ,  Issue: 1 )