• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.263-268
• /
• 2001

In this paper, we present a new heuristic algorithm fur buffer allocation in FMS (Flexible Manufacturing System). It is conducted by using a genetic algorithm and simulation. First, we model the system by using a simulation software, \"Arena\". Then, we apply a genetic algorithm to achieve an optimal solution. VBA blocks, which are kinds of add-in functions in Arena, are used to connect Arena with the genetic algorithm. The system being modeled has seven workstations, one loading/unloading station, and three AGVs (Automated Guided Vehicle). Also it contains three products, which each have their own machining order and processing times. We experimented with two kinds of buffer allocation problems with a proposed heuristic algorithm, and we will suggest a simple heuristic approach based on processing times and workloads to validate our proposed algorithm. The first experiment is to find a buffer profile to achieve the maximum throughput using a finite number of buffers. The second experiment is to find the minimum number of buffers to achieve the desired throughput. End of this paper, we compare the result of a proposed algorithm with the result of a simple buffer allocation heuristic based on processing times and workloads. We show that the proposed algorithm increase the throughput by 7.2%.t by 7.2%.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.638-643
• /
• 2002

MODIS (MODerate-resolution Imaging Spectroradiometer) onboard the first Earth Observing System (EOS) satellite, Terra, was launched successfully at the end of 1999. The direct broadcast MODIS data has been received and utilized in Korea Meteorological Administration (KMA) since february 2001. This study introduces utilizations of this data, especially for the derivation of sea surface temperature (SST). To produce the MODIS SST operationally, we used a simple cloud mask algorithm and MCSST algorithm. By using a simple cloud mask algorithm and by assumption of NOAA daily SST as a true SST, a new set of MCSST coefficients was derived. And we tried to analyze the current NASA's PFSST and new MCSST algorithms by using the collocated buoy observation data. Although the number of collocated data was limited, both algorithms are highly correlated with the buoy SST, but somewhat bigger bias and RMS difference than we expected. And PFSST uniformly underestimated the SST. Through more analyzing the archived and future-received data, we plan to derive better MCSST coefficients and apply to MODIS data of Aqua that is the second EOS satellite. To use the MODIS standard cloud mask algorithm to get better SST coefficients is going to be prepared.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.9-14
• /
• 2009

Recently, a rate-2, $2{\times}2$ space-time code with simple ML decoding has been designed. Though the simple ML decoding algorithm does reduce the ML decoding complexity, there is still need for improvement. In this paper, we propose an efficient decoding algorithm for the rate-2, $2{\times}2$ space-time code using interference cancellation techniques with performance virtually identical to that of ML decoding. Also, the decoding complexity of the proposed algorithm is significantly reduced compared to the conventional simple ML decoding, especially for large modulation orders.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.44 no.1
• /
• pp.57-67
• /
• 2008

Recently, Korean shipbuilding industry is keeping up the position of world wide No. 1 in world shipbuilding market share. It is caused by endless efforts to develope new technologies and methods and fast development of IT technologies in Korea, to raise up its productivities and efficiency in shipbuilding industry with many kinds of optimizing methods including genetic algorithm or artificial life algorithm... etc. In this paper, we have suggested the artificial life algorithm with relay search micro genetic algorithm. and we have improved a defect of simple genetic algorithm for its slow convergence speed and added a variety of solution candidates with applying relay search simple genetic algorithm. Finally, we have developed intelligent agent system for ship CAE modeling. We have tried to offer some conveniences a ship engineer for repeated ship CAE modeling by changing ship design repeatedly and to increase its accuracy of a ship model with it.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.228-233
• /
• 2004

Nowadays, the robot with various and complex functions is required. previous algorithms, however, cannot satisfy the requirement. In order to solve these problems, we introduce the 2-Layer Fuzzy Controller, which has a small number of fuzzy rules corresponding to various inputs and outputs. Also, it controls robustly and effectively an object. The main problem in the fuzzy controller is how to design the fuzzy rule. This paper designs the optimal 2-layer fuzzy controller using the Schema Co-Evolutionary Algorithm. The schema co-evolutionary algorithm can find more rapidly and excellently than simple genetic algorithm does.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.12
• /
• pp.1101-1105
• /
• 2012

This study proposes a method for improvement of PD type fuzzy controller. The method includes self tuner using gradient algorithm that is one of the optimization algorithms. The proposed controller improves simple Takagi-Sugeno type FLC (Fuzzy Logic Control) system. The simple Takagi-Sugeno type FLC system changes nonlinear characteristic to linear parameters of consequent membership function. The simple FLC system could control the system by calibrating parameter of consequent membership function that changes the system response. While the determination on parameter of the simple FLC system works well only partially, the proposed method is needed to determine parameters that work for overall response. The simple FLC system doesn't predict the response characteristics. While the simple FLC system works just like proportional part of PID, our system includes derivative part to predict the next response. The proposed controller is constructed with P part and D part FLC system that characteristic parameter on system response is changed by self tuner for effective response. Since the proposed controller doesn't include integral part, it can't eliminate steady state error. So we include a gain to eliminate the steady state error.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.8 no.1
• /
• pp.71-87
• /
• 1990

This paper presents a simple algorithm to obtain three dimensional information of an object. In the preprocessing of the stereo matching,feature point informations of stero image must be less sensitive to noise and well liked the correspondance problem. This paper described a simple technique of struture feature extraction of 3-D object and used edge-end point expanding method for unconnected line instade of Hough transform. The feature such as corner point and their angles are used for matching problem. The experimental results show that the described algorithm is a useful method for stereo correspondence problem.