• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.105-109
• /
• 2008

A robust optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory is presented. The validity of the linear matrix inequalities robust control system design in active suspension system through the numerical examples is also investigated.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.198-203
• /
• 2008

An Intelligent optimal control system design algorithm in active suspension equipment adopting linear matrix inequalities control system design theory with representing by descriptor system form is presented. The validity of the linear matrix inequalities intelligent decentralized control system design with representing by descriptor system form in active suspension system through the numerical examples is also investigated.

• Kyungpook Mathematical Journal
• /
• v.53 no.2
• /
• pp.273-283
• /
• 2013

In this paper, we consider the row rank inequalities derived from comparisons of the row ranks of the additions and multiplications of nonnegative integer matrices and construct the sets of nonnegative integer matrix pairs which is occurred at the extreme cases for the row rank inequalities. We characterize the linear operators that preserve these extreme sets of nonnegative integer matrix pairs.

• Honam Mathematical Journal
• /
• v.33 no.3
• /
• pp.301-310
• /
• 2011

In this paper, we construct the sets of fuzzy matrix pairs. These sets are naturally occurred at the extreme cases for the zero-term rank inequalities derived from the multiplication of fuzzy matrix pairs. We characterize the linear operators that preserve these extreme sets of fuzzy matrix pairs.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.349-353
• /
• 2008

Using the recently developed ABS algorithm for solving linear Diophantine equations we introduce an algorithm for solving a system of m linear integer inequalities in n variables, m $\leq$ n, with full rank coefficient matrix. We apply this result to solve linear integer programming problems with m $\leq$ n inequalities.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.1-9
• /
• 2013

We consider the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.71-81
• /
• 2010

We characterize linear operators that preserve sets of matrix ordered pairs which satisfy extreme cases with respect to maximal column rank inequalities of matrix multiplications over semirings.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.988-991
• /
• 1996

The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.822-827
• /
• 2014

This paper presents a robust observer-based output feedback control for stabilization of linear time invariant systems with polytopic uncertainties. To this end, this paper not only finds a robust observer gain but also suggests how to determine the model used in the observer, which is not obvious due to model uncertainties in the conventional observer design method. The robust observer gain and the observer model are selected in a way that the whole closed-loop is stable by solving LMIs and BMIs (Linear Matrix Inequalities and Bilinear Matrix Inequalities). A simulation example shows that the proposed robust observer-based output feedback control successfully leads to closed-loop stability.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.643-652
• /
• 2008

We construct the sets of Boolean matrix pairs, which are naturally occurred at the extreme cases for the Boolean rank inequalities relative to the sums and difference of two Boolean matrices or compared between their Boolean ranks and their real ranks. For these sets, we consider the linear operators that preserve them. We characterize those linear operators as T(X) = PXQ or $T(X)\;=\;PX^tQ$ with appropriate invertible Boolean matrices P and Q.