• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.483-487
• /
• 1996

We consider the estimation of the position and orientation of 6 DOF motion bed (Stewart platform) from the measured cylinder length. The solution of forward kinematics is not solved yet as a useful realtime application tool because of the complity of the equation with multiple solutiple solutions. Hence we suggest an algorithm for the estimation of forward kinematics solution using Luenberger observer withnonlinear error correction term. The Luenberger observer withlinear model shows that the estimation error does not go to zero in steadystate due to the linearization error of the dynamic model. Hence the linear observer is modified using nonlinear measurement error equation and we prove thd practical stability of the estimation error dynamics of the proposed observer using lyapunov function.

• 한국전산유체공학회:학술대회논문집
• /
• 1997.10a
• /
• pp.23-28
• /
• 1997

A parallel implementation is made of a two-dimensional finite volume model based on the SIMPLER. The solution domain is decomposed into several subdomains and the solution at each subdomain is acquired by parallel use of multiple processors. Communications between processors are accomplished by using the standard MPI and the Cray-specific SHMEM. The parallelization method for the overall solution procedure to the Navier-Stokes equations is described in detail, The parallel implementation is validated on the Cray T3E system for a benchmark problem of natural convection in a sidewall-heated cavity. The parallel performance is assessed and the issues encountered in achieving a high-performance parallel model are elaborated.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.6
• /
• pp.235-245
• /
• 2007

This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA) for solving the resource-constrained project scheduling problem, which is one of the most challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.

• Geomechanics and Engineering
• /
• v.9 no.2
• /
• pp.169-193
• /
• 2015

This paper is the second part of the study for determining the seismic behavior of soil systems. The aim of this part is to present solution approaches for determining seismic site amplification. For this purpose, two solution techniques are used. The first technique is equivalent linear analysis which is mostly used in literature. The other technique is real time parameter updating approach and this approach uses the possibilities of Simulink effectively. A graphical user interfaced (GUI) program called DTASSA standing for Discrete-Time Analysis of Seismic Site Amplification is developed. In DTASSA, automatic block diagram producing system is developed and seismic site amplification for multiple soil layers may easily be investigated in real time. Numerical applications have been carried out to check the reliability of developed algorithm. The results of DTASSA are compared with SUA, EERA and NERA programs for the particular example problems.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.411-420
• /
• 1999

The computational model and a new eigenvalue solution algorithm for large-scale structures is presented in the form of parallel computation. The computational loads and data storages required during the solution process are drastically reduced by evenly distributing computational loads to each processor. As the parallel computational model, multiple personal computers are connected by 10Mbits per second Ethernet card. In this study substructuring techniques and static condensation method are adopted for modeling a large-scale structure. To reduce the size of an eigenvalue problem the interface degrees of freedom and one lateral degree of freedom are selected as the master degrees of freedom in each substructure. The performance of the proposed parallel algorithm is demonstrated by applying the algorithm to dynamic analysis of two-dimensional structures.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.7
• /
• pp.311-316
• /
• 2002

It has been a basic model for the present electric power industry that more than two generators compete, and thereby the market clearing price and the generation schedules are determined through the bid process. In order for this paradigm to be applicable to real electric power systems and markets, it is necessary to reflect many physical and economic constraints related to frequency and transmission in the dispatching schedule. The paper presents an approach to deriving a Nash bargaining solution in a competitive electricity market where multiple generators are playing with the system operator who mitigates the transmission congestion to minimize the total transaction cost. In this study, we take the effect of the line flows and the role of system operator into the Game. Finally, a case study has been demonstrated to verify the proposed cooperative game.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.383-386
• /
• 2002

In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.539-550
• /
• 1998

A computerized layout system based on a constraint satisfaction problem (CSP) technique was developed to treat both facility layout and instrument panel layout problems. This layout system attempts to allocate various facilities under multiple layout criteria including qualitative design objectives. Since most of the design objectives can be understood as constraints which the layout solution must satisfy to improve the goodness of the solution, a CSP technique was employed to solve the multi-constraints layout problem. The effectiveness of the system was evaluated by the comparison with the well-known facility layout program, CORELAP. Furthermore, the proposed system can also be applied to the instrument panel layout problem successfully. Several user-centered guidelines were well reflected on the solution obtained. CONSLAY, the prototype layout system being developed in the research, greatly enhanced the interactions with the designer so as to deal with the problem-dependent nature of the layout problem and to properly reflect the domain-specific knowledge of the designer.

• Journal of the military operations research society of Korea
• /
• v.28 no.2
• /
• pp.34-55
• /
• 2002

This paper deals with the multiple attribute decision making problem when a decision maker incompletely articulates his/her preferences about the attribute weight and alternative value. Furthermore, we consider the attribute tree which is structured hierarchically. Techniques for establishing dominance with linear partial information are proposed in a hierarchically structured attribute tree. The linear additive value function under certainty is used in the model. The incompletely specified information constructs a feasible region of linear constraints and therefore the pairwise dominance relationship between alternatives leads to intractable non-linear programming. Hence, we propose solution techniques to handle this difficulty. Also, to handle the tree structure, we break down the attribute tree into sub-trees. Due to there cursive structure of the solution technique, the optimization results from sub-trees can be utilized in computing the value interval on the topmost attribute. The value intervals computed by the proposed solution techniques can be used to establishing the pairwise dominance relation between alternatives. In this paper, pairwise dominance relation will be represented as strict dominance and weak dominance, which ware already defined in earlier researches.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.396-406
• /
• 2002

On the whole, the simple GAs with just one population set is effective in finding one optimal solution. However, many real world problems have a lot of optimal solutions, and often it is important to find all of them. In this paper, we propose a GA that has a population set containing multiple optimal solutions. In the proposed GA, each of the individuals in population set has its own geological neighbors, and they exchange their genes globally as well as compete with others locally. The paper then evaluates the proposed GA along with many multimodal problems including a 30bit, order-six bipolar-deceptive function. Finally, we present some improvement directions of the proposed GA.