• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• 제34권11호
• /
• pp.35-41
• /
• 2006

This paper proposes an algorithm for switching LQ(Linear Quadratic) controllers designed at each flight envelope without a bump phenomenon. This algorithm is derived to apply to LQ controller more easily than existing implementation algorithm and is proposed to consider trim points of nonlinear models, which is adequate to real applications. This paper exemplifies the control performance improvement via simulations applied to LQ control of a supersonic test aircraft as a benchmark problem to test the proposed algorithm performance.

• Journal of the Korean Statistical Society
• /
• 제29권3호
• /
• pp.361-373
• /
• 2000

A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

• Communications of the Korean Mathematical Society
• /
• 제32권3호
• /
• pp.765-778
• /
• 2017

Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• 제34S권1호
• /
• pp.54-64
• /
• 1997

In this paper, a method of dynamic modeling and a dynamic control of a mobile robot are presented to show the superiority of the dynamic control comparing to the PD control. This dynamic model is derived from the cartesian coordinates using lagrange equations. Based upon the derived dynamic model, we implemented the dynamic control of the mobile robot using the computed torque method. Time varying non-linear friction terms are not incroporated in this dynamic model. Instead, those are considered as disturbances. This uncertainty in dynamic model of mobile robot is compensated by the outer loop controller using PD algorithm. The validity of this model and the control algorithm are confirmed through the experiments, where the dynamic control algorithm demonstrated robust velocity tracking performance against the unmodeled non-linear frictions. The superiority of this algorithm is demonstrated by comparing to classical PD control algorithm.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• 제33A권5호
• /
• pp.1-9
• /
• 1996

In this paper, we propose an efficient computational algorithm that can reduce significantly the computational complexity of the ML optimum multiuser detector known as the most excellent detector in synchronous code division multiple access channels. The proposed detector uses the sequential detection algorithm based on the alternating maximization appraoch to obtain the ML estimates. As initial estimates for this sequential algorithm, we can use the estimated values obtained by the conventional single-user detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback muliuser detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback multiuser detector. We have performed computer simulations in order to see the convergence behaviors and the detection performance of the propsoed algorithm in terms of initial algorithms and the number of users, and then to compare the computational complexity with that of the ML optimum multiuser detector. From the results, we have seen that the proposed alternating maximization detector has nearly equal detction performance with that of the ML optimum multiuser detctor in only a few iteration.

• Journal of the Korea Society of Computer and Information
• /
• 제20권12호
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.274-277
• /
• 2000

Linear discriminant analysis (LDA) is a basic tool of pattern recognition, and it is used in extensive fields, e.g. face identification. However, LDA is poor at adaptability since it is a batch type algorithm. To overcome this, a new algorithm of online LDA is proposed in the present paper. It is experimentally shown that the new algorithm is about two times faster than the previously proposed algorithm.

• Proceedings of the KSME Conference
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.140-145
• /
• 2001

Various control algorithms are available to suppress the vibration of a system subjected to disturbances. LQ algorithm is simple and easy to implement the hardwares, but it lacks robustness for uncertainties and often causes difficulty in determining the weighting matrices. This study focuses on the effectiveness ILQ(Inverse Linear Quadratic optimal control) algorithm as the alternative to LQ applied to control the vibration of a building under the seismic excitation. The building is of moment resisting steel frames and assumed to behave within the elastic range. The brief overview of LQ and ILQ algorithms is introduced, and the displacement responses of the structure using ILQ algorithm are compared with those obtained from LQ control. The magnitude of control forces are also determined and compared for both LQ and ILQ algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권4C호
• /
• pp.384-391
• /
• 2003

Blind channel identification and equalization attempt to identify the communication channel and to remove the inter-symbol interference caused by a communication channel without using any known trainning sequences. In this paper, we propose a blind adaptive channel identification and equalization algorithm with phase offset compensation for single-input multiple-output (SIMO) channel. It is based on the one-step forward multichannel linear prediction error method and can be implemented by an RLS algorithm. Phase offset problem, we use a blind adaptive algorithm called the constant modulus derotator (CMD) algorithm based on condtant modulus algorithm (CMA). Moreover, unlike many known subspace (SS) methods or cross relation (CR) methods, our proposed algorithms do not require channel order estimation. Therefore, our algorithms are robust to channel order mismatch.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제60권3호
• /
• pp.625-631
• /
• 2011

This paper presents a discrete-time output feedback consensus algorithm for Multi-Agent Systems (MAS). Under the assumption that an agent is aware of the relative state information about its neighbors, a state feedback consensus algorithm is designed based on Linear Matrix Inequality (LMI) method. In general, however, it is possible to obtain its relative output information rather than the relative state information. To reconcile this problem, an Unknown Input Observer (UIO) is employed in this paper. To this end, first it is shown that the relative state information can be estimated using the UIO and the measured relative output information. Then a certainty-equivalence type output feedback consensus algorithm is proposed by combining the LMI-based state feedback consensus algorithm with the UIO. Finally, simulation results are given to illustrate that the proposed method successfully achieves the state consensus.