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

Path planning for redundant manipulators using iterative optimization technique

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)
Fenger, D.K. ; Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada ; Lu, W.-S.

The authors present a fairly general solution to the problem of how best to use the extra degree(s) of freedom that redundant manipulators allow. One of the particular strengths of the algorithm presented here is that it can easily use a broad range of possible cost functions in the optimization. The main goal of the algorithm, however, is to make the optimization less expensive, computationally. It is hoped that this approach may lead to practical (suboptimal) solutions that can run in real time or nearly so, on the next generation of computers

Published in:

Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

19-21 May 1993

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.