By Topic

A comparative study of geometric algorithms for real-time grasping force 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
$33 $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)
G. F. Liu ; Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China ; J. J. Xu ; Z. X. Li

Real-time grasping force optimization problem can be naturally formulated as a convex optimization problem on the Riemannian manifold of positive definite matrices subject to linear constraints for which many algorithms, including gradient algorithms, Newton algorithms, and interior point algorithms, have been developed. In all these algorithms we need to specify a step size in every iteration and a valid initial point to start the recursion. In this paper we propose several strategies for selecting such a step size according to the properties of each algorithm and one method for searching a valid initial point. Simulation and experimental results show the different performances of these algorithms from computation time and convergence rates.

Published in:

Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003 IEEE International Conference on  (Volume:1 )

Date of Conference:

8-13 Oct. 2003