• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.6
• /
• pp.712-717
• /
• 2007

This paper is concerned with the problem of state feedback control of continuous-time nonlinear Markovian jump systems, which are represented by Takagi-Sugeno fuzzy models. A new method for designing state feedback stabilizing controllers is presented in terms of solvability of a set of linear matrix inequalities (LMIs), and it is shown that the new design method provides better or at least the same results of the existing method in the literature. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.297-303
• /
• 2001

In this paper, the problem of the stability analysis for a class of linear neutral systems with time-varying delay is investigated. Using the Lyapunov method, a delay-dependent sufficient condition for asymptotic stability of the systems in terms of linear matrix inequalities (LMIs) is presented. The LMIs can be easily solved by various convex optimization algorithms.

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.39-42
• /
• 2002

This paper focuses on the asymptotic stability of a class of neutral linear systems with mixed time-varying delay arguments. Using the Lyapunov method, a delay-dependent stability criterion to guarantee the asymptotic stability for the systems is derived in terms of linear matrix inequalities (LMIs). The LMIs can be easily solved by various convex optimization algorithms. Two numerical examples are given to illustrate the proposed methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.224-224
• /
• 2000

Biaffine Matrix Inequalities(BIs) are known to give more general and flexible frameworks in control designs than Linear Matrix Inequalities(LMIs). However, BMIs are nonconvex constraints and very difficult to solve. In this paper, BMI problems are solved using Evolution Strategy(ES). Numerous BMI problems are solved to verify performances of ES solver for BMI problems and compared with those of Genetic Algorithms and Branch-and-Cut algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1072-1077
• /
• 2004

This paper provides a new approach to analyze the stability of a general multi-link TCP Vegas, which is a kind of feedback-based congestion algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium pints, this approach models a multi-link TCP Vegas network in the form of a piecewise linear multiple time-delay system. And then, based on the exactly characterized dynamic model, this paper presents a new stability criterion via a piecewise and multiple delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs).

• International Journal of Control, Automation, and Systems
• /
• v.5 no.5
• /
• pp.492-500
• /
• 2007

This paper focuses on the problem of guaranteed cost control for a class of uncertain linear delay systems with actuator failures. When actuators suffer "serious failure" the never failed actuators can not stabilize the system, based on switching strategy of average dwell time method, under the condition that activation time ratio between the system without actuator failure and the system with actuator failures is not less than a specified constant, a sufficient condition for exponential stability and weighted guaranteed cost performance are developed in terms of linear matrix inequalities (LMIs). Finally, as an example, a river pollution control problem illustrates the effectiveness of the proposed approach.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.195-201
• /
• 2005

This paper discusses the problem of positive real control for uncertain 2-D linear discrete time singular Roesser models (2-D SRM) with time-invariant norm-bounded parameter uncertainty. The purpose of this study is to design a state feedback controller such that the resulting closed-loop system is acceptable, jump modes free and stable, and achieves the extended strictly positive realness for all admissible uncertainties. A version of positive real lemma for the 2-D SRM is given in terms of linear matrix inequalities (LMIs). Based on the lemma, a sufficient condition for the solvability of the positive real control problem is derived in terms of bilinear matrix inequalities (BMIs) and an iterative procedure for solving the BMIs is proposed.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.697-704
• /
• 2006

The paper is concerned with $H_{\infty}$ filtering for descriptor systems. A necessary and sufficient condition is established in terms of linear matrix inequalities(LMIs) for the existence of normal filters such that the error systems are admissible and the transfer function from the disturbance to the filtering error output satisfies a prescribed $H_{\infty}$-norm bound constraint. When these LMIs are feasible, an explicit parameterization expression of all desired normal filter is given. All these results are yielded without decomposing the original descriptor systems, which makes the filter design procedure simple and direct. Finally, a numerical example is derived to demonstrate the applicability of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2430-2434
• /
• 2003

This paper provides a new approach to analyze the stability of TCP Vegas, which is a kind of feedback-based congestion control algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium points, this approach uses the exactly characterized dynamic model to get a new stability criterion via a piecewise and delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs). Using the new criterion, this paper shows that the current TCP Vegas algorithm is stable in the sufficiently wide region of network delay and link capacity.