Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.