By Topic

Testing iterative robotic algorithms by their rate of convergence

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Klein, C.A. ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; Chu-Jeng, C. ; Kittivatcharapong, S.

The authors discuss a number of principles associated with the rate of convergence of iterative robotic calculations that have been found to be helpful in testing the correctness of such programs. One example of an iterative robotic calculation is performing inverse kinematics by an indirect method such as Jacobian control. Because such a method is based on a local approximation, the numerical results are not supposed to be perfect after changing joint angles a finite amount. It is not obvious how much error is inherent in the method. It is known that if the interval size is reduced to zero, the results will reach the ideal value. It has been the authors' experience, however, that even when the errors numerically reduce to zero in the limit, there can still be serious errors in the formulation or the computer program. Based on the authors' experience in developing and debugging new algorithms, several principles that will greatly aid in detecting errors are presented

Published in:

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