Cart (Loading....) | Create Account
Close category search window
 

An efficient algorithm to find a shortest path for a car-like robot

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

2 Author(s)
Desaulniers, G. ; Ecole Polytech., Montreal, Que., Canada ; Soumis, F.

We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward or backward in an unconstrained environment. By applying necessary conditions on the segment lengths of shortest paths, we partition the configuration space into elements such that a single path type is associated with 150 elements and two path types are associated with the other 11 elements. A shortest path from a fixed initial configuration to any final configuration in an element can always be found among the paths of types associated with that element. We then present an algorithm based on this partition and we give results showing that our algorithm is 15 times faster on average than the Reeds-Shepp algorithm (1990)

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:11 ,  Issue: 6 )

Date of Publication:

Dec 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.