By Topic

On the structure of minimum effort solutions with application to kinematic redundancy resolution

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)
Gravagne, I.A. ; Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA ; Walker, I.D.

There exist in robotics, as in many other disciplines, problems described by an underdetermined set of constraints, possessing an infinite number of solutions. The problem of robot manipulator redundancy resolution is just such a situation, requiring that a particular solution be chosen according to some type of optimization criterion. One possibility employs a type of optimization which minimizes the maximum magnitude of the solution vector. This is the minimum infinity norm solution, also known as the “minimum effort solution.” The paper explores the details of least infinity norm optimization, using kinematic redundancy resolution as a test case to explore the details of infinity-norm optimization. We introduce for the first time a closed-form expression for minimum effort solutions, illustrating the heretofore unknown properties of nonuniqueness and discontinuity in time-varying situations, and postulating a possible remedy for the discontinuity problem. Additionally, to reinforce the mathematics, simulations of four-link robots are included, as well as an extended discussion of minimum-effort solutions from a geometric point of view

Published in:

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