• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1246-1249
• /
• 1993

In this paper, we propose an algorithm of obstacle avoidance using fuzzy inferences. After the basic idea of the path generation algorithm using piecewise polynomials is described, the obstacle avoidance problem using fuzzy inferences is considered. Main concept of the avoidance algorithm is to modify intermittent point data using fuzzy inferences and to generate the collision free path based on the modified data. Finally, simulation result demonstrate the effectiveness of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1939-1943
• /
• 1991

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 shortest 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 of this paper, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy[3] and a traveling salesman problem strategy(TSP)[23]. 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 Neural 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 proposed to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm[21] and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm[5].

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.327-330
• /
• 1995

If a mobile robot is used in a real situation, robot must face a moving obstacles. In that case, the collision avoidance algorithm for moving obstacle is a indispensible element in mobile robot control. We csrried out a research to find and evaluate the advanced algorithm for mobile robot. At first we generate the continous path for mobi;e robot. Then by creating a curved path for avoidance, the mobile robot can change its path smoothly. Smoothed path made the robot adapt more effectively to the changing of path. Under time-varying condition, computer simulation was performed to show the validation of proposed algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.6
• /
• pp.535-542
• /
• 2011

The Global Navigation Satellite System(GNSS) is being utilized in numerous applications. The research for autonomous guided vehicles(AGVs) using precise positioning of GNSS is in progress. GNSS based AGVs is useful for setting driving path. This AGV system is more efficient than the previous one. Escipecially, the obstacle is positioned the driving path. Previcious AGVs which follow marker or wires laid out on the road have to stop the front of obstacle. But GNSS based AGVS can continuously drive using obstacle avoidance. In this paper, we developed collision avoidance system for GNSS based AGV using laser scanner and collision avoidance path setting algorithm. And we analyzed the developed system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.475-475
• /
• 2000

This paper describes the construction of an autonomous mobile robot with functions of collision avoidance and speech recognition that is used for teaching path of the robot. The human voice as a teaching method provides more convenient user-interface to mobile robot. For safe navigation, the autonomous mobile robot needs abilities to recognize surrounding environment and avoid collision. We use u1trasonic sensors to obtain the distance from the mobile robot to the various obstacles. By navigation algorithm, the robot forecasts the possibility of collision with obstacles and modifies a path if it detects dangerous obstacles. For these functions, the robot system is composed of four separated control modules, which are a speech recognition module, a servo motor control module, an ultrasonic sensor module, and a main control module. These modules are integrated by CAN(controller area network) in order to provide real-time communication.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.4
• /
• pp.27-35
• /
• 1998

Navigation is a method to direct a mobile robot without collision when traversing the environment. This is to reach a destination without getting lost. In this paper, global and local path planning in fixed obstacle and moving obstacle using genetic algorithm are presented. First, mobile robot searches optimal global path using genetic algorithm without falling into local minima. Then if it finds a unknown obstacle, it searches new path without crashing obstacle. Also if there is a moving obstacle, mobile robot searches new optimal path without colliding with the obstacles. Various simulation results show the proposed algorithm can search a shortest path effectively.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.2
• /
• pp.213-221
• /
• 2009

An aircraft collision accident is a disaster that causes great losses of inventories and lives. Though a collision avoidance warning function is provided automatically to pilots in the aircrafts by the enhancement of the aircraft capability, achieving fast decision-making to escape a collision situation is a complex and dangerous work for pilots. If an in-flight collision situation is controlled by the air traffic control system which monitors all airplanes in the air, it would be more efficient to prevent in-flight collisions because it can handle the emergency before the pilot's action. In this paper, we develop the collision avoidance warning function in the air traffic control system. Specifically, we design and implement the five stages of the collision avoidance function, and propose a visualization method which could effectively provide the operators with the trajectories and altitudes of the aircrafts in a collision situation. By developing an in-flight collision warning function in the air traffic control system that visualizes flight patterns through the state transition data of in-flight aircrafts on the flight path lines, it can effectively prevent in-flight collisions with traffic alerts. The developed function allows operators to effectively select and control the aircraft in a collision situation by providing the operators with the expected collision time, the relative distance, and the relative altitude while assessing the level of alert, and visualizing the alert information which includes the Attention-Warning-Alert phase via embodying the TCAS standard. With the developed function the air traffic control system could sense an in-flight collision situation before the pilot's decision-making moment.

• 전자공학회논문지 IE
• /
• v.47 no.2
• /
• pp.66-72
• /
• 2010

In an autonomous multi-mobile robot environment, optimal path planning without collision which connects the beginning and ending point is essential and primary important. Many mobile robots should move autonomously without prior or given information about obstacles which are stationary or dynamic. Collision free optimal path planning for multi mobile robots is proposed in this paper. The proposed approach is based on a potential field method and fuzzy logic system. First, a global path planner using potential field method selects the shortest path from each robot to its own target. Then, a local path planner modifies the path and orientation from the global planner to avoid collisions with static and dynamic obstacles using a fuzzy logic system. To verify performance of this method, several simulation-based experimental are done and their results are discussed. These results show that the path planning and collision avoidance strategies are effective and useful for multi-mobile robot systems.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.3
• /
• pp.241-249
• /
• 2014

This paper presents a path planning algorithm of an autonomous vehicle (ADAM III) for collision avoidance in the presence of multiple obstacles. Under the requirements that a low-cost GPS is used and its computation should be completed with a sampling time of sub-second, heading angle estimation is proposed to improve performance degradation of its measurement and a hierarchical structure for path planning is used. Once it is decided that obstacle avoidance is necessary, the path planning consists in three steps: waypoint generation, trajectory candidate generation, and trajectory selection. While the waypoints and the corresponding trajectory candidates are generated based on position of obstacles, the final desired trajectory is determined with considerations of kinematic constraints as well as an optimal condition in a term of lateral deviation. Finally the proposed algorithm was validated experimentally through field tests and its demonstration was performed in Autonomous Vehicle Competition (AVC) 2013.