• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.239-245
• /
• 2012

This paper proposes a novel optimum design method for the PID controller of magnetic levitation-based Rail-Guided Vehicle(RGV) by a genetic algorithm using clone selection method and a new performance index function with performances of both time and frequency domain. Generally, since an attraction type levitation system is intrinsically unstable and requires a delicate controller that is designed considering overshoot and settling time, it is difficult to completely satisfy the desired performance through the methods designed by conventional performance indexes. In the paper, the conventional performance indexes are analyzed and then a new performance index for Maglev-based RGV is proposed. Also, an advanced genetic algorithm which is designed using clonal selection algorithm for performance improvement is proposed. To verify the proposed algorithm and the performance index, we compare the proposed method with a simple genetic algorithm and particle swarm optimization. The simulation results show that the proposed method is more effective than conventional optimization methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.84.3-84
• /
• 2001

Suggesting the standard of optimal transferring for one RGV or two RGV, which have multiple buffers, using average delivery time and sigma in the straight line working place. For performing the optimal transferring, present RGV-Job Dispatching algorithm, which is possible to apply in realtime, and apply random job occurrence conditions for examining the possibility to apply various real environments.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.24-29
• /
• 1999

Proposed in this paper is a modeling and simulation methodology for a virtual manufacturing environment. Based on DEVS formalism[Zeigler 76], the proposed model, so called GKDEVS, is designed to descript the geometrical knematic structure as well as event-driven and continuous state dynamics. In terms of abstract simulation algorithm[Zeigler 84], the simulation method of GKDEVS is proposed for combined discrete-continuous simulation. Using the GKDEVS, and FMS model consisting of a turing machine, a 3-axis machine and a RGV-mounted robot is constructed and simulated.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• IE interfaces
• /
• v.15 no.4
• /
• pp.364-373
• /
• 2002

This paper developed an operating software for the manufacturing cell of a model plant. The model plant, which was manufactured by Fishertechnik, consists of an assembly cell, a machining cell, and supplementary material handling equipments. Each I/O module of the model plant communicates with the INTERBUS controller devices via High-level Language Interface(HLI). The machining center has two machining cells, which consists of 4 machines respectively, two 3-axis portal transporters, and a rail guided vehicle(RGV). The Petri-Net was used to investigate the dynamics of each machining cell, e.g., the relation of material handling equipments and machines. The operating software was analyzed and designed by Object Oriented Technique. The software was implemented using Delphi 3.0 under Windows 95/NT operating system.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.39-54
• /
• 2000

Presented in this paper is a modeling and simulation methodology for 3 dimensional man-made systems. Based on DEVS(discrete event system specification) formalism[13], we propose GK-DEVS (geometrical and kinematic DEVS) formalism to describe the geometrical and kinematic structure and continuous state dynamics. To represent geometry and kinematics, we add a hierarchical structure to the conventional atomic model. In addition, we employ the "empty event" and its external event function for continuous state changing. In terms of abstract simulation algorithm[13], the simulation method of GK-DEVS, named GK-Simulator, is proposed for combined discrete-continuous simulation. Using GK-DEVS, the simulation of an FMS(flexible manufacturing system) consisting of a luring machine, a 3-axis machine and a RGV-mounted robot has been peformed.en peformed.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2004.05a
• /
• pp.138-146
• /
• 2004

현재 반도체 및 LCD 제조분야에 적용되는 공정장비, 이송시스템에는 고성능, 고생산성이 요구되고 있는 추세이다 기존의 선형이송시스템은 구동원으로 서보모터(Servo Motor)를 사용하고 있으며, 기계적 동력전달장치를 사용하여 직선운동을 하는 구조로 되어있어 마찰소음, Position Error 등의 발생요인이 많은 단점을 가지고 있다. 반면에 선형전동기(Linear Motor)를 이송시스템의 구동원으로 사용하면 기계적 동력전달장치가 생략되어 기존의 선형이송시스템이 가지고 있는 단점들의 개선효과가 크며 유지보수면에서도 유리한 점이 많다. 본 연구에서는 2,500[N]급 영구자석 여자 횡자속 선형전동기를 설계, 개발하였으며, 이를 적용한 추진모듈을 개발하였다. 본 연구에서 개발된 횡자속 선형전동기 적용 추진모듈은 LCD 제조분야의 Stocker, RGV, Index, OHS, OHT 등을 비롯하여 타 산업분야의 선형이송시스템으로의 가능하다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2013

The studies on the shortest path algorithms based on Dijkstra algorithm has been done continuously to decrease the time for searching. $A^*$ algorithm is the most represented one. Although fast searching speed is the major point of $A^*$ algorithm, there are high rates of failing in search of the shortest path, because of complex and irregular networks. The failure of the search means that it either did not find the target node, or found the shortest path, witch is not true. This study proposed $A^*$ algorithm applying method that can reduce searching failure rates, preferentially organizing the relations between the starting node and the targeting node, and appling it in reverse according to the organized path. This proposed method may not build exactly the shortest path, but the entire failure in search of th path would not occur. Following the developed algorithm tested in a real complex networks, it revealed that this algorithm increases the amount of time than the usual $A^*$ algorithm, but the accuracy rates of the shortest paths built is very high.

• Journal of Ocean Engineering and Technology
• /
• v.17 no.5 s.54
• /
• pp.82-87
• /
• 2003

A practical method to investigate the sharing architecture of FMS, for small and medium enterprises, on distributed heterogeneous environmental conditions is investigated. Because the industrial FMS model requires a reasonable size for actual work-site flexible operation, the initial facility expense is very heavy. The support for flexible cooperation of FMS, with some external different FMS, can reduce expenditures and provide greater functionality. While most FMS provide their operation process using an adequate mechanism, when used in isolation, such as island of automation, there is increasing demand for FMS that can cooperate. By exchanging intermediate products and information with other external FMS, products can be produced that cannot be produced alone, such as those that require various processes. This study first considers the sharing architecture of FMS for small and medium enterprises, and investigates the effects of the general sharing architecture of FMS on distributed heterogeneous environments, by using transducer approach to agentification. In this study, set-up station or in-out station takes charge of the gateway of intermediate products, and routes them among distributed heterogeneous FMS plants. The transducer approach is applied to web agent and set-up agent established interfaces, with system controller and setup controller. In this study, the FMS-established sharing architecture is able to obtain not only the internal flexibility, but also the external flexibility.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.2
• /
• pp.12-21
• /
• 2013

This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.