• 한국산업융합학회 논문집
• /
• 제21권2호
• /
• pp.95-101
• /
• 2018

This paper presents a collision free mobile robot navigation based on the fuzzy inference fusion model in unkonown environments using multi-ultrasonic sensor. Six ultrasonic sensors are used for the collision avoidance approach where CCD camera sensors is used for the trajectory following approach. The fuzzy system is composed of three inputs which are the six distance sensors and the camera, two outputs which are the left and right velocities of the mobile robot's wheels, and three cost functions for the robot's movement, direction, obstacle avoidance, and rotation. For the evaluation of the proposed algorithm, we performed real experiments with mobile robot with ultrasonic sensors. The results show that the proposed algorithm is apt to identify obstacles in unknown environments to guide the robot to the goal location safely.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.461-468
• /
• 1997

A real-time collision-free trajectory control method for dual arm robot system is proposed. The proposed method is composed of two stages; one is to calculate the minimum distance between two robot arms and the other is to control the trajectories of the robots to ensure collision-free motions. The calculation of minimum distance between two robots is, also, composed of two steps. To reduce the calculation time, we, first, apply a simple modeling technique to the robots arms and determine the interested part of the robot arms. Next, we apply more precise modeling techniques for the part to calculate the minimum distance. Simulation results show that the whole algorithm runs within 0.05 second using Pentium 100MHz PC.

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

A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also the operating time is near-minimal.

• 수산해양기술연구
• /
• 제32권3호
• /
• pp.321-328
• /
• 1996

This paper presents a robot simulator which can automatically generate a smooth collision free path. This simulator has the characterstisc of the object - oriented programming which is coded in Borland C+ +. Using General Inverse Algorithm, the inverse kinematics solutions of any kind of robots can be found generally. This simulator also uses Bezier Functions for the description of a smooth collision - free path. In addition, GUI(Graphic User Interface)technique is employed for user's convenience.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1496-1499
• /
• 2004

In this paper, we deal with a novel path planning algorithm to find collision-free path for a moving robot to find an appropriate path from initial position to goal position. The robot should make progress by avoiding obstacles located at unknown position. Such problem is called the path planning. We propose so called the subgoal generation algorithm to find an effective collision-free path. The generation and selection of the subgoal are the key point of this algorithm. Several subgoals, if necessary, are generated by analyzing the map information. The subgoal is the candidate for the final path to be pass through. Then selection algorithm is executed to choose appropriate subgoal to construct a correct path. Deep and through explanations are given for the proposed algorithm. Simulation example is given to show the effectiveness of the proposed algorithm.

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

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

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

• 로봇학회논문지
• /
• 제15권2호
• /
• pp.100-106
• /
• 2020

In the agricultural field, interests in research using robots for fruit harvesting are continuously increasing. Dual arm manipulators are promising because of its abilities like task-distribution and role-sharing. To operate it efficiently, the task sequence must be planned adequately. In our previous study, a collision-free path planning method based on a genetic algorithm is proposed for dual arm manipulators doing tasks cooperatively. However, in order to simplify the complicated collision-check problem, the movement between tasks of two robots should be synchronized, and thus there is a problem that the robots must wait and resume their movement. In this paper, we propose a heuristic algorithm that can reduce the total time of the optimal solution obtained by using the previously proposed genetic algorithm. It iteratively desynchronizes the task sequence of two robots and reduces the waiting time. For evaluation, the proposed algorithm is applied to the same work as the previous study. As a result, we can obtain a faster solution having 22.57 s than that of the previous study having 24.081 s. It will be further studied to apply the proposed algorithm to the fruit harvesting.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

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