w u P z K Figure 1: Model of the closed loop control sstem Model In this section the model for the control problems will be given. It is static, multi
|
|
- Quentin Terence Cain
- 5 years ago
- Views:
Transcription
1 Optimal Linear Static Control with Moment and Yield Objectives Anders Hansson, Stephen Bod, Lieven Vandenberghe and Miguel Sousa Lobo Information Sstems Laborator Stanford Universit, Stanford, CA 94305{4055, USA and Abstract This report describes how to optimize linear static control problems involving rst and second moments and ield objectives for Gaussian distributions. These problems can be cast as second-order cone programs, which is a class of convex optimization problems that can be solved ver ecientl. 1 Introduction Yield is of importance in man manufacturing processes. The prot can be directl proportional to the ield, or the ield can be related to qualit levels in a nonlinear wa, i.e. onl as long as a certain percentage of the production meets the desired qualit, the customer is paing full price for the product. In the former case it is desirable to maximize the ield, in the latter case it is most likel desirable to minimize the production cost subject to constraints on the ield. Both these problems will be addressed in this paper. In Section the model to be controlled will be dened. For simplicit onl a static model will be considered, but the results presented can easil be extended to the dnamic case using ideas like in [BB91]. Control of static sstems in the H1 framework has been described in [SP96], and static performance robustness of thermal processes has been described in [KKB94]. In Section 3 the control problems will be dened. Then in Section 4 the solution procedure will be outlined. It will be seen that the problems can be cast as Second-order Cone Programs (SOCP):s, which is a class of convex optimization problems that can be solved ver ecientl, see [LVB97]. In sections 5 and 6 some extensions and examples will be investigated. Finall, in Section 7, a few concluding remarks are given. 1
2 w u P z K Figure 1: Model of the closed loop control sstem Model In this section the model for the control problems will be given. It is static, multi-variable, and depicted in Figure 1. The equations relating the dierent variables are z = P u = K u w where w R l is the exogenous input, z R q is the output to be controlled, R p is the sensed output, u R m is the actuator input, and where K and P, Pzu P zw P w P u are matrices of compatible dimensions. The matrix P is given and describes the plant, whereas the matrix K, called the feedback gain, describes the controller; it is to be determined to optimize some objective. For K such that I, P u K is invertible the control problem is said to be well-posed, and simple algebra shows that z = Hw, where H, P zw P zu K(I, P u K),1 P w
3 Most objectives are convex in H, but unfortunatel not in K, which is the optimization-variable. However, this problem can be circumvented b the following linear-fractional transformation: which ields Q, K(I, P u K),1 H(Q) =P zw P zu QP w where H is now ane in Q. This transformation can also be extended to the dnamic case, see e.g. [BB91]. In case I QP u is invertible K can be computed as K =(IQP u ),1 Q The case when I QP u is not invertible is discussed in Appendix A. For the purpose of this report it will be assumed that w is a Gaussian random vector with mean w and covariances. The covariance ma be degenerate, i.e. need not be positive denite, onl positive semidenite. Notice that z is also Gaussian with mean and covariance m(q) (Q), E fz(q)g = H(Q)w, E n [z(q),m(q)] [z(q), m(q)] To = H(Q)H T (Q) respectivel. 3 Control Problems In this section control problems involving ield and rst and second moments will be dened. First it will be noticed that the second moment ofzis given b M(Q), E z(q)z T (Q) = H(Q), ww T H T (Q) Furthermore for an entr z i (Q), e T i z(q) ofz(q) it holds that the corresponding means, variances, and second moments are given b m i (Q) = e T i m(q) i (Q) = e T i (Q)e i M i (Q) = e T i M(Q)e i Notice that the are linear and quadratic in Q, respectivel. Finall the ield of the signal z i with respect to the level z i R is dened as Y i (Q), Prob fz i (Q) z i g 3
4 It can be expressed in the standard Gaussian distribution function () as zi,m i (Q) Y i (Q)= i (Q) Furthermore it holds that Y i (Q) i if and onl if z i, m i (Q) i (Q),1 ( i ) This follows from the fact that () is an increasing function.,1 ( i ) > 0 if and onl if i > 1=. It is now clear that the sets Notice that f(q; i ):m i (Q) i g; (Q; i ): i (Q)i (Q; i ):M i (Q)i ; fq:y i (Q) i >1=g are convex. Hence natural optimization problems to formulate are: minimize m 1 (Q); minimize M 1 (Q); minimize 1(Q) maximize Y 1 (Q) respectivel, subject to m i (Q) i ; i I m i (Q) i ; i I M i (Q) i ; i I M Y i (Q) i > 1=; i I Y where I m, I, I M, and I Y are subsets of f1; ;:::;qg. Notice that more general problems can be obtained b considering linear combinations of m i :s and positive linear combinations of i :s and M i :s, respectivel. For notational simplicit the details are not given. 4 Solution In this section the control problems of the previous section will be recast as SOCP problems. It is fairl straight forward to see that the constraints common to all optimization problems can be expressed as p H T 1 (Q) 0 i, H i (Q)w; i I m i ; i I 4
5 p ww T Hi T (Q),1 ( i ) p H T i (Q) i ; ii M z i,h i (Q)w; i I Y The additional expressions for the dierent optimization problems are Problem 1: minimize t s:t: 0 t, H 1 (Q)w Problem : minimize t s:t: p H T 1 (Q) t Problem 3: Problem 4: minimize t s:t: maximize t s:t: t p ww T H1(Q) T t p H T 1 (Q) z 1, H 1 (Q)w B the results in Appendix B problems 1{3 are all SOCP problems in Q and t, since,1 ( i ) > 0 for i > 1=. Furthermore Problem 4 is an SOCP feasibilit problem in Q for an xed value of t>0. Hence it can be solved b bisectioning over t>0. Notice that there exists a Q satisfing the inequalit for t>0ifand onl if there exist a Q such that Y 1 (Q) > 1=. w u P z u 0 K Figure : Model of the closed loop control sstem with an ane controller. 5
6 5 Ane Controllers In this section it will be shown how the model of Section can be used to accommodate not onl linear feedback but also ane feedback, see Figure. The equations for this are: z = P u w u = K u 0 Dene K and via u =[K u 0 ] 1, K and Pzw, Pu, Pw, and w via z = 4 P zu P zw 0 P u P w u w 1 3 5, Pzu Pzw u P u Pw w from which it follows that the ane controller can be cast in the linear framework b augmenting and w appropriatel. Notice how this formulation also covers the case u = u 0 as a special case. The dierent strategies will in the sequel be called u = u 0 : feed-forward u = K: feedback u = K u 0 : feedback/feed-forward Trade-O between Yield and Production Cost This example is designed to demonstrate the trade-o between ield and production cost when the latter is proportional to the energ of the control variable. The plant is depicted in Figure 3, and it can be described with the following set of equations: x = Gu v = x e where G R pm and where v and e are independent random vectors of appropriate dimensions with means v and e and covariances v and e, respectivel. The objective to minimize is given b M = mx i=1 M i ; M i =E u i ; i=1;;:::;m 6
7 v u G x e u 0 K Figure 3: Model of the closed loop control sstem for trade-o between ield and production cost. and the constraints are given b Y mi = Prob fx i z i g > 1=; i = 1; ;:::;p. This can be cast in the framework of sections and 3 b dening P zu = I ; P G zw = P u = G; P w =[I I] 0 0 I 0 and w T =[v T e T ], and = diag( v ; e ). The matrix G has been taken to have uniforml distributed random entries on [0; 1]. In the same wa the mean v has uniforml distributed random entries on [0; 1], and the covariances v and e are given b v =D T Dand e = E T E, where D and E are p p matrices with uniforml distributed p random entries on [0; 1]. The mean of e is given b e =0,and z i = v i e T i ve i. The number of variables in this example is m for the feed-forward case, mp for the feedback case, and m(p 1) for the feedback/feed-forward case. The number of constraints are p 1. The optimal values of M for m = 10, p = 0, =1:0, and values of 1 =0:51; 0:5;:::;0:98 are shown in Figure 4. It is seen that the pure feed-forward design is the most costl design and that the combined feedback/feed-forward design is the cheapest one. Notice that the trade-o curves not necessaril are concave, which, however, is the case in this example. The computational time was about 8 hours on a reasonabl fast computer. 6 Worst Case Exogenous Inputs In this section it will be shown how to consider worst case exogenous inputs. To this end let w k dene a set of Gaussian random vectors with means w k 7
8 alpha M Figure 4: Maximal ield versus cost for feed-forward solid line, feedback dashed line, and feedback/feed-forward dotted line and covariances k ; k I P, where I P is a nite index set. Problem 1 is then generalized to minimize Q maximize k m 1 (Q; k) subject to m i (Q; k) i ; i I m ;k I P i(q; k) i ; i I ;k I P M i (Q; k) i ; i I M ;k I P Y i (Q; k) i > 1=; i I Y ;k I P which can be rewritten as minimize t s:t: 0 t, H 1 (Q)w k ; k I P and 0 i, H i (Q)w k ; ii m ;k I P 8
9 q p k H T 1 (Q) p k Hi T (Q) k w k w T k HT i (Q),1 ( i ) i ; i I ;k I P i ; i I M ;k I P z i,h i (Q)w k ; ii Y ;k I P The other problems can be generalized in a similar fashion. T o o e o H K o v u 0 u G T r e r K r r Figure 5: Model of the closed loop control sstem for the heating example. Heating of a Room Consider the model describing heating of a room depicted in Figure 5, which can be described with the equations: T r = Gu HT ok v r = T r e r o = T o e o 9
10 where T r R is the room temperature, T ok R; k I P denes a set of outdoor temperatures ft ok : k I P g, v R is a random variable with zero mean and variance v, r R is the measurement of the room temperature, e r R is a random variable with zero mean and variance e r, o R is the measurement of the out-door temperature, and where e o R is a random variable with zero mean and variance e o. It is assumed that the random variables are independent of one another. The control signal u R is given b the feedback/feed-forward structure u = K r r K o o u 0 The objective istochoose K r, K o and u 0 as to minimize the maximal control 40 Power in W To in deg C P{19 < Tr < } To in deg C E{Tr} To in deg C Figure 6: Objectives and expected value of in-door temperature as functions of the out-door temperature. energ with respect to the set of out-door temperatures. The control energ is proportional to m 1 (k) =Efu(k)gas long as heating and not cooling is being performed. It would be desirable to perform the optimization subject to the constraint Y (k) = Prob T r T r (k) Tr > 0. This is however not possible, but a sucient condition is that Y (k) = Prob ft r T r (k)g 1 (1) 10
11 and Y 3 (k) = Prob T r (k) Tr 1 ( 1), which are the constraints that will be used. This problem can be cast in the framework of the previous sections b dening P zu = P u = 4 1 3,G5 ; Pzw = ,H,1 0 0 G H G H ; P 0 w = K = [ K r K o ]; w T k =[T ok v e r e o ] 3 5 and z = [,T r Tr ], and where the mean and covariance of w k are given b w k T =[T ok ] and k = diag(0;v ; e r ;e o ), respectivel. The solution for G =1 o C=W,H =1,T r =19 o C, Tr = o C, =0:80, v =3 o C, er =1 o C, eo = o C, and the set of out-door temperatures f,10; 0; 10; 0g o C is given b u =,1:1 r, 0:76 o 66 The closed loop behavior as a function of the out-door temperature is shown in Figure 6. 7 Conclusions In this paper is at been described how linear static control problems involving rst and second moments and ield objectives can be solved with ecient solvers for SOCP problems. Both feed-forward, feedback and feedback/feed-forward control has been addressed. It has been seen that about 00 variables are possible to optimize with respect to about 0 constraints. The computational time is a few minutes on a standard computer. Also it has been demonstrated how the optimization can be made robust with respect to dierent distributions of the exogenous inputs. Acknowledgements This work has been partl sponsored b the Swedish Research Council for Engineering Sciences under contract No. 95{838. References [BB91] S. Bod and C. H. Barratt. Linear Controller Design Limits of Performance. Prentice Hall, Englewood Clis, [KKB94] M. G. Kabuli, R. L. Kosut, and S. Bod. Improving static performance robustness of thermal processes. In Proceedings of the 33rd IEEE 11
12 Conference on Decision and Control, pages 6{66, Orlando, Florida, [LVB97] [SP96] M. S. Lobo, L. Vandenberghe, and S. Bod. Second-order cone programming. draft, Information Sstems Laborator, Stanford Universit, Stanford, California, R. Smith and A. Packard. Optimal control of perturbed linear static sstems. IEEE Transactions on Automatic Control, 41(4):579{584, Appendix A The control variable u can be computed in two dierent was. In case (I QP u )K = Q can be solved for K it is given b u = K. Notice that for an > 0 there is a Q such that jjh( Q), H(Q)jj and such that, I QPu K = Q has a solution. This means that it is possible to get arbitraril close to an H(Q) using the feedback structure u = K. However, the matrix K ma be large in a certain subspace. There is a wa toavoid this. Compute ~ as ~, P w w = 0, P u u 0 for some arbitrar u 0, where 0 is the corresponding measured output. Then compute u as u = Q~ = Q( 0, P u u 0 ) How this relates to digital control is now going to be discussed. Assume that the optimal control signal designed for the static sstem is used in a digital control application using zero order hold, and that the sample interval is much larger than the computational time so that the control signal can be written to the D/A converters almost immediatel after the measurement signal has been read from the A/D converters. Then the following set of equations are appropriate for describing the closed loop behavior: z(k) = P zu u(k)p zw w(k) (k) = P u u(k, 1) P w w(k) u(k) = Q((k), P u u(k, 1)) where k is time index, not to be confused with the k used to index the dierent probabilit measures in the previous section. Notice that the control signal can be written as u(k)qp u u(k, 1) = Q(k) 1
13 It is seen that the case when I QP u is not invertible corresponds to integral control, and hence it is not surprising that it cannot be implemented using just a static feedback controller u = K. B writing ^(k) = P zu u(k, 1) it holds that u(k) = Q~(k), where ~(k) = (k),^(k) can be interpreted as the estimation error when estimating (k) with ^(k). Notice that the observer is of dead-beat tpe, i.e. the estimation error is minimized as fast as possible. This follows from the fact that ~(k) =P w w(k). It is now clear that this problem setup is a special case of the general dnamic case described in [BB91]. Also notice that all the results in the main bod of the paper can be extended to the dnamic case including plants and controllers with poles on the stabilit boundar. Finall it is concluded that the closed loop sstem is stable. This follows from the fact that z(k) =H(Q)w(k), u(k) =QP w w(k) and that (k) = P u QP zw w(k, 1) P zw w(k). Appendix B In this appendix the SOCP:s will be recast in their standard form subject to To this end write min f T x x jja i x b i jj c T i x d i ; Q = where Q i R m1 and dene Notice that Q T P T zu e i = 8 >: i I L 8 : Q1 Q Q p 9 ; q = Q T 1 P T zue i Q T P T zu e i. Q T p Pzue T i 8 >: 9 Q 1 Q. Q p 9 >; 8 >; = >: e T i P zuq 1 e T i P zuq 9. >; = S iq e T i P zuq p where S i = diag(e T i P zu) with p blocks. So with Ai (D) =DP T ws j and b j (D) = DP T zwe i it holds that Now write DH T i (Q) =DP T zw e i DP T w QT P T zu e i = Ai (D)q b i (D) P w w = 13 8 >: t 1 t. t p 9 >;
14 Then it holds that where T = QP w w = Tq 8 : t1 I m t I m t p I m 9 ; So with c T i = e T i P zut and d i = e T i P zw w it holds that H i (Q)w=e T i P zw w e T i P zuqp w w =c T i q d i For Problem 4 dene x = q and for the other problems dene x T = 8 9 : t q T ;. The rest of the boring book-keeping is left as an exercise to the reader. Notice that the extension to linear combinations discussed at the end of Section 3 is obtained b stacking more rows to A i and b i. Furthermore the extension to worst case distributions discussed in Section 6 is obtained b having one constraint for each distribution. 14
Chapter 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 informationQUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS
Journal of the Operations Research Societ of Japan 008, Vol. 51, No., 191-01 QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS Tomonari Kitahara Shinji Mizuno Kazuhide Nakata Toko Institute of Technolog
More informationIn: Proc. BENELEARN-98, 8th Belgian-Dutch Conference on Machine Learning, pp 9-46, 998 Linear Quadratic Regulation using Reinforcement Learning Stephan ten Hagen? and Ben Krose Department of Mathematics,
More informationThe model reduction algorithm proposed is based on an iterative two-step LMI scheme. The convergence of the algorithm is not analyzed but examples sho
Model Reduction from an H 1 /LMI perspective A. Helmersson Department of Electrical Engineering Linkoping University S-581 8 Linkoping, Sweden tel: +6 1 816 fax: +6 1 86 email: andersh@isy.liu.se September
More informationOptimization in. Stephen Boyd. 3rd SIAM Conf. Control & Applications. and Control Theory. System. Convex
Optimization in Convex and Control Theory System Stephen Boyd Engineering Department Electrical University Stanford 3rd SIAM Conf. Control & Applications 1 Basic idea Many problems arising in system and
More informationAn LQ R weight selection approach to the discrete generalized H 2 control problem
INT. J. CONTROL, 1998, VOL. 71, NO. 1, 93± 11 An LQ R weight selection approach to the discrete generalized H 2 control problem D. A. WILSON², M. A. NEKOUI² and G. D. HALIKIAS² It is known that a generalized
More informationAcid con- Exposure dose. Resist. Dissolution. rate. profile. centration. C(x,z) R(x,z) z(x) Photoresist. z Wafer
Optimal temperature proles for post-exposure bake of photo-resist Anders Hansson and Stephen Boyd Information Systems Laboratory Stanford University Stanford, CA 9435{95 ABSTRACT In this paper it is shown
More informationRANGE CONTROL MPC APPROACH FOR TWO-DIMENSIONAL SYSTEM 1
RANGE CONTROL MPC APPROACH FOR TWO-DIMENSIONAL SYSTEM Jirka Roubal Vladimír Havlena Department of Control Engineering, Facult of Electrical Engineering, Czech Technical Universit in Prague Karlovo náměstí
More informationLinear programming: Theory
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analsis and Economic Theor Winter 2018 Topic 28: Linear programming: Theor 28.1 The saddlepoint theorem for linear programming The
More informationLet X denote a random variable, and z = h(x) a function of x. Consider the
EE385 Class Notes 11/13/01 John Stensb Chapter 5 Moments and Conditional Statistics Let denote a random variable, and z = h(x) a function of x. Consider the transformation Z = h(). We saw that we could
More information1.1 Notations We dene X (s) =X T (;s), X T denotes the transpose of X X>()0 a symmetric, positive denite (semidenite) matrix diag [X 1 X ] a block-dia
Applications of mixed -synthesis using the passivity approach A. Helmersson Department of Electrical Engineering Linkoping University S-581 83 Linkoping, Sweden tel: +46 13 816 fax: +46 13 86 email: andersh@isy.liu.se
More informationIran University of Science and Technology, Tehran 16844, IRAN
DECENTRALIZED DECOUPLED SLIDING-MODE CONTROL FOR TWO- DIMENSIONAL INVERTED PENDULUM USING NEURO-FUZZY MODELING Mohammad Farrokhi and Ali Ghanbarie Iran Universit of Science and Technolog, Tehran 6844,
More informationLocal Modelling with A Priori Known Bounds Using Direct Weight Optimization
Local Modelling with A Priori Known Bounds Using Direct Weight Optimization Jacob Roll, Alexander azin, Lennart Ljung Division of Automatic Control Department of Electrical Engineering Linköpings universitet,
More informationPICONE S IDENTITY FOR A SYSTEM OF FIRST-ORDER NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS
Electronic Journal of Differential Equations, Vol. 2013 (2013), No. 143, pp. 1 7. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu PICONE S IDENTITY
More informationAPPENDIX D Rotation and the General Second-Degree Equation
APPENDIX D Rotation and the General Second-Degree Equation Rotation of Aes Invariants Under Rotation After rotation of the - and -aes counterclockwise through an angle, the rotated aes are denoted as the
More informationw 1... w L z 1... w e z r
Multiobjective H H 1 -Optimal Control via Finite Dimensional Q-Parametrization and Linear Matrix Inequalities 1 Haitham A. Hindi Babak Hassibi Stephen P. Boyd Department of Electrical Engineering, Durand
More informationCost-detectability and Stability of Adaptive Control Systems
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 12-15, 2005 TuC04.2 Cost-detectabilit and Stabilit of Adaptive Control
More informationIdentification of Nonlinear Dynamic Systems with Multiple Inputs and Single Output using discrete-time Volterra Type Equations
Identification of Nonlinear Dnamic Sstems with Multiple Inputs and Single Output using discrete-time Volterra Tpe Equations Thomas Treichl, Stefan Hofmann, Dierk Schröder Institute for Electrical Drive
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 informationOn Maximizing the Second Smallest Eigenvalue of a State-dependent Graph Laplacian
25 American Control Conference June 8-, 25. Portland, OR, USA WeA3.6 On Maimizing the Second Smallest Eigenvalue of a State-dependent Graph Laplacian Yoonsoo Kim and Mehran Mesbahi Abstract We consider
More informationStability Analysis for Linear Systems under State Constraints
Stabilit Analsis for Linear Sstems under State Constraints Haijun Fang Abstract This paper revisits the problem of stabilit analsis for linear sstems under state constraints New and less conservative sufficient
More informationParameterized Joint Densities with Gaussian and Gaussian Mixture Marginals
Parameterized Joint Densities with Gaussian and Gaussian Miture Marginals Feli Sawo, Dietrich Brunn, and Uwe D. Hanebeck Intelligent Sensor-Actuator-Sstems Laborator Institute of Computer Science and Engineering
More information1.2 Relations. 20 Relations and Functions
0 Relations and Functions. Relations From one point of view, all of Precalculus can be thought of as studing sets of points in the plane. With the Cartesian Plane now fresh in our memor we can discuss
More informationVariable-gain output feedback control
7. Variable-gain output feedback control 7.1. Introduction PUC-Rio - Certificação Digital Nº 611865/CA In designing control laws, the usual first step is to describe the plant at a given operating point
More informationA Worst-Case Estimate of Stability Probability for Engineering Drive
A Worst-Case Estimate of Stability Probability for Polynomials with Multilinear Uncertainty Structure Sheila R. Ross and B. Ross Barmish Department of Electrical and Computer Engineering University of
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 informationGauss and Gauss Jordan Elimination
Gauss and Gauss Jordan Elimination Row-echelon form: (,, ) A matri is said to be in row echelon form if it has the following three properties. () All row consisting entirel of zeros occur at the bottom
More informationProblem Description The problem we consider is stabilization of a single-input multiple-state system with simultaneous magnitude and rate saturations,
SEMI-GLOBAL RESULTS ON STABILIZATION OF LINEAR SYSTEMS WITH INPUT RATE AND MAGNITUDE SATURATIONS Trygve Lauvdal and Thor I. Fossen y Norwegian University of Science and Technology, N-7 Trondheim, NORWAY.
More information8.7 Systems of Non-Linear Equations and Inequalities
8.7 Sstems of Non-Linear Equations and Inequalities 67 8.7 Sstems of Non-Linear Equations and Inequalities In this section, we stud sstems of non-linear equations and inequalities. Unlike the sstems of
More informationLinear Systems with Saturating Controls: An LMI Approach. subject to control saturation. No assumption is made concerning open-loop stability and no
Output Feedback Robust Stabilization of Uncertain Linear Systems with Saturating Controls: An LMI Approach Didier Henrion 1 Sophie Tarbouriech 1; Germain Garcia 1; Abstract : The problem of robust controller
More informationAffine transformations
Reading Optional reading: Affine transformations Brian Curless CSE 557 Autumn 207 Angel and Shreiner: 3., 3.7-3. Marschner and Shirle: 2.3, 2.4.-2.4.4, 6..-6..4, 6.2., 6.3 Further reading: Angel, the rest
More informationTwo Dimensional Linear Systems of ODEs
34 CHAPTER 3 Two Dimensional Linear Sstems of ODEs A first-der, autonomous, homogeneous linear sstem of two ODEs has the fm x t ax + b, t cx + d where a, b, c, d are real constants The matrix fm is 31
More informationNotes on Convexity. Roy Radner Stern School, NYU. September 11, 2006
Notes on Convexit Ro Radner Stern School, NYU September, 2006 Abstract These notes are intended to complement the material in an intermediate microeconomic theor course. In particular, the provide a rigorous
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationStructured Stochastic Uncertainty
Structured Stochastic Uncertaint Bassam Bamieh Mechanical Engineering, UNIVERSITY OF CALIFORNIA AT SANTA BARBARA () Allerton, Oct 12 1 / 13 Stochastic Perturbations u M Perturbations are iid gains: u(k)
More informationPitch Rate CAS Design Project
Pitch Rate CAS Design Project Washington University in St. Louis MAE 433 Control Systems Bob Rowe 4.4.7 Design Project Part 2 This is the second part of an ongoing project to design a control and stability
More informationSEPARABLE EQUATIONS 2.2
46 CHAPTER FIRST-ORDER DIFFERENTIAL EQUATIONS 4. Chemical Reactions When certain kinds of chemicals are combined, the rate at which the new compound is formed is modeled b the autonomous differential equation
More informationDeterminant maximization with linear. S. Boyd, L. Vandenberghe, S.-P. Wu. Information Systems Laboratory. Stanford University
Determinant maximization with linear matrix inequality constraints S. Boyd, L. Vandenberghe, S.-P. Wu Information Systems Laboratory Stanford University SCCM Seminar 5 February 1996 1 MAXDET problem denition
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures AB = BA = I,
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 7 MATRICES II Inverse of a matri Sstems of linear equations Solution of sets of linear equations elimination methods 4
More information2 Ordinary Differential Equations: Initial Value Problems
Ordinar Differential Equations: Initial Value Problems Read sections 9., (9. for information), 9.3, 9.3., 9.3. (up to p. 396), 9.3.6. Review questions 9.3, 9.4, 9.8, 9.9, 9.4 9.6.. Two Examples.. Foxes
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 informationBASE VECTORS FOR SOLVING OF PARTIAL DIFFERENTIAL EQUATIONS
BASE VECTORS FOR SOLVING OF PARTIAL DIFFERENTIAL EQUATIONS J. Roubal, V. Havlena Department of Control Engineering, Facult of Electrical Engineering, Czech Technical Universit in Prague Abstract The distributed
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationRobust Fisher Discriminant Analysis
Robust Fisher Discriminant Analysis Seung-Jean Kim Alessandro Magnani Stephen P. Boyd Information Systems Laboratory Electrical Engineering Department, Stanford University Stanford, CA 94305-9510 sjkim@stanford.edu
More informationRobust Least Squares and Applications Laurent El Ghaoui and Herve Lebret Ecole Nationale Superieure de Techniques Avancees 3, Bd. Victor, 7739 Paris, France (elghaoui, lebret)@ensta.fr Abstract We consider
More informationState Estimation with Nonlinear Inequality Constraints Based on Unscented Transformation
14th International Conference on Information Fusion Chicago, Illinois, USA, Jul 5-8, 2011 State Estimation with Nonlinear Inequalit Constraints Based on Unscented Transformation Jian Lan Center for Information
More informationStochastic Interpretation for the Arimoto Algorithm
Stochastic Interpretation for the Arimoto Algorithm Serge Tridenski EE - Sstems Department Tel Aviv Universit Tel Aviv, Israel Email: sergetr@post.tau.ac.il Ram Zamir EE - Sstems Department Tel Aviv Universit
More informationChapter 6. Self-Adjusting Data Structures
Chapter 6 Self-Adjusting Data Structures Chapter 5 describes a data structure that is able to achieve an epected quer time that is proportional to the entrop of the quer distribution. The most interesting
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationLikelihood Bounds for Constrained Estimation with Uncertainty
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 5 Seville, Spain, December -5, 5 WeC4. Likelihood Bounds for Constrained Estimation with Uncertainty
More informationJune Engineering Department, Stanford University. System Analysis and Synthesis. Linear Matrix Inequalities. Stephen Boyd (E.
Stephen Boyd (E. Feron :::) System Analysis and Synthesis Control Linear Matrix Inequalities via Engineering Department, Stanford University Electrical June 1993 ACC, 1 linear matrix inequalities (LMIs)
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationCover page. : On-line damage identication using model based orthonormal. functions. Author : Raymond A. de Callafon
Cover page Title : On-line damage identication using model based orthonormal functions Author : Raymond A. de Callafon ABSTRACT In this paper, a new on-line damage identication method is proposed for monitoring
More information7.1 Solving Linear Systems by Graphing
7.1 Solving Linear Sstems b Graphing Objectives: Learn how to solve a sstem of linear equations b graphing Learn how to model a real-life situation using a sstem of linear equations With an equation, an
More informationSolution: a) Let us consider the matrix form of the system, focusing on the augmented matrix: 0 k k + 1. k 2 1 = 0. k = 1
Exercise. Given the system of equations 8 < : x + y + z x + y + z k x + k y + z k where k R. a) Study the system in terms of the values of k. b) Find the solutions when k, using the reduced row echelon
More informationSupervisory Control of Petri Nets with. Uncontrollable/Unobservable Transitions. John O. Moody and Panos J. Antsaklis
Supervisory Control of Petri Nets with Uncontrollable/Unobservable Transitions John O. Moody and Panos J. Antsaklis Department of Electrical Engineering University of Notre Dame, Notre Dame, IN 46556 USA
More informationH 1 optimisation. Is hoped that the practical advantages of receding horizon control might be combined with the robustness advantages of H 1 control.
A game theoretic approach to moving horizon control Sanjay Lall and Keith Glover Abstract A control law is constructed for a linear time varying system by solving a two player zero sum dierential game
More informationSection 1.2: Relations, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons
Section.: Relations, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license. 0, Carl Stitz.
More information/97/$10.00 (c) 1997 AACC
Optimal Random Perturbations for Stochastic Approximation using a Simultaneous Perturbation Gradient Approximation 1 PAYMAN SADEGH, and JAMES C. SPALL y y Dept. of Mathematical Modeling, Technical University
More informationLearning with Ensembles: How. over-tting can be useful. Anders Krogh Copenhagen, Denmark. Abstract
Published in: Advances in Neural Information Processing Systems 8, D S Touretzky, M C Mozer, and M E Hasselmo (eds.), MIT Press, Cambridge, MA, pages 190-196, 1996. Learning with Ensembles: How over-tting
More informationy x can be solved using the quadratic equation Y1 ( x 5), then the other is
Math 0 Precalculus Sstem of Equation Review Questions Multiple Choice. The sstem of equations A. 7 0 7 0 0 0 and can be solved using the quadratic equation. In solving the quadratic equation 0 ( ) intersection
More informationDeterminants. We said in Section 3.3 that a 2 2 matrix a b. Determinant of an n n Matrix
3.6 Determinants We said in Section 3.3 that a 2 2 matri a b is invertible if and onl if its c d erminant, ad bc, is nonzero, and we saw the erminant used in the formula for the inverse of a 2 2 matri.
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationFIR Filter Design via Semidenite Programming and Spectral Factorization Shao-Po Wu, Stephen Boyd, Lieven Vandenberghe Information Systems Laboratory Stanford University, Stanford, CA 9435 clive@isl.stanford.edu,
More informationON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS. Abstract. We introduce a wide class of asymmetric loss functions and show how to obtain
ON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS FUNCTIONS Michael Baron Received: Abstract We introduce a wide class of asymmetric loss functions and show how to obtain asymmetric-type optimal decision
More informationWeek 3 September 5-7.
MA322 Weekl topics and quiz preparations Week 3 September 5-7. Topics These are alread partl covered in lectures. We collect the details for convenience.. Solutions of homogeneous equations AX =. 2. Using
More information1 New advances in nonlinear convex optimization A linear program (LP) is an optimization problem with linear objective and linear equality and inequal
Control Applications of Nonlinear Convex Programming Stephen Boyd 1, Cesar Crusius 2, Anders Hansson 3 Information Systems Laboratory, Electrical Engineering Department, Stanford University Abstract Since
More informationTHIS paper deals with robust control in the setup associated
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 50, NO 10, OCTOBER 2005 1501 Control-Oriented Model Validation and Errors Quantification in the `1 Setup V F Sokolov Abstract A priori information required for
More informationNonlinear and Cooperative Control of Multiple Hovercraft with Input Constraints
Submitted as a Regular Paper to the European Control Conference Revised: December 8, Nonlinear and Cooperative Control of Multiple Hovercraft with Input Constraints William B. Dunbar, Reza Olfati-Saber,
More information6. Vector Random Variables
6. Vector Random Variables In the previous chapter we presented methods for dealing with two random variables. In this chapter we etend these methods to the case of n random variables in the following
More informationA Convex Characterization of Multidimensional Linear Systems Subject to SQI Constraints
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 62, NO 6, JUNE 2017 2981 A Convex Characterization of Multidimensional Linear Systems Subject to SQI Constraints Şerban Sabău, Nuno C Martins, and Michael C
More informationand the nite horizon cost index with the nite terminal weighting matrix F > : N?1 X J(z r ; u; w) = [z(n)? z r (N)] T F [z(n)? z r (N)] + t= [kz? z r
Intervalwise Receding Horizon H 1 -Tracking Control for Discrete Linear Periodic Systems Ki Baek Kim, Jae-Won Lee, Young Il. Lee, and Wook Hyun Kwon School of Electrical Engineering Seoul National University,
More informationLyapunov Stability of Linear Predictor Feedback for Distributed Input Delays
IEEE TRANSACTIONS ON AUTOMATIC CONTROL VOL. 56 NO. 3 MARCH 2011 655 Lyapunov Stability of Linear Predictor Feedback for Distributed Input Delays Nikolaos Bekiaris-Liberis Miroslav Krstic In this case system
More informationA New Closed-loop Identification Method of a Hammerstein-type System with a Pure Time Delay
A New Closed-loop Identification Method of a Hammerstein-tpe Sstem with a Pure Time Dela Edin Drljević a, Branislava Peruničić b, Željko Jurić c, Member of IEEE Abstract A procedure for the closed-loop
More informationStochastic Subgradient Methods
Stochastic Subgradient Methods Stephen Boyd and Almir Mutapcic Notes for EE364b, Stanford University, Winter 26-7 April 13, 28 1 Noisy unbiased subgradient Suppose f : R n R is a convex function. We say
More informationPerturbation Theory for Variational Inference
Perturbation heor for Variational Inference Manfred Opper U Berlin Marco Fraccaro echnical Universit of Denmark Ulrich Paquet Apple Ale Susemihl U Berlin Ole Winther echnical Universit of Denmark Abstract
More informationOn GMW designs and a conjecture of Assmus and Key Thomas E. Norwood and Qing Xiang Dept. of Mathematics, California Institute of Technology, Pasadena,
On GMW designs and a conjecture of Assmus and Key Thomas E. Norwood and Qing iang Dept. of Mathematics, California Institute of Technology, Pasadena, CA 91125 June 24, 1998 Abstract We show that a family
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More information1 Introduction Semidenite programming (SDP) has been an active research area following the seminal work of Nesterov and Nemirovski [9] see also Alizad
Quadratic Maximization and Semidenite Relaxation Shuzhong Zhang Econometric Institute Erasmus University P.O. Box 1738 3000 DR Rotterdam The Netherlands email: zhang@few.eur.nl fax: +31-10-408916 August,
More information12.1 Systems of Linear equations: Substitution and Elimination
. Sstems of Linear equations: Substitution and Elimination Sstems of two linear equations in two variables A sstem of equations is a collection of two or more equations. A solution of a sstem in two variables
More informationNumerical Methods I Solving Square Linear Systems: GEM and LU factorization
Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 18th,
More informationBCOL RESEARCH REPORT 07.04
BCOL RESEARCH REPORT 07.04 Industrial Engineering & Operations Research University of California, Berkeley, CA 94720-1777 LIFTING FOR CONIC MIXED-INTEGER PROGRAMMING ALPER ATAMTÜRK AND VISHNU NARAYANAN
More informationEDEXCEL ANALYTICAL METHODS FOR ENGINEERS H1 UNIT 2 - NQF LEVEL 4 OUTCOME 4 - STATISTICS AND PROBABILITY TUTORIAL 3 LINEAR REGRESSION
EDEXCEL AALYTICAL METHODS FOR EGIEERS H1 UIT - QF LEVEL 4 OUTCOME 4 - STATISTICS AD PROBABILITY TUTORIAL 3 LIEAR REGRESSIO Tabular and graphical form: data collection methods; histograms; bar charts; line
More informationMath Camp Notes: Linear Algebra I
Math Camp Notes: Linear Algebra I Basic Matrix Operations and Properties Consider two n m matrices: a a m A = a n a nm Then the basic matrix operations are as follows: a + b a m + b m A + B = a n + b n
More informationSupplement: Efficient Global Point Cloud Alignment using Bayesian Nonparametric Mixtures
Supplement: Efficient Global Point Cloud Alignment using Bayesian Nonparametric Mixtures Julian Straub Trevor Campbell Jonathan P. How John W. Fisher III Massachusetts Institute of Technology 1. Rotational
More informationg(.) 1/ N 1/ N Decision Decision Device u u u u CP
Distributed Weak Signal Detection and Asymptotic Relative Eciency in Dependent Noise Hakan Delic Signal and Image Processing Laboratory (BUSI) Department of Electrical and Electronics Engineering Bogazici
More informationThe Uniformity Principle: A New Tool for. Probabilistic Robustness Analysis. B. R. Barmish and C. M. Lagoa. further discussion.
The Uniformity Principle A New Tool for Probabilistic Robustness Analysis B. R. Barmish and C. M. Lagoa Department of Electrical and Computer Engineering University of Wisconsin-Madison, Madison, WI 53706
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationOn the design of Incremental ΣΔ Converters
M. Belloni, C. Della Fiore, F. Maloberti, M. Garcia Andrade: "On the design of Incremental ΣΔ Converters"; IEEE Northeast Workshop on Circuits and Sstems, NEWCAS 27, Montreal, 5-8 August 27, pp. 376-379.
More informationChapter 1: Systems of Linear Equations and Matrices
: Systems of Linear Equations and Matrices Multiple Choice Questions. Which of the following equations is linear? (A) x + 3x 3 + 4x 4 3 = 5 (B) 3x x + x 3 = 5 (C) 5x + 5 x x 3 = x + cos (x ) + 4x 3 = 7.
More informationELE539A: Optimization of Communication Systems Lecture 6: Quadratic Programming, Geometric Programming, and Applications
ELE539A: Optimization of Communication Systems Lecture 6: Quadratic Programming, Geometric Programming, and Applications Professor M. Chiang Electrical Engineering Department, Princeton University February
More information3.1 Exponential Functions and Their Graphs
.1 Eponential Functions and Their Graphs Sllabus Objective: 9.1 The student will sketch the graph of a eponential, logistic, or logarithmic function. 9. The student will evaluate eponential or logarithmic
More informationConsider a slender rod, fixed at one end and stretched, as illustrated in Fig ; the original position of the rod is shown dotted.
4.1 Strain If an object is placed on a table and then the table is moved, each material particle moves in space. The particles undergo a displacement. The particles have moved in space as a rigid bod.
More informationEigenstructure Assignment for Helicopter Hover Control
Proceedings of the 17th World Congress The International Federation of Automatic Control Eigenstructure Assignment for Helicopter Hover Control Andrew Pomfret Stuart Griffin Tim Clarke Department of Electronics,
More informationREGLERTEKNIK AUTOMATIC CONTROL LINKÖPING
Invariant Sets for a Class of Hybrid Systems Mats Jirstrand Department of Electrical Engineering Linkoping University, S-581 83 Linkoping, Sweden WWW: http://www.control.isy.liu.se Email: matsj@isy.liu.se
More informationForce Couple Systems = Replacement of a Force with an Equivalent Force and Moment (Moving a Force to Another Point)
orce Couple Sstems = eplacement of a orce with an Equivalent orce and oment (oving a orce to Another Point) The force acting on a bod has two effects: The first one is the tendenc to push or pull the bod
More informationMATH 829: Introduction to Data Mining and Analysis Graphical Models I
MATH 829: Introduction to Data Mining and Analysis Graphical Models I Dominique Guillot Departments of Mathematical Sciences University of Delaware May 2, 2016 1/12 Independence and conditional independence:
More informationDecentralized LQG Control of Systems with a Broadcast Architecture
Decentralized LQG Control of Systems with a Broadcast Architecture Laurent Lessard 1,2 IEEE Conference on Decision and Control, pp. 6241 6246, 212 Abstract In this paper, we consider dynamical subsystems
More information5. Nonholonomic constraint Mechanics of Manipulation
5. Nonholonomic constraint Mechanics of Manipulation Matt Mason matt.mason@cs.cmu.edu http://www.cs.cmu.edu/~mason Carnegie Mellon Lecture 5. Mechanics of Manipulation p.1 Lecture 5. Nonholonomic constraint.
More informationChapter 15. Solving the Controller Design Problem
Chapter 15 Solving the Controller Design Problem In this chapter we describe methods for forming and solving nite-dimensional approximations to the controller design problem. A method based on the parametrization
More information