OCOG: A common grasp computation algorithm for a set of planar objects Academic Article uri icon


  • This paper addresses the problem of defining a simple End-Effector design for a robotic arm that is able to grasp a given set of planar objects. The OCOG (Objects COmmon Grasp search) algorithm proposed in this paper searches for a common grasp over the set of objects mapping all possible grasps for each object that satisfy force closure and quality criteria by taking into account the external wrenches (forces and torque) applied to the object. The mapped grasps are represented by feature vectors in a high-dimensional space. This feature vector describes the design of the gripper. A database is generated for all possible grasps for each object in the feature vector space. A search algorithm is then used for intersecting all possible grasps over all parts and finding a common grasp suitable for all objects. The search algorithm utilizes the kd-tree index structure for representing the database of the sets of feature vectors. The kd-tree structure enables an efficient and low cost nearest-neighbor search for common vectors between the sets. Each common vector found (feature vector) is the grasp configuration for a group of objects, which implies the future end-effector design. The final step classifies the grasps found to subsets of the objects, according to the common vectors found. Simulations and experiments are presented for four objects to validate the feasibility of the proposed algorithm. The algorithm will be useful for standardization of end-effector design and reducing its engineering time.

publication date

  • January 1, 2014