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

A global approach to path planning for redundant manipulators

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)
Seereeram, S. ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; Wen, J.T.

This paper presents a new approach to path planning for redundant manipulators. The path planning problem is posed as a finite time nonlinear control problem which can be solved by a Newton-Raphson type algorithm together with an exterior penalty function method. This technique is capable of handling various goal task definitions as well as incorporating both joint and task space constraints. The algorithm has shown promising results in planning joint path sequences to meet Cartesian goal planning and path following. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima. Applications to planar 3R and 4R arms, cooperating 3R arms and a spatial 9 DOF arm are included

Published in:

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

Date of Publication:

Feb 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.