Abstract
AbstractIn this paper, we present an inexact multiblock alternating direction method for the point-contact friction model of the force-optimization problem (FOP). The friction-cone constraints of the FOP are reformulated as the Cartesian product of circular cones. We focus on the convex quadratic circular-cone programming model of the FOP, which is an exact cone-programming model. Coupled with the separable convex quadratic objective function, we recast the circular-cone-programming model as a multiblock separable cone model. A parallel inexact multiblock alternating direction method is used to solve the FOP. We prove the global convergence of the proposed method. Simulation results of the three-fingered FOP are reported, which verified the efficiency of the proposed method.
Funder
the Natural Science Basic Research Programs of Shaanxi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference25 articles.
1. Fok, L.M., Wang, J.: Two recurrent neural networks for grasping force optimization of multi-fingered robotic hands. In: Proceedings of the 2002 International Joint Conference on Neural Networks, vol. 1, pp. 35–40 (2002)
2. Xia, Y., Wang, J., Fok, L.M.: Grasping-force optimization for multifingered robotic hands using a recurrent neural network. IEEE Trans. Robot. Autom. 20(3), 549–554 (2004)
3. Zheng, Y., Chew, C.M., Adiwahono, A.H.: A GJK-based approach to contact force feasibility and distribution for multi-contact robots. Robot. Auton. Syst. 59(3), 194–207 (2011)
4. Cheng, F., Orin, D.: Efficient algorithms for optimal force distribution—the compact dual LP method. IEEE Trans. Robot. Autom. 6(2), 178–187 (1990)
5. Liu, Y.: Qualitative test and force optimization of 3-d frictional forceclosure grasps using linear programming. IEEE Trans. Robot. Autom. 15(1), 163–173 (1999)