By Topic

A new approach for robot motion planning using rapidly-exploring Randomized Trees

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
$31 $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

3 Author(s)
Krammer, L. ; Autom. Syst. Group, Vienna Univ. of Technol., Vienna, Austria ; Granzer, W. ; Kastner, W.

In the last few years, car-like robots became increasingly important. Thus, motion planning algorithms for this kind of problem are needed more than ever. Unfortunately, this problem is computational difficult and so probabilistic approaches like Probabilistic Roadmaps or Rapidly-exploring Randomized Trees are often used in this context. This paper introduces a new concept for robot motion planning especially for car-like robots based on Rapidly-exploring Randomized Trees. In contrast to the conventional method, the presented approach uses a pre-computed auxiliary path to improve the distribution of random states. The main contribution of this approach is the significantly increased quality of the computed path. A proof-of-concept implementation evaluates the quality and performance of the proposed concept.

Published in:

Industrial Informatics (INDIN), 2011 9th IEEE International Conference on

Date of Conference:

26-29 July 2011