• Title/Summary/Keyword: Discrete Inequalities

Search Result 81, Processing Time 0.031 seconds

A Note on Positive Invariant Set for Linear Uncertain Discrete-Time Systems

  • Matsumoto, H.;Otsuka, N.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.571-574
    • /
    • 2005
  • This paper gives some sufficient conditions for a given polyhedral set which is represented as a set of linear inequalities to be positive D-invariant for uncertain linear discrete-time systems in the case such that the systems matrices depend linearly on uncertain parameters whose ranges are given intervals. Further, the results will be applied to uncertain linear continuous systems in the sense of the above by using Euler approximation.

  • PDF

$H_2$ Control of Continuous and Discrete Time Descriptor Systems (연속/이산 특이치 시스템의 $H_2$ 제어)

  • 이종하;김종해;박홍배
    • Proceedings of the IEEK Conference
    • /
    • 2001.06e
    • /
    • pp.29-32
    • /
    • 2001
  • This paper presents matrix inequality conditions for H$_2$optimal control of linear time-invariant descriptor systems in continuous and discrete time cases, respectively. First, the necessary and sufficient condition for H$_2$control and H$_2$controller design method are expressed in terms of LMls(linear matrix inequalities) with no equality constraints in continuous time case. Next, the sufficient condition for H$_2$control and H$_2$controller design method are proposed by matrix inequality approach in discrete time case. A numerical example is given in each case.

  • PDF

Derivations of Gallager Random Coding Bound by Simple Manipulations of Algebraic Inequalities (대수부등식들만을 이용한 갈라거 랜덤 코딩 바운드의 유도)

  • Yoo, Do-Sik;Lim, Jong-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.447-453
    • /
    • 2007
  • In this letter, we derive the Gallager random coding bound for discrete memoryless channels purely by simple manipulations of algebraic inequalities rather than invoking conceptually difficult random coding arguments. Gallager random coding bound is a very useful tool in information and coding theory due to its applicability to situations in which it is difficult to determine the decision regions and due to the fact that it can be used to derive the channel coding theorem. The readers will find it relatively easy to apply to many practical problems of interest the step-by-step algebraic derivations of the Gallager random coding bound with appropriate modifications.

  • PDF

H-infinity Discrete Time Fuzzy Controller Design Based on Bilinear Matrix Inequality

  • Chen M.;Feng G.;Zhou S.S.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.6 no.2
    • /
    • pp.127-137
    • /
    • 2006
  • This paper presents an $H_{\infty}$ controller synthesis method for discrete time fuzzy dynamic systems based on a piecewise smooth Lyapunov function. The basic idea of the proposed approach is to construct controllers for the fuzzy dynamic systems in such a way that a Piecewise smooth Lyapunov function can be used to establish the global stability with $H_{\infty}$ performance of the resulting closed loop fuzzy control systems. It is shown that the control laws can be obtained by solving a set of Bilinear Matrix Inequalities (BMIs). An example is given to illustrate the application of the proposed method.

Maximum Allowable Delay Bounds and Real-time Scheduling Method of Networked Discrete-time Control Systems (네트워크 기반 이산 시간 제어 시스템의 최대 허용 지연 한계 및 실시간 스케줄링 기법에 관한 연구)

  • Kim Dong-Sung;Choi Dong-Hyuk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.7
    • /
    • pp.719-727
    • /
    • 2006
  • This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

Discrete controller order reduction with the closed-loop performance guaranteed (폐루프시스템의 성능을 보장하는 이산제어기 차수축소)

  • 오도창;정은태;박홍배
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.24-32
    • /
    • 1997
  • This paper is on a discrete controller order reduction with the closed-loop stability and performance guaranteed. to achieve this, after finding the solutionsof two lyapunov inequalities and balancing the full order controller system, we find the reudced order controlers using the balanced truncation (BT) and the balanced singular perturbation approximation (BSPA). When the solutions of the two lyapunov inequalities exist, it is shown that the resulting controllers guarantee the closed-loop stability, and .inf.-norm error bounds are derived for the closed-loop performance region for the BT and in low frequency region for the BSPA. Finally, a numerical example is given to illustrate the validity of the proposed method.

  • PDF

Output Tracking Controller Design of Discrete-Time TS Fuzzy Systems (이산시간 TS 퍼지 시스템의 추종 제어기 설계)

  • 이호재;주영훈;박진배
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.191-194
    • /
    • 2000
  • In this paper, an output tracking control technique of discrete-time Takagi-Sugeno (TS) fuzzy systems is developed. The TS fuzzy system is represented as an uncertain multiple linear system. The tracking problem of TS fuzzy system is converted into the stabilization problem of a uncertain multiple linear system. A sufficient condition for asymptotic tracking is obtained in terms of linear matrix inequalities (LMI). A design example is illustrated to show the effectiveness of the proposed method.

  • PDF

On Bounds for Moments of Unimodal Distributions

  • Sharma, R.;Bhandaria, R.
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.3
    • /
    • pp.201-212
    • /
    • 2014
  • We provide a simple basic method to find bounds for higher order moments of unimodal distributions in terms of lower order moments when the random variable takes value in a given finite real interval. The bounds for moments in terms of the geometric mean of the distribution are also derived. Both continuous and discrete cases are considered. The bounds for the ratio and difference of moments are obtained. The special cases provide refinements of several well-known inequalities, such as Kantorovich inequality and Krasnosel'skii and Krein inequality.

Output-feedback H_infinite Control of Discrete-time LPV Systems

  • Park, Doo-Jin;Park, Poo-Gyeon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.44.2-44
    • /
    • 2002
  • $\textbullet$ We propose a new H_infinite LPV output-feedback controller associated with a new PQLF $\textbullet$ The LPV controller employs not only the current-time but also the one-step-past information $\textbullet$ The controller is formulated with parameterized linear matrix inequalities $\textbullet$ We propose the new controller for discrete-time LPV systems $\textbullet$ As a conservative case, we suggest another controller associated with CQLF

  • PDF