Abstract
In this paper we present a novel approach for synthesizing and optimizing both positions and forces in force closure grasps. This problem is a non-convex optimization problem in general since it involves constraints that are bilinear; in particular, computing wrenches involves a bilinear product between grasp contact points and contact forces. Thus, conventional approaches to this problem typically employ general purpose gradient-based nonlinear optimization. The key observation of this paper is that the force closure grasp synthesis problem can be posed as a Bilinear Matrix Inequality (BMI), for which there exist efficient solution techniques based on semidefinite programming. We show that we can synthesize force closure grasps on different geometric objects, and by maximizing a lower bound of a grasp metric, we can improve the quality of the grasp. While this approach is not guaranteed to find a solution, it has a few distinct advantages. First, we can handle non-smooth but convex positive semidefinite constraints, which can often be important. Second, in contrast to gradient-based approaches we can prove infeasibility of problems. We demonstrate our method on a 15 joint robot model grasping objects with various geometries. The code is included in https://github.com/RobotLocomotion/drake.
This work is supported by David S.Y. and Harold Wong Fellowship, and ONR MURI grant N00014-09-1-1051.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3–51 (2003)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Boyd, S.P., Wegbreit, B.: Fast computation of optimal contact forces. IEEE Trans. Robot. 23(6), 1117–1132 (2007)
Buss, S.R.: Introduction to inverse kinematics with jacobian transpose, pseudoinverse and damped least squares methods (2004)
Chen, I.-M., Burdick, J.W.: Finding antipodal point grasps on irregularly shaped objects. IEEE Trans. Robot. Autom. 9(4), 507–512 (1993)
Craig, J.J.: Introduction to Robotics: Mechanics and Control, 3rd edn. Pearson Education Inc, New Jersey (2005)
Dai, H., Valenzuela, A., Tedrake, R.: Whole-body motion planning with centroidal dynamics and full kinematics. In: IEEE-RAS International Conference on Humanoid Robots (2014)
Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis (2002)
Ferrari, C., Canny, J.: Planning optimal grasps. In: 1992 IEEE International Conference on Robotics and Automation, 1992. Proceedings, pp. 2290–2295. IEEE (1992)
Han, L., Trinkle, J.C., Li, Z.X.: Grasp analysis as linear matrix inequality problems. IEEE Trans. Robot. Autom. 16(6), 663–674 (2000)
Ibaraki, S., Tomizuka, M.: Rank minimization approach for solving bmi problems with random search. In: Proceedings of the 2001. American Control Conference, 2001, vol. 3, pp. 1870–1875. IEEE (2001)
Kirkpatrick, D., Mishra, B., Yap, C.-K.: Quantitative steinitz’s theorems with applications to multifingered grasping. Discret. Comput. Geom. 7(1), 295–318 (1992)
Liu, G., Xu, J., Wang, X., Li, Z.: On quality functions for grasp synthesis, fixture planning, and coordinated manipulation. IEEE Trans. Autom. Sci. Eng. 1(2), 146–162 (2004)
Majumdar, A., Ahmadi, A.A., Tedrake, R.: Control design along trajectories with sums of squares programming. In: Proceedings of the 2013 IEEE International Conference on Robotics and Automation (ICRA) (2013)
Mishra, B.: Grasp metrics: optimality and complexity. In: Proceedings of the workshop on Algorithmic foundations of robotics, pp. 137–165. AK Peters, Ltd. (1995)
Mosek, A.: The mosek optimization software. Online at: http://www.mosek.com, vol. 54 (2010)
Murray, R.M., Li, Z., Sastry, S.S.: A Mathematical Introduction to Robotic Manipulation. CRC Press Inc., Boca Raton (1994)
Nguyen, V.-D.: Constructing force-closure grasps. Int. J. Robot. Res. 7(3), 3–16 (1988)
Parrilo, P.A.: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. Ph.D. thesis, California Institute of Technology, May 18 2000
Rosales, C., Ros, L., Porta, J.M., Suárez, R.: Synthesizing grasp configurations with specified contact regions. Int. J. Robot. Res. 30(4), 431–443 (2011)
Salamin, E.: Application of quaternions to computation with rotations. Technical report, Working Paper (1979)
Schulman, J.D., Goldberg, K., Abbeel, P.: Grasping and fixturing as submodular coverage problems. In: International Symposium on Robotics Research, pp. 1–12 (2011)
Tedrake, R., Manchester, I.R., Tobenkin, M.M., Roberts, J.W.: LQR-Trees: feedback motion planning via sums of squares verification. Int. J. Robot. Res. 29, 1038–1052 (2010)
Ziegler, G.: Lectures on polytopes, vol. 152. Springer Science and Business Media (1995)
Acknowledgements
We would like to thank Amir Ali Ahmadi for introducing BMI and reference [11]; Alberto Rodriguez for the discussion, and ABB Inc for loaning the IRB140 arm.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
When all contact points \(x_i\) and friction cone edges \(e^j_i\) are given, we can compute the exact value of \(Q_1\) metric. First we transform representation of the wrench set \(\mathcal {W}\) from using vertices \(V^j_i\) (V-representation) to using half-spaces (H-representation) \(\mathcal {W} = \left\{ w| w^Ta_{\mathcal {W}}^i\le b_\mathcal {W}^i,\;i=1,\ldots ,m\right\} \), where m is the number of facets for \(\mathcal {W}\). The \(Q_1\) metric is computed as \(\min _{i=1,\ldots ,m}b^i_\mathcal {W}/\sqrt{\left( a_{\mathcal {W}}^i\right) ^TQ_w^{-1}a_{\mathcal {W}}}\). Note that we cannot optimize the \(Q_1\) metric while searching for \(x_i\) and \(e^j_i\), since it is nontrivial to transform from V-representation to H-representation when the vertices are not fixed [24].
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Dai, H., Majumdar, A., Tedrake, R. (2018). Synthesis and Optimization of Force Closure Grasps via Sequential Semidefinite Programming. In: Bicchi, A., Burgard, W. (eds) Robotics Research. Springer Proceedings in Advanced Robotics, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-51532-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-51532-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51531-1
Online ISBN: 978-3-319-51532-8
eBook Packages: EngineeringEngineering (R0)