• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.879-888
• /
• 2013

This paper addresses the vision based local path planning system for obstacle avoidance. To handle the obstacles which exist beyond the field of view (FOV), we propose a Panoramic Environment Map (PEM) using the MDGHM-SIFT algorithm. Moreover, we propose a Complexity Measure (CM) and Fuzzy logic-based Avoidance Motion Selection (FAMS) system to enable a humanoid robot to automatically decide its own direction and walking motion when avoiding an obstacle. The CM provides automation in deciding the direction of avoidance, whereas the FAMS system chooses the avoidance path and walking motion, based on environment conditions such as the size of the obstacle and the available space around it. The proposed system was applied to a humanoid robot that we designed. The results of the experiment show that the proposed method can be effectively applied to decide the avoidance direction and the walking motion of a humanoid robot.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.151-155
• /
• 1996

In this paper, the continuous motion of a quadrupedal walking machine was studied. The motion planning which is able a walking machine body to precisely follow a three-dimensional curve was developed. A three-dimensional curve was designed based on Bezier curve and obstacle avoidance considerations. Due to the arbitrary motion direction during walking, special strategies of gaits were developed to ensure positive stability. The gait strategies were based on wave and wave-crab gait.

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

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.