• 한국정밀공학회지
• /
• 제17권8호
• /
• pp.189-197
• /
• 2000

This paper addresses that the autonomous mobile robot with the function of teaching a moving path by speech and avoiding a collision is developed. The use of human speech as the teaching method provides more convenient user-interface for a mobile robot. In speech recognition system a speech recognition algorithm using neural is proposed to recognize Korean syllable. For the safe navigation the autonomous mobile robot needs abilities to recognize a surrounding environment and to avoid collision with obstacles. To obtain the distance from the mobile robot to the various obstacles in surrounding environment ultrasonic sensors is used. By the navigation algorithm the robot forecasts the collision possibility with obstacles and modifies a moving path if it detects a dangerous obstacle.

• 전자공학회논문지 IE
• /
• 제47권2호
• /
• pp.66-72
• /
• 2010

자율적인 다중이동 로봇환경에서는 현시점에서 목표점까지 장애물과 충돌없이 연결하는 최적 경로를 설정하는 것은 필수불가결하며 매우 중요하다. 실제 많은 이동로봇은 주위 장애물에 대하여 주어진 정보 없이 미지의 환경에서 자율적 이동이 가능해야 한다. 따라서 본 논문에서는 다중이동 로봇환경에 적합한 새로운 형태의 충돌회피 최적경로에 대한 방법을 연구한다. 잘 알려진 포텐셜필드 방법을 이용하여 다중이동 로봇의 전역경로를 계획하고, 퍼지로직 시스템을 이용하여 각 로봇에 근접하는 혹은 경로를 가로막는 장애물과의 충돌을 피하기 위한 지역경로를 계획한다. 제안된 방법의 성능 및 정확성을 검증하기 위해 다양한 모의실험을 진행하여 결과를 검증하고 이의 결과를 토의한다.

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

Iterative algorithms for detecting the collision of convex objects whose motion is characterized by a path in configuration space are described. They use as an essential substep the computation of the distance between the two objects. When the objects are polytopes in either two or three dimensional space, an algorithm is given which terminates in a finite number of iterations. It determines either that no collision occurs or the first collision point on the path. Extensive numerical experiments for practical problems show that the computational time is short and grows only linearly in the total number of vertices of the two polytopes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2318-2320
• /
• 1998

A genetic algorithm for global and local path planning and collision avoidance of mobil robot in unstructured workspace is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.3098-3100
• /
• 1999

A genetic algorithm for global and local path planning and collision avoidance of mobile robot in dynamic working environment is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.904-907
• /
• 1996

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• 대한임베디드공학회논문지
• /
• 제13권2호
• /
• pp.65-71
• /
• 2018

In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.

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

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.519-522
• /
• 1997

In this study, the collision free path planning method of the articulated manipulator using sequential search is proposed. This method is to find the joint path of the manipulator with many degrees of freedom from the distal joint to the proximal one. To do this, the initial work space of the gantry manipulator, which is a remote maintenance equipment of the radioactive environment, is defined from the condition that the distal joint configuration is determined by the posture of maintenance. Then, 2-dimensional configuration space with the obstacle area is represented and the collision free path of manipulator is searched in the configuration space. And, this method is verified using the graphic simulation in virtual workcell for the spent fuel disassembling processes. The result of this study can be effectively used in implementing the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.74-79
• /
• 2005

In this paper, we propose a novel approach to decentralized motion planning and conflict-resolution for multiple mobile agents working in an environment with unexpected moving obstacles. Our proposed motion planner has two characteristics. One is a real-time collision prognosis based on modified collision map. Collision map is a famous centralized motion planner with low computation load, and the collision prognosis hands over these characteristics. And the collision prognosis is based on current robots status, maximum robot speeds, maximum robot accelerations, and path information produced from off-line path planning procedure, so it is applicable to motion planner for multiple agents in a dynamic environment. The other characteristic is that motion controller architecture is based on potential field method, which is capable of integrating robot guidance to the goals with collision avoidance. For the architecture, we define virtual obstacles making delay time for collision avoidance from the real-time collision prognosis. Finally the results obtained from realistic simulation of a multi-robot environment with unknown moving obstacles demonstrate safety and efficiency of the proposed method.