Globally Optimal Grasp Planning using a Two-Stage Branch-And-Bound Algorithm

We present the first algorithm to compute the globally optimal gripper pose that maximizes a grasp metric. We solve this problem using a two-level branch-and-bound (BB) algorithm. Unlike previous work that only searches for grasp points, our method can take the gripper's kinematic feasibility into consideration. And compared with sampling-based grasp planning algorithms, our method can compute the globally optimal gripper pose or predict infeasibility with finite-time termination. Our main technical contribution is a novel mixed-integer conic programming (MICP) formulation for the inverse kinematics of the gripper which uses a small number of binary variables and tightened constraints. Our experiments show that globally optimal gripper poses for various target objects can be computed within 3hr of computation on a desktop machine and the computed grasp quality is better than those generated using sampling-based planners.

[1]  Stefan Ulbrich,et al.  A framework for solving mixed-integer semidefinite programs , 2018, Optim. Methods Softw..

[2]  Peter K. Allen,et al.  Graspit! A versatile simulator for robotic grasping , 2004, IEEE Robotics & Automation Magazine.

[3]  Dinesh Manocha,et al.  Incremental penetration depth estimation between convex polytopes using dual-space expansion , 2004, IEEE Transactions on Visualization and Computer Graphics.

[4]  Russ Tedrake,et al.  Synthesis and Optimization of Force Closure Grasps via Sequential Semidefinite Programming , 2015, ISRR.

[5]  Dinesh Manocha,et al.  Generating Optimal Grasps Under A Stress-Minimizing Metric , 2019, ArXiv.

[6]  Máximo A. Roa,et al.  Grasp quality measures: review and performance , 2014, Autonomous Robots.

[7]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[8]  P. Allen,et al.  Dexterous Grasping via Eigengrasps : A Low-dimensional Approach to a High-complexity Problem , 2007 .

[9]  Sheldon H. Jacobson,et al.  Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning , 2016, Discret. Optim..

[10]  Jun Wang,et al.  Synthesis of force-closure grasps on 3-D objects based on the Q distance , 2003, IEEE Trans. Robotics Autom..

[11]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).

[12]  Li-Yi Wei.  Parallel Poisson disk sampling , 2008, SIGGRAPH 2008.

[13]  Russ Tedrake,et al.  Global inverse kinematics via mixed-integer convex optimization , 2019, Int. J. Robotics Res..

[14]  Pieter Abbeel,et al.  Grasping and Fixturing as Submodular Coverage Problems , 2011, ISRR.

[15]  John F. Canny,et al.  Planning optimal grasps , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[16]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2011, Math. Program..

[17]  S. Popov,et al.  Experiences with Streaming Construction of SAH KD-Trees , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[18]  S. Buss.  Introduction to Inverse Kinematics with Jacobian Transpose , Pseudoinverse and Damped Least Squares methods , 2004 .

[19]  Danica Kragic,et al.  A Framework for Optimal Grasp Contact Planning , 2017, IEEE Robotics and Automation Letters.

[20]  Richard M. Murray,et al.  A Mathematical Introduction to Robotic Manipulation , 1994 .

[21]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[22]  Siddhartha S. Srinivasa,et al.  Task Space Regions , 2011, Int. J. Robotics Res..