• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1651-1654
• /
• 2003

The process equipment for handling high level radioactive materials, such as spent nuclear fuel, is operated within a sealed facility, called a hot cell, due to high radioactivity. Thus, this equipment should be maintained and repaired by remotely operated manipulator. In this study, to carry out the sale and effective maintenance of the process equipment installed in the hot cell by a servo type manipulator, a collision free motion planning method of the manipulator using virtual prototyping technology is suggested. To do this, the parts are modelled in 3-D graphics, assembled, and kinematics are assigned and the virtual workcell is implemented in the graphical environment which is the same as the real environment. The method proposed in this paper is to find the optimal path of the manipulator using the function of the collision detection in the graphic simulator. The proposed path planning method and this graphic simulator of manipulator can be effectively used in designing of the maintenance processes for the hot cell equipment and enhancing the reliability of the spent fuel management.

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

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.51-60
• /
• 1997

A practically applicable collision free trajectory planning technique for tow robot systems is proposed. The robot trajectories considered in this work are composed of many segments, an at the intersection points between segments robots stop to assemble, weld, ordo other jobs by the attached a end-effectors. The proposed method is based on the Planning-Coordination Decomposition where planning is to find a trajectory of each robot independently according to their tasks and coordination is to find a velocity modification profile to avoid collision with each other. To fully utilize the independently planned trajectories and to ensure no geometrical path deviation after coordination, we develop a simple technique added the minimal delay time to avoid collision just before moving along path segments. We determine the least delay time by the graphical method in the Coordination space where collisions and coordinations are easily visualized. We classify all possible cases into 3 group and derive the optimal solution for each group.

• 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.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.2
• /
• pp.329-338
• /
• 1994

This paper presents a novel method of path planning for a quadruped walking robot on irregular terrain. In the previous study on the path planning problem of mobile robots, it has been usually focused on the collision-free path planning for wheeled robots. The path planning problem of legged roboth, however, has unique aspects from the point of viw that the legged robot can cross over the obstacles and the gait constraint should be considered in the process of planning a path. To resolve this unique problem systematically, a new concept of the artificial intensity field of light is numerically constructed over the configuration space of the robot including the transformed obstacles and a feasible path is sought in the field. Also, the efficiency of the proposed method is shown by various simulation results.

• 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 Institute of Control, Robotics and Systems
• /
• v.17 no.5
• /
• pp.405-411
• /
• 2011

This paper presents a hierarchical trajectory planning method which can handle a collision-free of the planned path in complex and dynamic environments. A PV (Path & Velocity profile) planning method minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle through detour path. The path generation problem is solved by three steps. In the first step, a smooth global path is generated using $A^*$ algorithm. The second step sets up the velocity profile for the optimization problem considering the maximum velocity and acceleration. In the third step, the velocity profile for obtaining the shortest path is optimized using the fuzzy and genetic algorithm. To show the validity and effectiveness of the proposed method, realistic simulations are performed.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1609-1614
• /
• 2003

This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. To implement the concept in collision avoidance of multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.