• International Journal of Control, Automation, and Systems
• /
• v.4 no.1
• /
• pp.77-86
• /
• 2006

A new method in robot path generation is presented using an analysis of the characteristics of multi-robot collision avoidance. The research is based on the concept of the collision map, where the collision between two robots is presented by a collision region and a crossing curve TLVSTC (traveled length versus servo time curve). Analytic collision avoidance is considered by translating the collision region in the collision map. The 4 different translations of collision regions correspond to the 4 parallel movements of the actual original robot path in the real world. This analysis is applied to path modifications where the analysis of collision characteristics is crucial and the resultant path for collision avoidance is generated. Also, the correlations between the translations of the collision region and robot paths are clarified by analyzing the collision/non-collision areas. The influence of the changes of robot velocity is investigated analytically in view of collision avoidance as an example.

• The Journal of Korea Robotics Society
• /
• v.2 no.3
• /
• pp.234-241
• /
• 2007

Effective tools which can alleviate the complexity and computational load problem in collision-free motion planning for multi-agent system have steadily been demanded in robotics field. To reduce the complexity, the extended collision map (ECM) which adopts decoupled approach and prioritization is already proposed. In ECM, the collision regions which represent the potential collision of robots are calculated using the computational power; the complexity problem is not resolved completely. In this paper, we propose a mathematical analysis of the extended collision map; as a result, we formulate the collision region as an equation with 5-8 variables. For mathematical analysis, we introduce realistic assumptions as follows; the path of each robot can be approximated to a straight line or an arc and every robot moves with uniform velocity or constant acceleration near the intersection between paths. Our result reduces the computational complexity in comparison with the previous result without losing optimality, because we use simple but exact equations of the collision regions. This result can be widely applicable to coordinated multi-agent motion planning.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.499-515
• /
• 1996

The basic function of on industrial robot system is to move objects in the workspace fast and accurately. One difficulty in performing this function is that the path of robot should be programmed to avoid the collision with obstacles, that is, tools, or facilities. This path planning requires much off-line programming time. In this study, a SOM technique to find the collision-free path of robot in real time is developed. That is, the collision-free map is obtained through SOM learning and a collision-free path is found using the map in real time during the robot operation. A learning procedure to obtain the map and an algorithm to find a short path using the map is developed and simulated. Finally, a path smoothing method to stabilize the motion of robot is suggested.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.323-326
• /
• 2006

The operation planning of multi-AUV is considered as a very difficult task. This paper proposes the qualitative method about the operation plan of multi-agents. In order to achieve this goal, it applies an extension collision map method as a tool to avoide collision between multi AUVs. This tool has been developed for the purpose of collision forecasting and collision avoidance for the multi - agents system in a land where a control is much easier. This paper analyzes the avoidance value of maximum path of AUV in order to apply this to a water environment where a tidal, a wave and disturbances are common. And it suggests the method that the maximum path avoidance can be applied to the collision avoidance on the extension collision map. Finally, the result proves that multi AUVs effectively navigates to the goal point, avoiding the collision by the suggested method.

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

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.116-121
• /
• 2001

Verification of tool collision is an important issue in die and mold machining. In this paper three functions of verification are schematically explained based on Z-Map model. The first function is getting a collision-free region when a tool assembly and a part surface model are given. The second function estimates the shortest length of cutter shank with that the tool cuts all of a region without collision. The last one is cutting simulation considering all parts of tool assembly as well as cutter blade. Those functions can be easily implemented by using several basic operators of Z-Map model which are explained also. Proposed approaches have enough accuracy to verify collision in reasonable computing time.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.2
• /
• pp.53-65
• /
• 2008

This paper proposes the qualitative method for planning the operation of multi-AUVs with environmental disturbances, which is considered to be a very difficult task. In this paper we use an extension collision map as a collision free motion planner. The tool was originally developed for the multiple ground vehicles with no internal/external disturbance. In order to apply the method to a water environment where there are tides and waves, and currents, we analyze the path deviation error of AUVs caused by external disturbances. And we calculate safety margin for the collision avoidance on the extension collision map. Finally, the simulation result proves that the suggested method in this paper make multi-AUVs navigate to the goal point effectively with no collision among them.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.796-799
• /
• 1999

In this paper, we propose an inference method for understanding intention of obstacle for collision avoidance using the grid-type map. In order to represent the environment using ultrasonic sensors, the grid-type map is first constructed. Then we detect the obstacle and infer the intention for collision avoidance using the CLA(Centroid of Largest Area) point of the grid-type map. To verify the proposed method, some experiments are performed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.7
• /
• pp.700-705
• /
• 2006

This paper proposes a collision avoidance algorithm for two mobile robots with independent goals in a same workspace. Using skeleton map, an environment is presented as a graph consisting of nodes and arcs. Robots generate the shortest set of paths using the combination of objective functions of the two robots. Path for collision avoidance of a robot can be selected among three class; the shortest path, detour, paths with a waiting time at safety points around crossing points. Simulation results are presented to verify the efficiency of the proposed algorithms.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2450-2452
• /
• 2004

Map building is essential to a mobile robot navigation system. Localization and path planning methods depend on map building strategies. A topological map is commonly constructed using the GVG(Generalized Voronoi Graph). The advantage of the GVG based topological map is compactness. But the GVG method have many difficulties because it consists of collision-free path. In this paper, we proposed an extended map building method, the AVG (Areal Voronoi Graph) based topological map. The AVG based topological map consists of collision-free area. This feature can improve map building, localization and path planning performance.