• 대한기계학회논문집A
• /
• 제20권10호
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.564-568
• /
• 1992

A neural optimization network is designed to solve the collsion-free inverse kinematics problem for redundant robot manipulators under the constraints of joint limits, maximum velocities and maximum accelerations. And the fuzzy rules are proposed to determine the weightings of neural optimization networks to avoid the collision between robot manipulator and obstacles. The inputs of fuzzy rules are the resultant distance, change of the distance and sum of the changes. And the output of fuzzy rules is defined as the capability of collision avoidance of joint differential motion. The weightings of neural optimization networks are adjusted according to the capability of collision avoidance of each joint. To show the validities of the proposed method computer simulation results are illustrated for the redundant robot with three degrees of freedom,

• 대한기계학회논문집
• /
• 제15권1호
• /
• pp.69-77
• /
• 1991

본 연구에서는 주로 약결합된 경우의 다로봇시스템에 대한 효과적인 운동조정 법을 개발하였다. 약결합된 경우의 다로봇시스템은 아크용접, 분사 도료, 금속면의 디버링, 복잡한 조립작업, 검사등 수많은 작업에 투입될 수 있다.그와 같은 작업들 은 대부분 연적경로제어(continuous path control)방법을 요구하고 있는데 다로봇시스 템인 경우 작업대 주위의 정지 혹은 이동 장애물이나 제로봇상호간의 충격포험성을 해 결할 수 있는 효과적인 장애물회피 능력을 추가적으로 요구하고 있다. 그리고 연적 경로제어 형태의 거의 대부분의 첨단부의 속도를 정속도로 유지해주어야만 한다. 따 라서 모든 로봇들을 지정된 경로의 이탈없이 가능한 최대등속도로 운동시키기 위한 다 로봇시스템의 충격회피운동제어 알고리즘을 개발하게되었다.

• 한국콘텐츠학회논문지
• /
• 제16권11호
• /
• pp.83-90
• /
• 2016

본 논문에서는 저전력 통신 기술인 IEEE 802.15.4 MAC (Media Access Control) 프로토콜에서 지원하는 Collision Free Period(CFP)에서의 전송 성능 분석을 수행한다. 분석을 위해 CFP의 서비스 타겟인 주기적 트래픽을 고려하고 Quality of Service 요구사항에 따라 MAC 계층에 전달되는 패킷전달 형태를 batch와 non-batch로 구분하여 throughput, delay, energy 측면에서 성능을 분석한다. 도출된 분석 결과를 토대로 Pedometer, ECG, EMG와 같이 주기적인 트래픽을 생성하는 헬스케어 애플리케이션에 대해 Collision Avoidance Period(CAP)에서의 전송과 성능 비교를 수행한다. 성능 평가를 통해 헬스케어와 같이 주기적이며 time-critical 트래픽을 생성하는 애플리케이션은 CFP 전송이 에너지 효율적이며 대역폭 요구 사항이 큰 애플리케이션에서는 CAP 대비 최대 46%의 에너지가 절감됨을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1991년도 추계학술대회 논문집 학회본부
• /
• pp.409-411
• /
• 1991

This paper presents a collision avoidance scheme for redundant robot manipulators based on the Configuration Control Scheme. We set a center line through the free space. And we use the redundancy to put the robot links, around the center line as close as possible to avoid the collision with obstacles. Computer simulation shows the effectiveness of this approach.

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

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. The avoidability measure figures the degree of how easily a robot can avoid other robots considering the velocity of the robots. To implement the concept to avoid collision among 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. These repulsive force and attractive force are added to form the driving force for robot motion. 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. In contrast, since the usual potential field method initiates avoidance motion later than the proposed method, it sometimes fails preventing collision or causes hasty motion to avoid 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.945-949
• /
• 1988

In this paper, collision avoidance of two robots working in a common workspace is described. The workspace for a two robot system is defined and classified. JCM (Joint Constraint Map) is designed which shows the region of joint values that must be avoided for collision free motion, and application of the JCM is studied.

• International Journal of Control, Automation, and Systems
• /
• 제5권6호
• /
• pp.674-680
• /
• 2007

The probabilistic roadmap (PRM) method, which is a popular path planning scheme, for a manipulator, can find a collision-free path by connecting the start and goal poses through a roadmap constructed by drawing random nodes in the free configuration space. PRM exhibits robust performance for static environments, but its performance is poor for dynamic environments. On the other hand, reinforcement learning, a behavior-based control technique, can deal with uncertainties in the environment. The reinforcement learning agent can establish a policy that maximizes the sum of rewards by selecting the optimal actions in any state through iterative interactions with the environment. In this paper, we propose efficient real-time path planning by combining PRM and reinforcement learning to deal with uncertain dynamic environments and similar environments. A series of experiments demonstrate that the proposed hybrid path planner can generate a collision-free path even for dynamic environments in which objects block the pre-planned global path. It is also shown that the hybrid path planner can adapt to the similar, previously learned environments without significant additional learning.

• 제어로봇시스템학회논문지
• /
• 제20권2호
• /
• pp.211-217
• /
• 2014

This paper addresses an algorithm of path planning for autonomous driving of a ground vehicle in waypoint navigation. The proposed algorithm is flexible in utilization under a large GPS positioning error and generates collision-free multiple paths while pursuing minimum traveling time. An optimal path reduces inefficient steering by minimizing lateral changes in generated waypoints along a path. Simulation results compare the proposed algorithm with the A* algorithm by manipulation of the steering wheel and traveling time, and show that the proposed algorithm realizes real-time obstacle avoidance by quick processing of path generation, and minimum time traveling by producing paths with small lateral changes while overcoming the very irregular positioning error from the GPS.