• Journal of Advanced Marine Engineering and Technology
• /
• 제23권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권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.

• 한국정보통신학회논문지
• /
• 제4권1호
• /
• pp.155-163
• /
• 2000

최적 제어나 최적 설계에 사용되는 목적함수를 연립 방정식화하여, Newton법에 의하여 최적치를 구하는 알고리즘을 제안하였다. 제안한 방식은 도함수의 산출과 입력이 불필요한 일반 도함수를 프로그램화한 직접 미분법(DDA)에 의하여 목적함수와 초기치만을 입력하여 최적치를 구하는 간단한 방식이다. 제안한 방식을 최적 제어와 최적 설계에 적용하여 유용성을 확인하였다.

• 정보처리학회논문지A
• /
• 제12A권1호
• /
• pp.79-86
• /
• 2005

이 논문에서는 계산적으로나 수명적으로 코드를 최적화 하기 위해 절제된 코드 모션 알고리즘을 제안한다. 제한한 알고리즘은 BCM과 LCM 알고리즘을 확장한 SpCM 알고리즘이다. SpCM 알고리즘에서 BCM 알고리즘은 계산적으로 최적의 코드 모션을 수행하며, LCM 알고리즘은 레지스터 압박을 감소시킨다. 일반적으로, 코트 모션 알고리즘은 계산의 최적화와 레지스터 압박에 관련된 실행시간 최적화를 실행한다. 이 논문에서는 계산 비용과 레지스터 압박에 코드의 크기를 고려하는 부분을 추가하였다. 코드의 계산적 최적화와 수명적 최적화에 이어 코드의 크기를 고려하는 SpCM 알고리즘에 의해 코드 모션의 최적화 결과를 얻을 수 있다. 이 논문에서 제안한 알고리즘은 모든 불필요한 코드 모션을 억제시키기 때문에 계산적으로나 수명적으로 최적인 알고리즘이라 할 수 있다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• 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.

• 한국컴퓨터정보학회논문지
• /
• 제20권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 II
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• 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
• /
• 제7권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
• /
• 제15권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.