By Topic

Solving the singularity problem of non-redundant manipulators by constraint optimization

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

3 Author(s)
Schreiber, G. ; German Aerosp. Res. Establ., Wessling, Germany ; Otter, M. ; Hirzinger, G.

A solution to the singularity problem of a non-redundant robot is proposed by reformulating the inverse kinematic problem as a constraint optimization problem. The main idea is to allow a cartesian error in a given subspace in the vicinity of a singularity and to minimize this error subject to operational constraints such as maximum motor speeds. As a result, in every sampling instant a series of linear least squares problems with linear equality and inequality constraints have to be solved. This task can be carried out on a Pentium processor within a few milliseconds. The new method is demonstrated by real experiments with an industrial robot

Published in:

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

Date of Conference:

1999