• 제어로봇시스템학회논문지
• /
• 제6권11호
• /
• pp.1003-1012
• /
• 2000

When a robot hand grasp an object, the number of ways to grasp it stably are infinite and thus an optimal grasp planning is needed to find the optimal grasp points for satisfying the objective of the given task. In this paper, we first define some grasp indices to evaluate the quality of each feasible grasp and then a weighted composite grasp index by combining all of the grasp indices is also defined. Next, we propose a method to find the optimal grasp points of the given object by comparing the defined weighted composite grasp index for each feasible grasp points. By simulation results, we show the effectiveness of the proposed optimal grasp planning method and also discuss the trend of each grasp index as the grasp polygon.

• 로봇학회논문지
• /
• 제3권2호
• /
• pp.123-130
• /
• 2008

In this paper, we present a grasp planning method using grasp taxonomy and object primitives. Our grasp taxonomy includes newly defined grasp methods such as thumb supported pinch and palm supported pinch, to enhance grasp robustness. On the target surface, locations of finger-print that will be contacted by the robot fingers are sampled. The sampling is made to be consistent to the grasp taxonomy, called preformed grasps, matched to the target object. We perform simulations to examine the validity and the efficacy of the proposed grasp planning method.

• 제어로봇시스템학회논문지
• /
• 제12권11호
• /
• pp.1102-1110
• /
• 2006

This paper addresses the problem of computing grasp stability of the object for two-fingered robots in two dimensions. The concepts of force-closure and dual space are introduced and discussed in novel point of view, and we transform friction cones in a robot work space to line segments in a dual space. We newly define a grasp stability index by calculating intersection condition between line segments in dual space. Moreover, we propose a method to find the optimal grasp points of the given object by comparing the defined grasp stability index. Its validity and effectiveness are investigated and verified by simulations for quadrangle object and elliptic objects.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.462-465
• /
• 2002

This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

• 한국정밀공학회지
• /
• 제19권11호
• /
• pp.54-64
• /
• 2002

This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has mainly analyzed with either unknown objects 2-dimensionally by vision sensor or known objects, such as cylindrical objects, 3-dimensionally. As extending the previous work, in this study we propose an algorithm to analyze grasp of unknown objects 3-dimensionally by using vision sensor. This is archived by two steps. The first step is to make a 3-dimensional geometrical model for unknown objects by using stereo matching. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand which has the characteristic of multi-finger hand and is easy to model. To find the optimal grasping points, genetic algorithm is employed and objective function minimizes the admissible force of finger tip applied to the objects. The algorithm is verified by computer simulation by which optimal grasping points of known objects with different angle are checked.

• 대한기계학회논문집A
• /
• 제24권4호
• /
• pp.848-857
• /
• 2000

A pick-and-place operation in 3-dimensional environment is basic operation for human and multi-purpose manipulators. However, there may be a difficult problem for such manipulators. Especially, if the object cannot be moved with a single grasp, regrasping, which can be a time-consuming process, should be carried out. Regrasping, given initial and final pose of the target object, is a construction of sequential transition of object poses that are compatible with two poses in the point of grasp configuration. This paper presents a novel approach for solving regrasp problem. The approach consists of a preprocessing and a planning stage. Preprocessing, which is done only once for a given robot, generates a look-up table which has information of kinematically feasible task space of end-effector through all the workspace. Then, using the table planning automatically determines possible intermediate location, pose and regrasp sequence leading from the pick-up to put-down grasp. Experiments show that the presented is complete in the total workspace. The regrasp planner was combined with existing path.

• 대한기계학회논문집A
• /
• 제27권7호
• /
• pp.1110-1119
• /
• 2003

This paper deals with the synthesis of the 3-dimensional grasp planning for unknown objects. Previous studies have many problems, which the estimation time for finding the grasping points is much long and the analysis used the not-perfect 3-dimensional modeling. To overcome these limitations in this paper new algorithm is proposed, which algorithm is achieved by two steps. First step is to find the whole 3-dimensional geometrical modeling for unknown objects by using stereo matching. Second step is to find the optimal grasping points for unknown objects by using the neural network trained by the result of optimization using genetic algorithm. The algorithm is verified by computer simulation, comparing the result between neural network and optimization.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.29-39
• /
• 2009

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

• 한국정밀공학회지
• /
• 제14권4호
• /
• pp.126-135
• /
• 1997

A sensorless motion planner which succeeds in grasping a polygonal part firmly into a desired orientation has been developed through the dynamic analysis. The analytical results on the impact process with friction are used for modeling the contact motionduring the parallel-jaw grasp operation, which is com- posed of the pushing and the squeezing process. The developed planner succeeds in grasping a part into a specified orientation in the face of uncertainties of initial position and orientation of the part, motion direction of the finger, and the physical parameters such as the coefficients of friction and restitution. The motion planner has been fully implemented into a viable package on the computer system, and verified experimentally. The motion of parts is recorded using a high-speed video camera, and then compared to the results of the planner and the graphic simulation results that illustrate the simulated motion of the grasp operation.

• 제어로봇시스템학회논문지
• /
• 제6권5호
• /
• pp.404-414
• /
• 2000

This paper addresses the development of a 3-fingered humanoid robot hand system and a real-time grasp synthesis of multifingered robot hands to find grasp configurations which satisfy the force closure condition of arbitrary shaped objects. We propose a fast and efficient grasp synthesis algorithm for planar polygonal objects, which yields the contact locations on a given polygonal object to obtain a force closure grasp by the multifingered robot hand. For an optimum grasp and real-time computation, we develop the preference and the hibernation process and assign physical constraints of the humanoid hand to the motion of each finger. The preferences consist of each sublayer reflecting the primitive preference similar to the conditional behaviors of humans for given objectives and their arrangements are adjusted by the heuristics inspired from human's grasping behaviors. The proposed method reduces the computational time significantly at the sacrifice of global optimality, and enables the grasp posture to be changable within two-finger and three-finger grasps. The performance of the presented algorithm is evaluated via simulation studies to obtain the force-closure grasps of polygonal objects with fingertip grasps. The architecture suggested is verified through experimental implementation to our robot hand system by solving the 2- or 3-finger grasp synthesis.