New Techniques for Computing Four-Finger-Force-Closure Grasps of Polyhedral Objects
نویسندگان
چکیده
It was shown in 12] that four-nger force-closure grasps fall into three categories: concurrent, pencil, and regulus grasps. We propose new techniques for computing these three types of grasps. We have implemented them and present examples.
منابع مشابه
On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects
This paper addresses the problem of computing stable grasps of three dimensional poly hedral objects We consider the case of a hand equipped with four hard ngers and assume point contact with friction We prove new necessary and su cient conditions for equilibrium and force closure and present a geometric characterization of all possible types of four nger equilibrium grasps We then focus on con...
متن کاملStochastic optimization-based approach for multifingered grasps synthesis
In this paper, we propose an approach for computing suboptimal grasps of polyhedral objects. Assuming n hard-finger contact with Coulomb friction model and based on central axes of the grasp wrench, we develop a new necessary and sufficient condition for n-finger grasps to achieve force-closure property. Accordingly, we reformulate the proposed force-closure test as a new linear programming pro...
متن کاملOn computing three-finger force-closure grasps of 2-D and 3-D objects
In this paper, we present a novel algorithm for computing three-finger force-closure grasps of two-dimensional (2-D) and three-dimensional (3-D) objects. In the case of a robot hand with three hard fingers and point contact with friction, new necessary and sufficient conditions for 2-D and 3-D equilibrium and force-closure grasps have been deduced, and a corresponding algorithm for computing fo...
متن کاملA new algorithm for three-finger force-closure grasp of polygonal objects
Abstract—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal objects in this article. The algorithm is quite simple and only needs some algebraic calculations. An easily computable measure of how far a grasp is from losing forceclosure is provided as well. Finally, we imple...
متن کامل