• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.7
• /
• pp.1-10
• /
• 1996

There are many challenging problems in mobile robot navigation. As an example, a mobile robot may wander around in local minimum and may wiggle when it moves through a narrow corridor. In addition, the real time obstacle avoidance and the posture control of mobile robot are also very improtant problems. To address these problems, a navigation algorithm which is composed o freal time obstacle avoidance algorithm and a global path planner (GPP) that genrates the shortest path is presented. In this paper, the global path planner reduce the calculation time by reducing the dta to be handled. Also it can make a real time obstacle avoidance by using the fuzzy logic inference. So the presented algorithm provide a stable navigastion for the mobile robot when it fall into the unstable navigation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.4
• /
• pp.319-325
• /
• 2001

Recently. AGV systems are used to serve the raw material to each work stations automatically. There exists a trade-off between the adequate service supply and the number of purchased AGVs. Also, to reduce the overall production cost, the amount of inventory hold on the shop floor should be considered. In this paper, we present a heuristic technique for determining the number of AGVs which includes the net present fixed costs of each station, each purchased AGV, delivering cost, stock inventory cost, and safety stock inventory cost. Secondly, by using a genetic algorithm, the optimal number of AGVs and the optimal reorder quantity at each station are decided. Lastly, to verify then heuristic algorithm, we have done a computer simulation with different GA parameters.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.58-62
• /
• 1987

In this paper, path planning, modelling, and control of manipulators are described. The path planning deals with specifying how to define the motion of hand along straight line paths in the minimum amount of time. A new model was developed for the manipulator, which is based on the classical equations of motion of a rigid body. A new control algorithm was developed which controls the manipulator in terms of the position and orientation of the hand.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.2
• /
• pp.1-8
• /
• 2011

5-axis NC machining has a good advantage of the accessibility of tool motion by adding two rotary axes. It offers numerous advantages such as expanding machining fields in parts of turbo machineries like impeller, propeller, turbine blade and rotor, reasonable tool employment and great reduction of the set-up process. However, as adding two rotary axes, it is difficult to choose suitable machining conditions in terms of cutter path and cutter posture at a cutter contact point. Therefore in this paper, it is proposed to decide suitable machining condition through an experimental method such as adopting various cutter paths, cutter postures types. Also, in order to increase the efficiency of 5-axis machining, it is necessary to minimize the cutter posture changes and create a continuous cutter path while avoiding interference. This study, by using an MC-space algorithm for interference avoidance and an MB-spline algorithm for continuous control, is intended to create a 5-axis machining cutter path with excellent surface quality and economic feasibility. finally, this study will verify the effectiveness of the suggested method through verification processing.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.1
• /
• pp.46-53
• /
• 2007

NC (Numerical Control) code for the tool path needs to be generated efficiently for machining of free form pockets with arbitrary wall geometry on a three axis CNC machine. The unified rough and finish cut algorithm and the tool motion is graphically simulated in Part 1. In this paper, a grid based 3D navigation algorithm simulated in Part 1 for generating NC tool path data for both linear interpolation and a combination of linear and circular interpolation for three-axis CNC milling of general pockets with sculptured bottom surfaces is experimentally performed and verified.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.11
• /
• pp.1104-1111
• /
• 2009

In the low altitude, mission of the aircraft is restricted by a variety of threats such as anti-air missiles and terrain obstacles. Especially, aircraft have always a risk of ground collision near terrain. In this study, to effectively solve this problem, we developed the flight path generation algorithm that is considered the terrain avoidance. In this flight path generation algorithm, waypoints that should be passed by the UAV are selected first. The waypoints are located in the middle of the terrain obstacles. Then, physically meaningful waypoints sets are classified by Dijkstra algorithm. The optimal waypoint guidance law based on the optimal control theory is applied to produce trajectory candidates. And finally the minimum control energy trajectory is determined.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.687-693
• /
• 2012

In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.592-598
• /
• 2008

This paper presents collision prediction and avoidance method for AGVS (Automatic Guide Vehicle System). Also, we propose the PO(Right of Path Occupying) with decentralized delay time for collision avoidance. Classified essential element of AGV's working environment is modeled in this paper. Using this model, we propose a new shortest path algorithm using A* search algorithm and obtain the information on AGVs travel time, coordinates and rotation vector. Finally, we use the AGVs information data as input for simulation program. The simulation practice is used in order to evaluate a collision prediction and avoidance, and it has been presented to demonstrate the applicability of the minimize delay time.

• Journal of Mechanical Science and Technology
• /
• v.15 no.8
• /
• pp.1097-1107
• /
• 2001

In this paper, the wall following navigation algorithm of the mobile robot using a mono vision system is described. The key points of the mobile robot navigation system are effective acquisition of the environmental information and fast recognition of the robot position. Also, from this information, the mobile robot should be appropriately controlled to follow a desired path. For the recognition of the relative position and orientation of the robot to the wall, the features of the corridor structure are extracted using the mono vision system, then the relative position, the offset distance and steering angle of the robot from the wall, is derived for a simple corridor geometry. For the alleviation of the computation burden of the image processing, the Kalman filter is used to reduce search region in the image space for line detection. Next, the robot is controlled by this information to follow the desired path. The wall following control scheme by the PD control scheme is composed of two control parts, the approaching control and the orientation control, and each control is performed by steering and forward-driving motion of the robot. To verify the effectiveness of the proposed algorithm, the real time navigation experiments are performed. Through the result of the experiments, the effectiveness and flexibility of the suggested algorithm are verified in comparison with a pure encoder-guided mobile robot navigation system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.