• Journal of Advanced Marine Engineering and Technology
• /
• v.23 no.5
• /
• pp.630-636
• /
• 1999

In this paper in optimal modulation controller for position control and anti-sway of container crane systems is designed by a recursive algorithm that determines the state weighting matrix Q of a linear quadratic performance. The optimal modulation controller is based on optimal control. The basic feature of the recursive algorithm is the reduction of the number of iterations as well as minimization of the calculations involved So in order to obtain a mathematical model which rep-resents the equation of motion of the trolley and load Lagrange equation is used. The optimal modulation controller has been verified and simulated to show that it is robust when a load dis-turbance is applied and a reference is changed.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.3
• /
• pp.111-116
• /
• 2000

In this paper, we presented a new algebraic iterative algorithm for the optimal control of the nonlinear systems. The algorithm is based on tow steps. The first step transforms optimal control problem into a sequence of linear optimal control problem using the quasilinearization method. In the second step, TPB(two point boundary condition problem) is solved by algebraic equations instead of differential equations using BPF(block pulse functions). The proposed algorithm is simple and efficient in computation for the optimal control of nonlinear systems. In computer simulation, the algorithm was verified through the optimal control design of Van del pole system and Volterra Predatory-prey system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.155-163
• /
• 2000

In this paper, we propose an algorithm for the object function used in optimal control or optimal design that sets the object function as simultaneous and then calculates the optimal value according to the Newton method. The proposed method calculates the optimal value simply using two inputs; object function and initial value, using the DDA(Direct Derivative Algorithm) which is a programmed ordinary derivative function that does not inquire the calculation of derivative function nor any inputs. And we have verified the usefulness of the algorithm for the optimal control and optimal dosing.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.79-86
• /
• 2005

This paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm Is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in audition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2911-2913
• /
• 1999

This paper suggest an optimal identification method to complex and nonlinear system modeling that is based on Fuzzy-Neural Network(FNN). The FNN modeling implements parameter identification using HCM algorithm and optimal identification algorithm structure combined with two types of optimization theories for nonlinear systems, we use a HCM Clustering Algorithm to find initial parameters of membership function. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using optimal identification algorithm. The proposed optimal identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregate objective function(performance index) with weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1157-1160
• /
• 2003

We proposed a study on optimal clock period selection algorithm for low power RTL design. The proposed algorithm use the way of maintaining the throughput by reducing supply voltage after improve the system performance in order to minimize the power consumption. In this paper, it select the low power to use pipeline in the transformation of architecture. Also, the algorithm is important the clock period selection in order to maximize the resource sharing. however, it execute the optimal clock period selection algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.737-740
• /
• 1999

This paper deals with a real time optimization algorithm within real time for DRGS(Dynamic Route Guidance System) and evaluate the algorithm. A pre-developed system offers the optimal route in using only static traffic information. In using real-time traffic information, Dynamic route guidance algorithm is needed. The serious problem in implementing it is processing time increase as nodes increase and then the real time processing is impossible. Thus, in this paper we propose the optimal route algorithm with window mechanism for the real-time processing and then evaluate the algorithms.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.357-370
• /
• 2000

This study has adapted a genetic algorithm for an optimal design for the first time. the models that was used a simulation are the first and second order response surfaces model, Using an genetic algorithm in D-opimal it is more efficient than previous algorithms to get an object function. Not like other algorithm without any restrictions like troublesome about the initial solution not falling into a local optimal solution it's the most suitable algorithm.

• Structural Engineering and Mechanics
• /
• v.15 no.4
• /
• pp.451-462
• /
• 2003

In this paper, a new block iterative algorithm is presented by using the special feature of the continuous Riccati equation in the optimal shape control. Because the real-time control require that the CPU time should be as short as possible, an appropriate modal control algorithm is sought. The computing cost is less than the one of the all state feedback control. A numerical example is given to illustrate the algorithm.