• 대한기계학회논문집A
• /
• 제21권12호
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• 제어로봇시스템학회논문지
• /
• 제8권11호
• /
• pp.970-975
• /
• 2002

We suggests an effective method to construct time-varying C-obstacles in the 3-dimensional configuration space (C-space) using free arc. The concept of free arc was defined mathematically and the procedure to find free arc in the case off-dimensional C-space was derived in [1]. We showed that time-varying C-obstacles can be constructed efficiently using this concept, and presented simulation results for two SCARA robot manipulators to verify the efficacy of the proposed approach. In this paper, extensions of this approach to the 3-dimensional C-space is introduced since nearly all industrial manipulators are reasonably treated ill the too or three dimensional C-space f3r collision avoidance problem The free arc concept is summarized briefly and the method to find lice arc in the 3-dimensional f-space is explained. To show that this approach enables us to solve a practical collision avoidance problem simulation results f3r two PUMA robot manipulators are presented.

• 로봇학회논문지
• /
• 제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.

• 전자공학회논문지SC
• /
• 제49권2호
• /
• pp.63-70
• /
• 2012

본 논문에서는 3차원 공동 작업 공간에서 다중 무인항공기의 협동 작업을 위한 확장 충돌 지도 기반 무 충돌 비행 계획 기법을 제안한다. 먼저 무인항공기는 회전과 같은 3차원 움직임을 고려해 구로 모델링하였다. 공동 작업 영역에 진입 후 진출할 때까지 무인 항공기는 직선 경로를 따라 이동하고 모든 무인 항공기의 우선순위는 미리 정해져 있다고 가정한다. 가정에 따라 3차원에서 정의된 구와 구 사이의 충돌 검출 문제를 2차원에서 정의된 원과 직선 사이의 충돌 검출 문제로 축소할 수 있다. 원과 직선 사이의 충돌영역은 계산의 편의성과 안전성을 위해 충돌사각형으로 근사화 하였다. 이렇게 정의된 충돌사각형을 이용하여 무인 항공기들 간의 충돌을 회피할 수 있도록 각 무인 항공기의 공동 작업 공간 진입 시간을 조율한다. 이와 같은 방법으로 모든 무인 항공기는 공동 작업 공간에 진입해서 진출할 때까지 서로 간에 충돌 없이 이동 할 수 있게 된다. 제안된 무충돌 비행 계획의 효율성을 증명하기 위해 12대의 무인 항공기를 이용한 시뮬레이션을 수행하였다.

• 한국정밀공학회지
• /
• 제19권6호
• /
• pp.35-42
• /
• 2002

Verification of tool collision Is an important issue in die and mold machining. In this paper three functions of verification for 3-axis milling machining are schematically explained. Operators of geometric models are explained at first, which will be used in the functions of verification. The first verification function is getting a collision-free region when a tool assembly and a part surface model are given. The second function estimates the shortest length of cutter shank with that the tool cuts all of a region without collision The last one is cutting simulation considering all parts of tool assembly as well as cutter blade. Proposed approaches can be easily implemented by using several basic operators of geometric model. An example to calculate collision-free region is presented also.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.649-652
• /
• 1989

In this paper we outline an approach for the collision-free trajectory planning of two robot arms which are modeled as connected line segments. A new approach to determine the collision between two robot arms and the boundary of the collision region in the coordination space is proposed. The coordination curve may then be chosen to avoid the collision region. For minimum time trajectory, time is assigned to this curve by dynamic time scaling under constraints such as maximum torque or maximum angular velocity of each actuator. A comparison of the proposed method and the graphical method of determining the collision region is also included. Finally, as an example, some simulation results for two SCARA type robots are presented.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.629-634
• /
• 1995

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is formed by a set of robot joint angles derived fromm robot inverse kinematics. The joint space that is made of the joint angle set, forms a Configuration space (Cspace). Obstacles in the robot workcell are also transformed and mapped into the Cspace, which makes Cobstacles in the Cspace. (The Cobstacles represented in the Cspace is actually the configurations of the robot causing collision.) Secondly, a connected graph, a kind of roadmap, is constructed from the free configurations in the 3 dimensional Cspace, where the configurations are randomly sampled form the free Cspace. Thirdly, robot paths are optimally in order to minimize of the sum of joint angle movements. A path searching algorithm based on A is employed in determining the paths. Finally, the whole procedures for the CFPP method are illustrated with a 3 axis articulated robot. The main characteristics of the method are; 1) it deals with CFPP for an articulated robot in a 3-dimensional workcell, 2) it guarantees finding a collision free path, if such a path exists, 3) it provides distance optimization in terms of joint angle movements. The whole procedures are implemented by C on an IBM compatible 486 PC. GL (Graphic Library) on an IRIS CAD workstation is utilized to produce fine graphic outputs.

• 한국통신학회논문지
• /
• 제33권2C호
• /
• pp.161-166
• /
• 2008

병렬 처리 구조 터보 부호에서 메모리 충돌을 피하기 위한 구성 인터리버 설계가 필요하다. 본 논문에서는 기존에 설계된 인터리버들과 라틴 방진 행렬로 구성된 충돌 방지 인터리버를 제안한다. 제안된 인터리버는 다양한 블록 길이와 다양한 병렬 처리 차수에 대하여 쉽게 최적화 할 수 있다. 제안된 인터리버의 성능을 컴퓨터 모의실험을 통해 검증하였다.

• 한국자동차공학회논문집
• /
• 제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.

• 한국항행학회논문지
• /
• 제19권5호
• /
• pp.379-388
• /
• 2015

1990년대 말 미국에서는 미래 자유비행 기술개발 및 시험을 추진하였고, 이에 국내에서도 2017년까지 자유비행을 실현 할 계획을 수립하였다. 자유비행 실현을 위해서는 항공기 간 충돌의 예방을 위해 항공기 분리보증 (separation assurance)이 필수적이다. 현대 대형 민간항공기는 분리보증을 위해 충돌회피장치(TCAS; traffic collision avoidance system) 운영 및 회피 기동 규칙이 있지만 경량항공기는 비용과 공간 문제로 TCAS를 적용하기 어렵기 때문에 이에 대한 대안이 필요하다. 이에 본 논문에서는 저비용으로 경량화 및 소형화되어 구성된 ADS-B 환경 하를 가정하여 소형항공기에 적합하도록 수정하였고 LABVIEW 프로그램으로 시뮬레이션하여 시험해보았다. 시뮬레이션은 국제항공민간기구에서 제시한 항공기 충돌상황에 대하여 수행하였고, 그 결과 TCAS 기준에 따라 경보발령을 100% 수행하였음을 확인하였다.