Searching force-closure optimal grasps of articulated 2D objects with n links

This paper proposes a method that finds a locally optimal grasp of an articulated 2D object with n links considering frictionless contacts. The surface of each link of the object is represented by a finite set of points, thus it may have any shape. The proposed approach finds, first, an initial force-closure grasp and from it starts an iterative search of a local optimum grasp. The quality measure considered in this work is the largest perturbation wrench that a grasp can resist with independence of the direction of the perturbation. The approach has been implemented and some illustrative examples are included in the article.Postprint (published version

Frictionless grasp with 7 fingers on discretized 3D objects

This paper presents an algorithm to plain locally frictionless grasp on 3D objects. The objects can be of any arbitrary shape, since the surface is discretized in a cloud of points. The planning algorithm finds an initial force-closure grasp that is iteratively improved through an oriented search procedure. The grasp quality is measured with the “largest ball” criterion, and a force-closure test based on geometric considerations is used. The efficiency of the algorithm is illustrated through numerical example

Independent contact regions for discretized 3D objects with frictionless contacts

This paper deals with the problem of determining independent contact regions on a 3D object boundary such that a seven finger frictionless grasp with a contact point in each region assures a force-closure grasp on the object, independently of the exact position of the contact points. These regions provide robustness in front of finger positioning errors in grasp and fixturing applications. The object’s structure is discretized in a cloud of points, so the procedure is applicable to objects of any arbitrary shape. The procedure finds an initial form-closure grasp that is iteratively improved through an oriented search procedure: once a locally optimum grasp has been reached, the independent contact regions are computed. The procedure has been implemented, and application examples are included in the paper

Computation of independent contact regions for grasping 3-D objects

Precision grasp synthesis has received a lot of attention in past few last years. However, real mechanical hands can hardly assure that the fingers will precisely touch the object at the computed contact points. The concept of independent contact regions (ICRs) was introduced to provide robustness to finger positioning errors during an object grasping: A finger contact anywhere inside each of these regions assures a force-closure grasp, despite the exact contact position. This paper presents an efficient algorithm to compute ICRs with any number of frictionless or frictional contacts on the surface of any 3-D object. The proposed approach generates the independent regions by growing them around the contact points of a given starting grasp. A two-phase approach is provided to find a locally optimal force-closure grasp that serves as the starting grasp, considering as grasp quality measure the largest perturbation wrench that the grasp can resist, independently of the perturbation direction. The proposed method can also be applied to compute ICRs when several contacts are fixed beforehand. The approach has been implemented, and application examples are included to illustrate its performance.Peer Reviewe

Multifingered grasping for robotic manipulation

Robotic hand increases the adaptability of grasping and manipulating objects with its system.But this added adaptability of grasping convolute the process of grasping the object. The analysis of the grasp is very much complicated and large number of configuration for grasping is to be investigated. Handling of objects with irregular shapes and that of flexible/soft objects by ordinary robot grippers is difficult. It is required that various objects with different shapes or sizes could be grasped and manipulated by one robot hand mechanism for the sake of factory automation and labour saving. Dexterous grippers will be the appropriate solution to such problems. Corresponding to such needs, the present work is towards the design and development of an articulated mechanical hand with five fingers and twenty five degrees-of-freedom having an improved grasp capability. In the work, the distance between the Thumb and Finger and the workspace generated by the hand is calculated so as to know about the size and shape of the object that could be grasped.Further the Force applied by the Fingers and there point of application is also being calculated so as to have a stable force closure grasp. The method introduced in present study reduces the complexity and computational burden of grasp synthesis by examining grasps at the finger level. A detailed study on the force closure grasping capability and quality has been carried out. The workspace of the five fingered hand has been used as the maximum spatial envelope. The problem has been considered with positive grips constructed as non-negative linear combinations of primitive and pure wrenches. The attention has been restricted to systems of wrenches generated by the hand fingers assuming Coulomb friction. In order to validate the algorithm vis-a-vis the designed five fingered dexterous hand, example problems have been solved with multiple sets of contact points on various shaped objects.Since the designed hand is capable of enveloping and grasping an object mechanically, it can be used conveniently and widely in manufacturing automation and for medical rehabilitation purpose. This work presents the kinematic design and the grasping analysis of such a hand

Parallelizing RRT on large-scale distributed-memory architectures

This paper addresses the problem of parallelizing the Rapidly-exploring Random Tree (RRT) algorithm on large-scale distributed-memory architectures, using the Message Passing Interface. We compare three parallel versions of RRT based on classical parallelization schemes. We evaluate them on different motion planning problems and analyze the various factors influencing their performance