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

On optimal nonholonomic paths in a limited space

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)
Shkel, A.M. ; Dept. of Mech. & Aerosp. Eng., California Univ., Irvine, CA, USA ; Lumelsky, V.J.

This work addresses the problem of finding the shortest path for a vehicle (say, a mobile robot or a car) moving in a limited workspace. The proposed approach makes use of a tool dubbed the reflective unfolding operator which has a clear geometric interpretation and provides an interesting means for solving other trajectory design problems. The authors' previously reported result (1997) which relates to the special case of a car maneuvering within a disc-shaped area, is extended here to the general case of an arbitrarily shaped area. The approach is illustrated by computer simulations

Published in:

Intelligent Robots and Systems, 2000. (IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference:

2000

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.