Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Time-optimal motion planning of autonomous vehicles in the presence of obstacles

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

1 Author(s)
Sadegh, N. ; George W. Woodruff Sch. of Mech. Eng., Georgia Inst. of Technol., Atlanta, GA

This paper presents a novel motion planning approach inspired by the Dynamic Programming (DP) for mobile robots and other autonomous vehicles. The proposed discrete- time algorithm enables a multi-degree of freedom vehicle to reach its destination through an arbitrary obstacle field in a minimum number of time steps. Furthermore, the resulting optimal path is guaranteed to posses the required degree of smoothness and incorporates the motion state constraints such as velocity, acceleration, and jerk limits. The algorithm is proven to terminate in a finite number of steps without its computational complexity increasing with the type or number of obstacles. The effectiveness of the algorithm is demonstrated on a mobile robot modeled as a point-mass in a 2-dimensional space subject to velocity and acceleration limits.

Published in:

American Control Conference, 2008

Date of Conference:

11-13 June 2008