The Tuning of Robust Controllers for Stable Systems in the CD-Algebra: The Case of Sinusoidal and Polynomial Signals
|
|
- Alexander White
- 5 years ago
- Views:
Transcription
1 The Tuning of Robust Controllers for Stable Systems in the CD-Algebra: The Case of Sinusoidal and Polynomial Signals Timo Hämäläinen Seppo Pohjolainen Tampere University of Technology Department of Mathematics PO Box 69 FIN Tampere Finland Keywords: Infinite Dimensional Systems Low-Gain ControlRobust ControlCD-AlgebraOptimalTuning Abstract In this paper we consider the asymptotically optimal tuning of the parameters of a robust controller for distributed parameter systems DPS The controller consists of a positive scalar gain ε and polynomial matrices K s =0 n The cost function is the H -norm of the error between the reference signal and the measured output signal It is shown that as ε 0 the optimization problem reduces to a finite number of semi-infinite min-max optimization problems each problem depends only on a single polynomial matrix K s 1 Introduction In this paper the tuning of finite-dimensional robust multivariable controllers for stable infinite-dimensional systems in the Callier-Desoer algebra CD-algebra will be discussed The following robust regulation problem will be considered: Given a stable plant in the CD-algebra and reference and disturbance signals of the form 0 1 j=0 a 0j t j + =1 1 j=0 a j t j sinω t + φ a j R find a low order finite-dimensional controller so that the outputs asymptotically trac the reference signals asymptotically reject the disturbance signals and the closed loop system is stable and robust with respect to a class of perturbations in the plant In a previous paper [1] the authors have shown that a controller of the form ε m K s iω /ε C ε s = s iω m = n the K s are polynomial matrices with deg K s < m solves the robust regulation problem provided that the 1 positive scalar gain ε is small enough and the matrices K s satisfy certain stability conditions see Eq 5 and also Eq 3 The stability conditions leave a great deal of freedom in the choice of the matrices K s Hence it is desirable to find values for the controller parameters ε and K s that are optimal in some sense In this paper we find an asymptotically as ε 0 globally optimal selection for the polynomial matrices K s when the cost function is the H -norm of the error between the reference signal and the output signal More precisely we wish to minimize the norm of the error signal over all frequencies and all reference and disturbance signals with bounded amplitudes Including the reference and disturbance signal amplitudes in the cost function allows some of the amplitudes a j in 1 to be zero In practice this means that the choice of the polynomial matrices remains optimal despite the presence or absence of particular sinusoidal or polynomial components of the reference and disturbance signals This is useful if it is desired to trac or reject signals which contain a variable subset of the frequencies ω or the powers t j It is shown that as ε 0 the optimization problem reduces to a finite number of semi-infinite min-max optimization problems one for each frequency each problem depends only on a single polynomial matrix K s The only information required of the plant is the value of the plant transfer matrix at the frequency ω Thus the matrices K s can be tuned with input-output measurements made from the open loop plant without nowledge of the plant model If the coefficients a are constant the semi-infinite optimization problems can be solved in closed form In this case the optimal polynomial matrices are constants K which can be expressed in terms of the values of the plant transfer matrix at the frequency ω The asymptotically optimal values are near optimal for small positive values of the scalar gain ε Hence if the quality of the control is not satisfactory and a model for the plant is available there is a good starting point for numerical optimization methods
2 Notation R and C are the fields of real and complex numbers and C + is the open right half-plane The complex conjugate of a complex number z is denoted by z F[s] is the ring of polynomials in the indeterminate s and coefficients from the field F and deg ps is the degree of the polynomial ps F[s] If ps is a polynomial matrix or vector deg ps is the maximum degree of the elements of ps Rs is the field of rational functions with real coefficients in the indeterminate s F p m is the class of p m matrices with elements in the set F F p is the same as F p 1 I p is the p p identity matrix and A is the conjugate transpose of the matrix A The spectrum of a linear operator A is denoted by σa The norms of x C n and A C m n are defined by x = n i=1 x i and A = σ max A =the largest singular value of A The smallest singular value of A is denoted by σ min A In the normed space X we denote the open ball with center x and radius r by B X x; r or more simply by Bx; r if the space X is clear from the context A polynomial is stable if all its zeros are in the open left half-plane The subset of stable elements of the Callier-Desoer algebra ˆB0 is denoted by  0 For the definition of the CD-algebra see [] The norm of P  0 p m is P = sup ω R P iω 3 Problem Formulation 31 Assumptions We assume that the plant P has m inputs p outputs and that it is stable ie P  0 p m In addition the plant is assumed to satisfy the condition P iω =P iω ω R Assumption is only needed to guarantee that the controller is real ie has elements in Rs The reference signal r and the disturbance signal w are assumed to be of the form 1 Expanding the Laplace transforms of r and w into partial fractions we get rs = ws = = n m = n To simplify notation we have defined r j s iω j r j C p w j s iω j w j C m ω 0 =0 and ω = ω m = m 3 for = n n 3 Previous Results In a previous paper [1] the following problem was solved: Problem 1 Given the feedbac configuration in Fig 1 find a controller C ε such that w r e C ε u Figure 1: The structure of the closed loop system with stable plant P reference signal r disturbance signal w and controller C ε 1 C ε is finite-dimensional has low-order and robustly in the sense of graph topology [3] stabilizes the closed loop system The outputs asymptotically trac the reference signals and asymptotically reject the disturbance signals 3 There exists an ε > 0 such that 1 and hold for every ε 0ε 4 Apart from the parameter ε the controller s parameters can be tuned using the information that can be measured from the original stable plant with input-output measurements The solution to Problem 1 is given by the following theorem proved in [1] Theorem 1 Let the controller C ε be defined by C ε s = K s = = n 1 ε m K s iω /ε s iω m 4 P K l s l K l C m p Then there exists an ε > 0 such that for every ε 0ε the controller C ε is a solution to Problem 1 provided that the polynomial matrices K s satisfy the stability conditions dets m I p + P iω K s Furthermore Problem 1 has a solution iff Let us define is stable for = nn 5 ran P iω =p = nn 6 Q s =s m I p +Piω K s The controller is real if y = nn 7 K l = K l for =0n l =0m 1 8
3 For = 0 Eq 8 implies that K 0l R m p for l = 0 m 0 1 It follows from condition that if K s satisfies condition 5 and the coefficients of K s satisfy Eq 8 then K s also satisfies 5 Hence only K 0 s K 1 s K n s need be assigned In the sequel we assume that the plant satisfies condition 6 so that Problem 1 has a solution 33 The Optimization Problem In this subsection the optimization problem for the polynomial matrices K s will be formulated Let the transfer matrix from the reference signal to the error signal be Hs = I p +PsC ε s 1 9 Let us also define e j and e by e j s = Hs r j Psw j s iω j e s = e j s Then the error signal es can be written as es =Hs rs Psws = e s and = = n e j s To simplify notation let = n K =K l m 1 C m p m r =r j m Cp m w =w j m Cm m K =K n = n C m p N r=r n = n C p N w=w n = n C m N N = n = n m Let b Kl b rj and b wj be nonnegative real parameters For = n nwe define the constraint sets S K = { K l m 1 det Q s is stable and K l b Kl for l =0m 1 } S r = { r j m S w = { w j m and in terms of these S K = S K n S Kn S r = S r n S rn S w = S w n S wn } r j b rj for j =1m } w j b wj for j =1m A natural cost function would be JKε = sup sup e = sup w S w r S r sup sup r S r w S w ω R eiω However consider the case n =0 Then 1 PsK e 0j s = I p + εm0 0 s/ε r0j s m0 s j P sw 0j s j =s m0 I p +ε m0 PsK 0 s/ε 1 s m0 j r 0j P sw 0j Clearly e 0j has a pole at zero when ε =0 Hence for small ε the main contribution to e 0j comes from a neighbourhood of zero If we now mae a change of variable s = ε s and assume that ε s is small we have e 0j s = s m0 1 sm0 j I p +Pε sk 0 s ε j r 0j P ε sw 0j s m0 1 sm0 j I p + P0K 0 s ε j r 0j P 0w 0j This heuristic consideration shows that because of the term ε j in the denominator we should replace e j s with ε j e j s Therefore we define e ε and e ε by and JKεby e ε s = ε j e j s e ε s = = n JKε = sup sup e ε = sup w S w r S r e ε s sup sup r S r w S w ω R The objective function is now defined to be e ε iω JK = lim JKε 10 Now the optimization problem can be formulated as Problem Given the cost function 10 find J 0 = inf JK 11 K S K 4 Solution of the Optimization Problem In this section we solve the optimization problem formulated in the previous section Lemma Let ε 0 1 be such that the intervals B = B R ω ; ε are nonoverlapping for = n nand let B c be the complement of n = n B in R Then
4 a The error signal e ε satisfies rw sup e ε iω =0 ω B c b For any = n nand any l we have rw sup e εl iω =0 1 ω B Proof Because each J K depends on only one K it follows from Lemma 3 that J 0 = inf JK = K S K = max inf nn inf K S K K S K J K = max J K nn max nn J 0 c For any = n nwe have rw sup e ε iω = J K 13 ω B J K = sup sup r w ω R Q iω 1 iω m j r j Piω w j and Q was defined in Eq 7 The next lemma shows that as ε 0 the optimization problem can decomposed into n +1simple subproblems each depending on only one polynomial matrix K s Lemma 3 Let J K be as in Lemma Then the cost function JK can be written as JK = lim ε JKε = max J K nn Proof Let B and B c be as in Lemma Then { sup e ε iω = max ω R sup e ε iω ω B n sup e ε iω sup e ε iω ω B n ω B c Combining parts b and c of Lemma we get rw sup e ε iω = J K ω B } 14 = nn This together with part a of Lemma and decomposition 14 proves the lemma Now the main result of the paper is an easy consequence of Lemma 3 Theorem 4 The minimum value J 0 ofjkis J 0 = J 0 = max nn J 0 inf J K K S K and J K was defined in Lemma The minimization of each J has to be done numerically The definition of J shows that we have a min-max problem Because of the constraint det Q s 0for all s C + the problem is also semi-infinite In a previous paper [4] the authors have considered the case m =1 ie when the reference and disturbance signals have simple poles In this case the optimal values J 0 can be computed in closed form Theorem 5 If m =1 then the minimum value J 0 ofj is J 0 = max nn 1 b K which is reached with the choice b r σ min P iω + b w K opt = b K P iω P iω P iω 1/ for = n n 5 Conclusion In this paper the optimal tuning of the polynomial-matrix parameters of a robust controller for stable plants in the CDalgebra has been discussed The optimization is done in the frequency domain using a cost function which is maximum of the error signal over all frequencies and all reference and disturbance signals with bounded amplitudes The amplitude bounds for the reference and disturbance signals and the bounds for the coefficents of the polynomial matrices are freely assignable and can be used as design parameters The optimization problem reduces to a finite number of semi-infinite min-max problems one for each frequency The only information required of the plant is the value of the plant transfer matrix at the frequency ω To the authors nowledge the main results are new even for finitedimensional systems Future wor includes finding a tuning method for the parameter ε
5 Appendix To prove Lemma we first need to prove Lemmas 6 and 7 For the proofs we need the following definitions U s = Q s s+1 m s iω U ε s =U ε = s iω m I p + P iω K ε s s iω + ε m 15 s iω Q ε s =Q ε = 1 s iω m I p + P iω K ε s 16 ε m K ε s =ε m K s iω /ε In [1] it is shown that U and U ε are unimodular We also have the bound Uε iω 1 U 1 for ε>0and ω R Lemma 6 If s iω εand ε 0 1 then there is a constant M K > 0 such that K ε s s iω m M K ε Proof From the definition of K ε s we get K ε s ε m s iω m = s iω m K s iω /ε ε m s iω m = 1 K l 1 K l s iω l ε l ε m l s iω m l 1 ε K l ε m l 1 1 ε K l Hence we can tae M K = m 1 K l Lemma 7 For s = iω and ω B the transfer matrix Hs can be written in the form Hs =I p +F ε su ε s 1 s iω m s iω + ε m 17 for sufficiently small ε>0and some constant M > 0 we have the bound F ε iω M ε for all ω B 18 1 M ε Proof Let s = iω and ω B Then I p + P sc ε s = I p + P iω K ε s P s P iω K ε s s iω m + s iω m K εl s + P s s iω l m l = l s iω m I p + P iω K ε s+a ε s s iω m A ε s = Ps Piω K ε s +s iω m K εl s P s s iω l m l l 19 Substituting s iω m I p + P iω K ε s =s iω + ε m U ε s from Eq 15 into Eq 19 results in I p + P sc ε s = s iω + ε m s iω m U ε s I p + T ε s 0 1 T ε s = s iω + ε m U ε s 1 A ε s = U εs 1 P s P iω K ε s s iω + ε m + s iω m U ε s 1 P s K εl s s iω + ε m s iω l m l l = U ε s 1 P s P iω G s iω /ε + s iω m U ε s 1 P s K εl s s iω + ε m s iω l m l l and G s = K s s+1 m Using the inequality iω iω 1 1 iω iω + ε the bound G iω iω /ε G and Lemma 6 we get T ε iω U 1 P iω P iω G + ε U 1 P n l M Kl
6 Because P Â 0 p m it is differentiable at iω and bounded on the imaginary axis Therefore there is a constant M P > 0 such that P iω P iω M P iω iω for every ω R Hence in B we have T ε iω M ε M = M P U 1 G + U 1 P n l M Kl Thus for sufficiently small positive ε we can expand I p + T ε iω 1 into a Neumann series I p + T ε iω 1 = I p + 1 n T ε iω n n=1 = I p + F ε iω and we have the bound F ε iω M ε n = M ε 1 M ε n=1 which proves 18 Taing the inverse of 0 gives 17 Now we are ready to prove Lemma Proof of Lemma a An arbitrary ω B c satisfies ω ω εfor = n n Hence from Lemma 6 we have for any ω B c P iωc ε iω ε P iω n = n M K M c ε n M c = P = n M K Clearly for sufficiently small ε we have P iωc ε iω < 1 Hence Hiω can be expanded into a Neumann series giving the bound Hiω We also have the bound e ε iω ε j e j iω 1 1 M c ε ε j Hiω rj + Piω w j ω ω j Hiω ε ε j 1 b rj + P b wj Hiω εnc Thus N c = brj + P b wj e ε iω = n = n e ε iω Hiω εnc ε 1 M c ε n = n N c 3 Because the right-hand side of 3 approaches zero as ε 0 and does not depend on r j w j or ω the result follows b If l we have e εl s =I p +F ε su ε s 1 s iω m s iω + ε m m l ε j r lj P sw lj s iω l j Let ω B be arbitrary From the inequalities ω ω l εand 1 and the bound 18 we get e εl iω 1+ F ε iω U ε iω 1 εncl ε U 1 N cl 1 M ε 4 N cl was defined in Eq Because the righthand side of 4 approaches zero as ε 0 and does not depend on r lj w lj or ω the claim follows c Using Eqs 15 and 16 we have and hence U ε s 1 s iω + ε m = 1 ε m Q ε s 1 e ε s =I p +F ε s U εs 1 s iω m s iω + ε m ε j r j Psw j s iω j =I p +F ε sq ε s 1 s iω m j ε m r j Psw j j
7 Let us define Y j s =Q s 1 s m j L ε s = F ε sy j s iω /ε r j Psw j Y j s iω /εps Piω w j Then e ε iω can be written in the form e ε s = Y j s iω /ε r j Piω w j + L ε s It is clear that the elements of Y j s are strictly proper Hence for each ω R and ε > 0 we have Y j iω iω /ε Y j Thus for ω B we have the bound εm Y j L ε iω brj + b wj P 1 M ε References [1] T Hämäläinen and S Pohjolainen A finite-dimensional robust controller for systems in the CD-algebra To be published in IEEE Transactions on Automatic Control in March 000 [] F M Callier and C A Desoer An algebra of transfer functions for distributed linear time-invariant systems IEEE Transactions on Circuits and Systems vol CAS- 5 pp Sept 1978 Corrections: CAS-6 p [3] M Vidyasagar Control System Synthesis: A Factorization Approach Cambridge Massachusetts: MIT Press 1985 [4] T Hämäläinen and S Pohjolainen On the asymptotically optimal tuning of robust controllers for systems in the CD-algebra Submitted to SIAM Journal on Control and Optimiztion + b wj Y j Piω P iω Because P Â 0 p m it is continuous at iω Therefore Hence lim sup P iω P iω =0 ω B sup L ε iω =0 ω B r w Maing the change of variable ω ω /ε = ωwe see that sup Y j iω iω /ε r j Piω w j ω B r w = sup ω <1/ Y j i ω r j Piω w j ε r w = sup sup Y j i ω r j Piω w j ω R r w Using the inequalities e ε iω Y j iω iω /ε r j Piω w j + L ε iω e ε iω Y j iω iω /ε r j Piω w j L ε iω the result follows
The Role of Exosystems in Output Regulation
1 The Role of Exosystems in Output Regulation Lassi Paunonen In this paper we study the role of the exosystem in the theory of output regulation for linear infinite-dimensional systems. The main result
More informationA Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems
A Necessary and Sufficient Condition for High-Frequency Robustness of Non-Strictly-Proper Feedback Systems Daniel Cobb Department of Electrical Engineering University of Wisconsin Madison WI 53706-1691
More informationReduced Order Internal Models in Robust Output Regulation
The final version of record is available at http://dx.doi.org/.9/tac.23.2257596 JOURNAL OF TRANSACTIONS ON AUTOMATIC CONTROL, VOL., NO., Reduced Order Internal Models in Robust Output Regulation Lassi
More informationLecture 13: Internal Model Principle and Repetitive Control
ME 233, UC Berkeley, Spring 2014 Xu Chen Lecture 13: Internal Model Principle and Repetitive Control Big picture review of integral control in PID design example: 0 Es) C s) Ds) + + P s) Y s) where P s)
More informationOn the continuity of the J-spectral factorization mapping
On the continuity of the J-spectral factorization mapping Orest V. Iftime University of Groningen Department of Mathematics and Computing Science PO Box 800, 9700 AV Groningen, The Netherlands Email: O.V.Iftime@math.rug.nl
More informationA Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case
A Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case ATARU KASE Osaka Institute of Technology Department of
More informationInfinite elementary divisor structure-preserving transformations for polynomial matrices
Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki
More informationChapter Robust Performance and Introduction to the Structured Singular Value Function Introduction As discussed in Lecture 0, a process is better desc
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter Robust
More informationQUANTITATIVE L P STABILITY ANALYSIS OF A CLASS OF LINEAR TIME-VARYING FEEDBACK SYSTEMS
Int. J. Appl. Math. Comput. Sci., 2003, Vol. 13, No. 2, 179 184 QUANTITATIVE L P STABILITY ANALYSIS OF A CLASS OF LINEAR TIME-VARYING FEEDBACK SYSTEMS PINI GURFIL Department of Mechanical and Aerospace
More informationDISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS
DISTANCE BETWEEN BEHAVIORS AND RATIONAL REPRESENTATIONS H.L. TRENTELMAN AND S.V. GOTTIMUKKALA Abstract. In this paper we study notions of distance between behaviors of linear differential systems. We introduce
More informationKrylov Techniques for Model Reduction of Second-Order Systems
Krylov Techniques for Model Reduction of Second-Order Systems A Vandendorpe and P Van Dooren February 4, 2004 Abstract The purpose of this paper is to present a Krylov technique for model reduction of
More informationStability Margin Based Design of Multivariable Controllers
Stability Margin Based Design of Multivariable Controllers Iván D. Díaz-Rodríguez Sangjin Han Shankar P. Bhattacharyya Dept. of Electrical and Computer Engineering Texas A&M University College Station,
More informationRobust Internal Model Control for Impulse Elimination of Singular Systems
International Journal of Control Science and Engineering ; (): -7 DOI:.59/j.control.. Robust Internal Model Control for Impulse Elimination of Singular Systems M. M. Share Pasandand *, H. D. Taghirad Department
More informationController Design for Robust Output Regulation of Regular Linear Systems
Controller Design for Robust Output Regulation of Regular Linear Systems L. Paunonen We present three dynamic error feedbac controllers for robust output regulation of regular linear systems. These controllers
More informationOPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY
published in IMA Journal of Numerical Analysis (IMAJNA), Vol. 23, 1-9, 23. OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY SIEGFRIED M. RUMP Abstract. In this note we give lower
More informationIntroduction. Performance and Robustness (Chapter 1) Advanced Control Systems Spring / 31
Introduction Classical Control Robust Control u(t) y(t) G u(t) G + y(t) G : nominal model G = G + : plant uncertainty Uncertainty sources : Structured : parametric uncertainty, multimodel uncertainty Unstructured
More informationProduct distance matrix of a tree with matrix weights
Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian
More informationModel Reduction for Unstable Systems
Model Reduction for Unstable Systems Klajdi Sinani Virginia Tech klajdi@vt.edu Advisor: Serkan Gugercin October 22, 2015 (VT) SIAM October 22, 2015 1 / 26 Overview 1 Introduction 2 Interpolatory Model
More informationMatrix Equations in Multivariable Control
Matrix Euations in Multivariable Control OMAN POKOP, JIŘÍ KOBEL Tomas Bata University in Zlín Nám. T.G.M. 5555, 76 Zlín CZECH EPUBLIC prokop@fai.utb.cz http://www.utb.cz/fai Abstract: - The contribution
More informationAPPLICATIONS FOR ROBOTICS
Version: 1 CONTROL APPLICATIONS FOR ROBOTICS TEX d: Feb. 17, 214 PREVIEW We show that the transfer function and conditions of stability for linear systems can be studied using Laplace transforms. Table
More informationParametric Nevanlinna-Pick Interpolation Theory
Proc Natl Sci Counc ROC(A) Vol, No 6, 1998 pp 73-733 Parametric Nevanlinna-Pick Interpolation Theory FANG-BO YEH*, CHIEN-CHANG LIN**, AND HUANG-NAN HUANG* *Department of Mathematics Tunghai University
More informationAn asymptotic ratio characterization of input-to-state stability
1 An asymptotic ratio characterization of input-to-state stability Daniel Liberzon and Hyungbo Shim Abstract For continuous-time nonlinear systems with inputs, we introduce the notion of an asymptotic
More informationChapter 2. Classical Control System Design. Dutch Institute of Systems and Control
Chapter 2 Classical Control System Design Overview Ch. 2. 2. Classical control system design Introduction Introduction Steady-state Steady-state errors errors Type Type k k systems systems Integral Integral
More informationMULTILOOP PI CONTROLLER FOR ACHIEVING SIMULTANEOUS TIME AND FREQUENCY DOMAIN SPECIFICATIONS
Journal of Engineering Science and Technology Vol. 1, No. 8 (215) 113-1115 School of Engineering, Taylor s University MULTILOOP PI CONTROLLER FOR ACHIEVING SIMULTANEOUS TIME AND FREQUENCY DOMAIN SPECIFICATIONS
More informationOn the Stabilization of Neutrally Stable Linear Discrete Time Systems
TWCCC Texas Wisconsin California Control Consortium Technical report number 2017 01 On the Stabilization of Neutrally Stable Linear Discrete Time Systems Travis J. Arnold and James B. Rawlings Department
More informationCONTROL DESIGN FOR SET POINT TRACKING
Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded
More informationRobust SPR Synthesis for Low-Order Polynomial Segments and Interval Polynomials
Robust SPR Synthesis for Low-Order Polynomial Segments and Interval Polynomials Long Wang ) and Wensheng Yu 2) ) Dept. of Mechanics and Engineering Science, Center for Systems and Control, Peking University,
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationPartial Fractions and the Coverup Method Haynes Miller and Jeremy Orloff
Partial Fractions and the Coverup Method 8.03 Haynes Miller and Jeremy Orloff *Much of this note is freely borrowed from an MIT 8.0 note written by Arthur Mattuck. Heaviside Cover-up Method. Introduction
More informationi=1 β i,i.e. = β 1 x β x β 1 1 xβ d
66 2. Every family of seminorms on a vector space containing a norm induces ahausdorff locally convex topology. 3. Given an open subset Ω of R d with the euclidean topology, the space C(Ω) of real valued
More informationControl of linear systems subject to time-domain constraints with polynomial pole placement and LMIs
Control of linear systems subject to time-domain constraints with polynomial pole placement and LMIs Didier Henrion 1,2,3,4 Sophie Tarbouriech 1 Vladimír Kučera 3,5 February 12, 2004 Abstract: The paper
More information(Continued on next page)
(Continued on next page) 18.2 Roots of Stability Nyquist Criterion 87 e(s) 1 S(s) = =, r(s) 1 + P (s)c(s) where P (s) represents the plant transfer function, and C(s) the compensator. The closedloop characteristic
More informationTime Response Analysis (Part II)
Time Response Analysis (Part II). A critically damped, continuous-time, second order system, when sampled, will have (in Z domain) (a) A simple pole (b) Double pole on real axis (c) Double pole on imaginary
More informationMaximizing the Closed Loop Asymptotic Decay Rate for the Two-Mass-Spring Control Problem
Maximizing the Closed Loop Asymptotic Decay Rate for the Two-Mass-Spring Control Problem Didier Henrion 1,2 Michael L. Overton 3 May 12, 2006 Abstract We consider the following problem: find a fixed-order
More informationChapter One. The Calderón-Zygmund Theory I: Ellipticity
Chapter One The Calderón-Zygmund Theory I: Ellipticity Our story begins with a classical situation: convolution with homogeneous, Calderón- Zygmund ( kernels on R n. Let S n 1 R n denote the unit sphere
More informationStability and composition of transfer functions
Problem 1.1 Stability and composition of transfer functions G. Fernández-Anaya Departamento de Ciencias Básicas Universidad Iberoaméricana Lomas de Santa Fe 01210 México D.F. México guillermo.fernandez@uia.mx
More informationDenis ARZELIER arzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.2 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS PERFORMANCE ANALYSIS and SYNTHESIS Denis ARZELIER www.laas.fr/ arzelier arzelier@laas.fr 15
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationRaktim Bhattacharya. . AERO 422: Active Controls for Aerospace Vehicles. Basic Feedback Analysis & Design
AERO 422: Active Controls for Aerospace Vehicles Basic Feedback Analysis & Design Raktim Bhattacharya Laboratory For Uncertainty Quantification Aerospace Engineering, Texas A&M University Routh s Stability
More informationNonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions
Nonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions Tingshu Hu Abstract This paper presents a nonlinear control design method for robust stabilization
More informationAnalysis of SISO Control Loops
Chapter 5 Analysis of SISO Control Loops Topics to be covered For a given controller and plant connected in feedback we ask and answer the following questions: Is the loop stable? What are the sensitivities
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationCDS Solutions to Final Exam
CDS 22 - Solutions to Final Exam Instructor: Danielle C Tarraf Fall 27 Problem (a) We will compute the H 2 norm of G using state-space methods (see Section 26 in DFT) We begin by finding a minimal state-space
More informationAPPENDIX C: Measure Theoretic Issues
APPENDIX C: Measure Theoretic Issues A general theory of stochastic dynamic programming must deal with the formidable mathematical questions that arise from the presence of uncountable probability spaces.
More informationInformation Structures Preserved Under Nonlinear Time-Varying Feedback
Information Structures Preserved Under Nonlinear Time-Varying Feedback Michael Rotkowitz Electrical Engineering Royal Institute of Technology (KTH) SE-100 44 Stockholm, Sweden Email: michael.rotkowitz@ee.kth.se
More informationRank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about
Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix
More informationarxiv: v1 [math.na] 25 Sep 2012
Kantorovich s Theorem on Newton s Method arxiv:1209.5704v1 [math.na] 25 Sep 2012 O. P. Ferreira B. F. Svaiter March 09, 2007 Abstract In this work we present a simplifyed proof of Kantorovich s Theorem
More informationRobustness Analysis and Controller Synthesis with Non-Normalized Coprime Factor Uncertainty Characterisation
211 5th IEEE onference on Decision and ontrol and European ontrol onference (D-E) Orlando, FL, USA, December 12-15, 211 Robustness Analysis and ontroller Synthesis with Non-Normalized oprime Factor Uncertainty
More informationNP-hardness of the stable matrix in unit interval family problem in discrete time
Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationProof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L
Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd
More informationZeros and zero dynamics
CHAPTER 4 Zeros and zero dynamics 41 Zero dynamics for SISO systems Consider a linear system defined by a strictly proper scalar transfer function that does not have any common zero and pole: g(s) =α p(s)
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationDesign Methods for Control Systems
Design Methods for Control Systems Maarten Steinbuch TU/e Gjerrit Meinsma UT Dutch Institute of Systems and Control Winter term 2002-2003 Schedule November 25 MSt December 2 MSt Homework # 1 December 9
More informationEECE 460 : Control System Design
EECE 460 : Control System Design SISO Pole Placement Guy A. Dumont UBC EECE January 2011 Guy A. Dumont (UBC EECE) EECE 460: Pole Placement January 2011 1 / 29 Contents 1 Preview 2 Polynomial Pole Placement
More informationFuzzy control of a class of multivariable nonlinear systems subject to parameter uncertainties: model reference approach
International Journal of Approximate Reasoning 6 (00) 9±44 www.elsevier.com/locate/ijar Fuzzy control of a class of multivariable nonlinear systems subject to parameter uncertainties: model reference approach
More informationStructured Stochastic Uncertainty
Structured Stochastic Uncertainty Bassam Bamieh Department of Mechanical Engineering University of California at Santa Barbara Santa Barbara, CA, 9306 bamieh@engineeringucsbedu Abstract We consider linear
More informationLecture 2. FRTN10 Multivariable Control. Automatic Control LTH, 2018
Lecture 2 FRTN10 Multivariable Control Course Outline L1 L5 Specifications, models and loop-shaping by hand 1 Introduction 2 Stability and robustness 3 Specifications and disturbance models 4 Control synthesis
More informationTransform Solutions to LTI Systems Part 3
Transform Solutions to LTI Systems Part 3 Example of second order system solution: Same example with increased damping: k=5 N/m, b=6 Ns/m, F=2 N, m=1 Kg Given x(0) = 0, x (0) = 0, find x(t). The revised
More informationA GENERALIZATION OF THE YOULA-KUČERA PARAMETRIZATION FOR MIMO STABILIZABLE SYSTEMS. Alban Quadrat
A GENERALIZATION OF THE YOULA-KUČERA ARAMETRIZATION FOR MIMO STABILIZABLE SYSTEMS Alban Quadrat INRIA Sophia Antipolis, CAFE project, 2004 Route des Lucioles, B 93, 06902 Sophia Antipolis cedex, France.
More informationFINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez
FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton
More informationChapter Stability Robustness Introduction Last chapter showed how the Nyquist stability criterion provides conditions for the stability robustness of
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter Stability
More informationEL2520 Control Theory and Practice
So far EL2520 Control Theory and Practice r Fr wu u G w z n Lecture 5: Multivariable systems -Fy Mikael Johansson School of Electrical Engineering KTH, Stockholm, Sweden SISO control revisited: Signal
More informationUNCERTAINTY MODELING VIA FREQUENCY DOMAIN MODEL VALIDATION
AIAA 99-3959 UNCERTAINTY MODELING VIA FREQUENCY DOMAIN MODEL VALIDATION Martin R. Waszak, * NASA Langley Research Center, Hampton, Virginia Dominick Andrisani II, Purdue University, West Lafayette, Indiana
More informationJUHA KINNUNEN. Harmonic Analysis
JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 12: I/O Stability Readings: DDV, Chapters 15, 16 Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology March 14, 2011 E. Frazzoli
More informationChapter 9 Robust Stability in SISO Systems 9. Introduction There are many reasons to use feedback control. As we have seen earlier, with the help of a
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 9 Robust
More informationOn the simultaneous diagonal stability of a pair of positive linear systems
On the simultaneous diagonal stability of a pair of positive linear systems Oliver Mason Hamilton Institute NUI Maynooth Ireland Robert Shorten Hamilton Institute NUI Maynooth Ireland Abstract In this
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationMAE 143B - Homework 9
MAE 43B - Homework 9 7.2 2 2 3.8.6.4.2.2 9 8 2 2 3 a) G(s) = (s+)(s+).4.6.8.2.2.4.6.8. Polar plot; red for negative ; no encirclements of, a.s. under unit feedback... 2 2 3. 4 9 2 2 3 h) G(s) = s+ s(s+)..2.4.6.8.2.4
More informationParametrization of All Strictly Causal Stabilizing Controllers of Multidimensional Systems single-input single-output case
Parametrization of All Strictly Causal Stabilizing Controllers of Multidimensional Systems single-input single-output case K. Mori Abstract We give a parametrization of all strictly causal stabilizing
More informationCONSIDER the linear discrete-time system
786 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 42, NO. 6, JUNE 1997 Optimal Damping of Forced Oscillations in Discrete-Time Systems Anders Lindquist, Fellow, IEEE, Vladimir A. Yakubovich Abstract In
More informationRecursive definitions on surreal numbers
Recursive definitions on surreal numbers Antongiulio Fornasiero 19th July 2005 Abstract Let No be Conway s class of surreal numbers. I will make explicit the notion of a function f on No recursively defined
More informationNon commutative Khintchine inequalities and Grothendieck s theo
Non commutative Khintchine inequalities and Grothendieck s theorem Nankai, 2007 Plan Non-commutative Khintchine inequalities 1 Non-commutative Khintchine inequalities 2 µ = Uniform probability on the set
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationAlternative Characterization of Ergodicity for Doubly Stochastic Chains
Alternative Characterization of Ergodicity for Doubly Stochastic Chains Behrouz Touri and Angelia Nedić Abstract In this paper we discuss the ergodicity of stochastic and doubly stochastic chains. We define
More informationSimultaneous global external and internal stabilization of linear time-invariant discrete-time systems subject to actuator saturation
011 American Control Conference on O'Farrell Street, San Francisco, CA, USA June 9 - July 01, 011 Simultaneous global external and internal stabilization of linear time-invariant discrete-time systems
More informationControl of Electromechanical Systems
Control of Electromechanical Systems November 3, 27 Exercise Consider the feedback control scheme of the motor speed ω in Fig., where the torque actuation includes a time constant τ A =. s and a disturbance
More informationA SHORT INTRODUCTION TO BANACH LATTICES AND
CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,
More informationOn the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 1: block Toeplitz algorithms.
On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 1: block Toeplitz algorithms. J.C. Zúñiga and D. Henrion Abstract Four different algorithms are designed
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationRobust Tuning of Power System Stabilizers Using Coefficient Diagram Method
International Journal of Electrical Engineering. ISSN 0974-2158 Volume 7, Number 2 (2014), pp. 257-270 International Research Publication House http://www.irphouse.com Robust Tuning of Power System Stabilizers
More informationT.8. Perron-Frobenius theory of positive matrices From: H.R. Thieme, Mathematics in Population Biology, Princeton University Press, Princeton 2003
T.8. Perron-Frobenius theory of positive matrices From: H.R. Thieme, Mathematics in Population Biology, Princeton University Press, Princeton 2003 A vector x R n is called positive, symbolically x > 0,
More informationA State-Space Approach to Control of Interconnected Systems
A State-Space Approach to Control of Interconnected Systems Part II: General Interconnections Cédric Langbort Center for the Mathematics of Information CALIFORNIA INSTITUTE OF TECHNOLOGY clangbort@ist.caltech.edu
More informationECEN 605 LINEAR SYSTEMS. Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability 1/27
1/27 ECEN 605 LINEAR SYSTEMS Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability Feedback System Consider the feedback system u + G ol (s) y Figure 1: A unity feedback system
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationStabilization of Distributed Parameter Systems by State Feedback with Positivity Constraints
Stabilization of Distributed Parameter Systems by State Feedback with Positivity Constraints Joseph Winkin Namur Center of Complex Systems (naxys) and Dept. of Mathematics, University of Namur, Belgium
More informationDefinable Extension Theorems in O-minimal Structures. Matthias Aschenbrenner University of California, Los Angeles
Definable Extension Theorems in O-minimal Structures Matthias Aschenbrenner University of California, Los Angeles 1 O-minimality Basic definitions and examples Geometry of definable sets Why o-minimal
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on
More information