Grasping Force Optimization for Multi-fingered Robotic Hands Using Projection and Contraction Methods
- 12 Downloads
Grasping force optimization of multi-fingered robotic hands can be formulated as a convex quadratic circular cone programming problem, which consists in minimizing a convex quadratic objective function subject to the friction cone constraints and balance constraints of external force. This paper presents projection and contraction methods for grasping force optimization problems. The proposed projection and contraction methods are shown to be globally convergent to the optimal grasping force. The global convergence makes projection and contraction methods well suited to the warm-start techniques. The numerical examples show that the projection and contraction methods with warm-start version are fast and efficient.
KeywordsCircular cone programming Second-order cone programming Projection and contraction method SeDuMi software
Mathematics Subject Classification90C90 90C25 65K05
We would like to thank the editor and the anonymous reviewers for their constructive comments, and we benefit much from the suggestions. This work was supported by the National Science Foundations for Young Scientists of China (11101320), the National Science Basic Research Plan in Shaanxi Province of China (2015JM1031), and the Fundamental Research Funds for the Central Universities (JB150713).
- 20.Sturm, J.F.: Central region method. In: Frenk, J.B.G., Roos, C., Terlaky, T., Zhang, S. (eds.) High Performance Optimization, pp. 157–194. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar
- 22.Zhao, X.Y.: A semismooth Newton-CG augmented Lagrangian method for large scale linear and convex quadratic SDPs. Ph.D. Thesis, National University of Singapore (2009)Google Scholar