By Topic

Shortest distance paths for wheeled mobile robots

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

3 Author(s)
J. C. Alexander ; Dept. of Math., Maryland Univ., College Park, MD, USA ; J. H. Maddocks ; B. A. Michalowski

Minimal distance paths between prescribed initial and final configurations of a wheeled mobile robot are calculated, both analytically and numerically, using methods of optimal control. The construction of these trajectories can be considered as part of an analysis of obstacle avoidance

Published in:

IEEE Transactions on Robotics and Automation  (Volume:14 ,  Issue: 5 )