• 제어로봇시스템학회논문지
• /
• 제6권3호
• /
• pp.317-328
• /
• 2000

This paper presents an effective approach to collision-free motion planning of a robot in the work-space including time-varying obstacles. The free arc is defined as a set composed of the configuration points of the robot satisfying collision-free motion constraint at each sampling time. We represent this free arc with respect to the new coordinate frame centered at the goal configuration and there for the collision-free path satisfying motion constraint is obtained by connecting the configuration points of the free arc at each sampling mined from the sequence of free arcs the optimality is determined by the performance index. Therefore the complicated collision-free motion planning problem of a robot is transformed to a simplified SUB_Optimal Collision Avoidance Problem(SOCAP). We analyze the completeness of the proposed approach and show that it is partly guaranteed using the backward motion. Computational complexity of our approach is analyzed theoretically and practical computation time is compared with that of the other method. Simulation results for two cally and practical computation time is compared with that of the other method. Simulation results for two SCARA robot manipulators are presented to verify the efficacy of the proposed method.

• 대한전기학회논문지
• /
• 제37권8호
• /
• pp.563-569
• /
• 1988

본 논문에서는 공통의 작업장에서 운용되는 두 개의 매니퓰레이터의 충돌회피를 위한 속도변형 방법들이 연구된다. 두 매니퓰레이터의 상호충돌시 현저한 특성으로 인한 여러 종류의 새로운 충돌양상이 연구되며 무충돌 운용을 계획하는데 사용된다. 충돌지도와 속도변형의 개념들이 무충돌 운용을 계{획하기 위해 개발 적용된다. 한가지 예가 궤적의 속도 가감을 보이기 위해 예시도었으며, 이 예는 움직이는 두 로보트 매니퓰레이터의 무충돌 궤도 계획을 위한 제안된 방법들의 유용성을 보여준다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.990-995
• /
• 1990

A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.234-241
• /
• 2007

Effective tools which can alleviate the complexity and computational load problem in collision-free motion planning for multi-agent system have steadily been demanded in robotics field. To reduce the complexity, the extended collision map (ECM) which adopts decoupled approach and prioritization is already proposed. In ECM, the collision regions which represent the potential collision of robots are calculated using the computational power; the complexity problem is not resolved completely. In this paper, we propose a mathematical analysis of the extended collision map; as a result, we formulate the collision region as an equation with 5-8 variables. For mathematical analysis, we introduce realistic assumptions as follows; the path of each robot can be approximated to a straight line or an arc and every robot moves with uniform velocity or constant acceleration near the intersection between paths. Our result reduces the computational complexity in comparison with the previous result without losing optimality, because we use simple but exact equations of the collision regions. This result can be widely applicable to coordinated multi-agent motion planning.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.996-1003
• /
• 1990

We present algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, we represent the global topological structure of collision-free space. Using the C-space obstacle boundaries and this connectivity graph we generate exact (non-heuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles. The gross motion planning algorithm is further extended (though using approximations) to the case of objects moving with both translational and rotational degrees of freedom by taking slices of the overall orientations into finite segments.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1609-1614
• /
• 2003

This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. To implement the concept in collision avoidance of multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1770-1781
• /
• 1989

Two robots working in a common workspace may collide with each other. In this paper, a collision-free motion planning algorithm using view time concept is proposed to detect and avoid collision before robot motion. Collision may occur not only at the robot end effector but also at robot links. To detect and avoid potential collisions, the trajectory of the first robot is sampled periodically at every view time and the region in Cartesian space swept by the first robot is viewed as an obstacle during a single sampling period. The forbidden region in the joint constraint map (JCM). The JCM's are obtained in this way at every view time. An algorithm is established for collision-free motion planning of the two robot system from the sequence of JCM's and it is verified by simulations.

• Journal of Mechanical Science and Technology
• /
• 제18권1호
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.545-550
• /
• 1991

Recently, the use of robots for painting operations has received much attention, as it is a powerful means for automation and quality improvement. Collision-avoidance is a key issue in the path planning for painting operations. In this paper, we develop a computationally efficient algorithm for the generation of collision-free path for two types of motion: a) Gross motion when the robot approaches the painting area, and b) Fine motion while spraying the surface. The former is a typical collision-avoidance problem, but the latter calls for special attention as the painting mechanics has to be incorporated into path planning. The developed algorithm is applied for the internal coating of the car body whose structure is the major source of collision.

• 한국자동차공학회논문집
• /
• 제2권6호
• /
• pp.57-65
• /
• 1994

A collision-free path planning algorithm between an articulated robot and polyhedral obstacles using configuration space is presented. In configuration space, a robot is treated as a point and obstacles are treated as grown forbidden regions. Hence path planning problem is transformed into moving a point from start position to goal position without entering forbidden regions. For mapping to 3D joint space, slice projection method is used for first revolute joint and inverse kinematics is used for second and third revolute joint considering kinematic characteristics of industrial robot. Also, three projected 2D joint spaces are used in search of collision-free path. A proper example is provided to illustrate the proposed algorithm.