Robust observed-state feedback design. for discrete-time systems rational in the uncertainties
|
|
- Allyson Rice
- 5 years ago
- Views:
Transcription
1 Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart Extends results from two papers presented at 19th IFAC World Congress (Cape Town). Results submtted to Automatca: hal.archves-ouvertes.fr/hal v1
2 Motvaton n Lterature full of robust state-feedback desgn results, few for robust observer desgn n Output or state estmaton flter 6= Observer (no open loop stablty assumpton) n Observers of states n gven state-space + assumng MIMO systems.e. not restrcted to SISO systems n canoncal form (ntegrators n seres) ẋ = x (f(x, )+g(x, )u) 7 5 D. Peaucelle 1 May 10, 016
3 Motvaton n Dscrete-tme lnear system wth uncertantes x k+1 = A r ( )x k + B r ( )u k, y k = Cx k n Luenberger-lke observer ˆx k+1 = A oˆx k + B o u k + L(C ˆx k y k ) n Observed-state feedback u k = K ˆx k l Our goals: s Buld a separaton-lke heurstc wth frst, K desgn, then, A o,b o,ldesgn s Use up-to-date SV-LMI tools s For systems ratonal n the uncertantes D. Peaucelle May 10, 016
4 Motvaton n Closed-loop dynamcs (state x and error e = x 0 x k+1 e k+1 A = ˆx) drven by the state matrx 4 A r( )+B r ( )K B r ( )K A( )+ B ( )K A o + LC B( )K where A( ) =A r ( ) A o and B( ) =B r ( ) B o. 0 x k e k 1 A l Separaton obtaned when A( ) =0and B( ) =0 0 x k+1 A = 4 A r( )+B r ( )K B r ( )K e k+1 0 A o + LC 0 x k e k 1 A s Impossble when are uncertantes (Noton of observed-state not qute defned for uncertan systems) D. Peaucelle May 10, 016
5 Motvaton n Closed-loop dynamcs (state x and error e = x 0 x k+1 e k+1 A = ˆx) drven by the state matrx 4 A r( )+B r ( )K B r ( )K A( )+ B ( )K A o + LC B( )K where A( ) =A r ( ) A o and B( ) =B r ( ) B o. 0 x k e k 1 A s Choces from the lterature: A o = A r ( nom ), but why? s Possble choce mn Ao max ka r ( ) A o k, but what propertes? l Our choce: optmze the nput/output performances of e k+1 =(A o + LC B( )K)e k +( A( )+ B ( )K)x k, k = Ke k where x k s treated as the nput and k s the output. D. Peaucelle 4 May 10, 016
6 Outlne Descrptor mult-affne modelng of ratonal systems LMI results for robust desgn and robust analyss Observed-state feedback desgn heurstc π Example D. Peaucelle 5 May 10, 016
7 Descrptor mult-affne modelng of ratonal systems n p ndependent uncertan vectors p R m p ndexed by p =1 p = {( 1,..., p ) 1... p }. n o n Each p n a polytope wth v p vertces V p = p [1],..., [ v p] p p = Co(V p )= ( p = v p X v=1 p,v [v] p : p,v 0, v p X v=1 p,v =1 l Example: scalar uncertanty n an nterval: p [ [1] p, [] p ]. l Example: D vector n convex hull of ponts ssued from dentfcaton process ). D. Peaucelle 6 May 10, 016
8 Descrptor mult-affne modelng of ratonal systems n Mult-affne matrces: affne n each p l Example for two scalar uncertantes 1 [ [1] 1, [] 1 ], [ [1], [] ] = 1,1,1 (1 + [1] 1 + [1] 1 [1] ) + 1,1, (1 + [1] 1 + [1] 1 [] ) + 1,,1 (1 + [] 1 + [] 1 [1] ) + 1,, (1 + [] 1 + [] 1 [] ). s Not the same as the convex hull of all possble vertces l Example: h 1 1 wth 1 [1, ] and [1, ]. 1 h h 4 = h 5 6= h 9 4 D. Peaucelle 7 May 10, 016
9 Descrptor mult-affne modelng of ratonal systems n Any matrx ratonal n admts a descrptor mult-affne representaton (DMAR) R( ) =M 1 ( )M 1 ( )M ( ) where M 1 ( ), M ( ), M ( ) are mult-affne n. l Alternatve to lnear-fractonal representatons l Usually of smaller sze, and easer to buld l Example: = D. Peaucelle 8 May 10, 016
10 Descrptor mult-affne modelng of ratonal systems n Dscrete-tme lnear system, wth performance I/O, ratonal n the uncertantes x k+1 z k = A r ( )x k + B rw ( )w k = C rz ( )x k + D rzw ( )w k l The DMAR 4 A r( ) B rw ( ) C rz ( ) D rzw ( ) 5 = 4 E x( ) E z ( ) 5 E 1 ( ) h A( ) B w ( ) n gves the followng descrptor mult-affne representaton of the system 4 I 0 E x ( ) I E z ( ) E ( ) A( ) B w ( ) 0 5 x k+1 s k : exogenous vector = E 1 ( )(A( )x k + B w ( )w k ) z k k x k w k 1 C A = E( ) k =0 D. Peaucelle 9 May 10, 016
11 LMI results for robust desgn and robust analyss n If there exsts P [v] = P [v]t 0, S and µ such that for all vertces [v] V h dag P [v] I 0 P [v] µ I (SE( [v] )) + (SE( [v] )) T then the system s robustly stable (.e. 8 ) wth robust H 1 performance µ. l Proof - step 1 - By convexty the condton holds for all : h dag P ( ) I 0 P ( ) µ I (SE( )) + (SE( )) T wth mult-affne Lyapunov matrx P ( ) 0. l Proof - step - Snce E( ) k =0one gets T k dag h P ( ) I 0 P ( ) µ I k = x T k+1 P ( )x k+1 + z T k z k x T k P ( )x k µ w T k w k < 0 D. Peaucelle 10 May 10, 016
12 LMI results for robust desgn and robust analyss n If there exsts P [v] = P [v]t 0, S and µ such that for all vertces [v] V h dag P [v] I 0 P [v] µ I (SE( [v] )) + (SE( [v] )) T then the system s robustly stable (.e. 8 ) wth robust H 1 performance µ. l S-varable result l Extended n present work to mult-affne representatons l Exst tools to reduce numercal burden (sometmes lossless) s Example: no S f plant s mult-affne n & common P = P ( ) l Extensons to mxed constant/tme-varyng uncertantes D. Peaucelle 11 May 10, 016
13 LMI results for robust desgn and robust analyss n SV-LMI for robust state-feedback desgn If there exst P [v] d 0, S dx, S dy, S d such that LMIs L sf ( [v] ) hold for all [v] V then K = S dy T (S dx T ) 1 s a robustly stablzng state-feedback gan s.t. x k+1 z k = A r ( )x k + B r ( )u k + B rw ( )w k, u k = Kx k = C rz ( )x k + D rzu ( )u k + D rzw ( )w k has an H 1 performance smaller than µ d whatever. l Lnearzng change of varables on S-varables l Proof uses equvalence wth dual system x d,k+1 = A T r ( )x d,k +... l Result s new because for ratonal systems l Easy extensons for regonal pole locaton, H performance, etc. D. Peaucelle 1 May 10, 016
14 LMI results for robust desgn and robust analyss n SV-LMI for analyss of state trajectores under fxed state-feedback K = K If there exst P [v] 0, Q and S such that LMIs L sf,a ( [v] ) hold for all [v] V, then x k+1 = A r ( )x k + B r ( )u k, u k = Kx k + k s robustly stable and x k s bounded for bounded control errors k : kw xk applek k where W = Q 1/. l Allow to estmate the state trajectores n case of corrupted state-feedback (nevtable when feedback s wth observed-state) D. Peaucelle 1 May 10, 016
15 LMI results for robust desgn and robust analyss n SV-LMI for robust observer desgn under fxed K = K and expected state trajectores W = W If there exst P 1 [v] 0, P p [v] K T K, S x, S a, S b, S l, S, S p such that LMIs L ob ( [v] ) hold for all [v] V, then A o = S 1 x S a, B o = S 1 x S b, L = S 1 x S l defne an observer that guarantees: k k apple kwxk, k k p apple p kwxk where k = Ke k. The propertes hold whatever bounded x and whatever. l Norm-to-norm perf: asymptotc couplng of observaton error on system dynamcs l Norm-to-peak perf: avod waterbed effects of transent peaks l Small gan theorem: f < 1 observed-state feedback robustly stablzes D. Peaucelle 14 May 10, 016
16 LMI results for robust desgn and robust analyss n SV-LMI for observed-state feedback analyss under fxed K = K, A o = A o etc. If there exst P [v] c 0, S c such that LMIs L ob,a ( [v] ) hold for all [v] V, then x k+1 z k = A r ( )x k + B r ( )u k + B rw ( )w k = C rz ( )x k + D rzu ( )u k + D rzw ( )w k ˆx k+1 = A oˆx k + B o u k + L(C ˆx k y k ), u k = K ˆx k has an H 1 performance smaller than µ c whatever. l Exsts also SV-LMI condtons L ob,da for the dual system: µ dc upper-bound l No apror relaton between upper-bounds µ d (deal state-feedback), µ c and µ dc D. Peaucelle 15 May 10, 016
17 Observed-state feedback desgn heurstc n 4 steps l 1- Desgn stablzng state-feedback K (for example usng LMI L sf ) l - Get estmate of state trajectores represented by W (usng LMIs L sf,a ) (max mn (W T W ) leads to tght estmates) l - Desgn observer (usng LMIs L ob ) (mn + p p to adjust tradeoff between norm and peak performances) l 4- Analyze observed-state closed-loop (usng LMIs L ob,a or L ob,da ) s No guarantee that next step would be feasble s No guarantee to fnd a robustly stablzng control when exsts s All step are purely LMI wth clear control theory justfcaton s Each step based on new LMI condtons D. Peaucelle 16 May 10, 016
18 π Example n Academc example for llustraton x k+1 = z k = 4 1 / h x k u k + h x k + u k, y k = x k 5 w k l DMAR E x = A = h 5, E z = 0 1, E = 4 0 5, 0 1 5, B = 4 0 5, B w = l 1 [1 1, 1+ 1 ], [1, 1+ ] at lmt of stablty when 1 = =1 D. Peaucelle 17 May 10, 016
19 π Example l Results when µ d = 10 at frst step ( 1, ) (, p) (, p) µ c µ dc (0, 0) (1, 1) (10 4, 10 4 ) (0.1, 0) (1, 1) (1.0747, ) (0, 0.1) (1, 1) (0.947, 0.54) (0.1, 0.1) (10, 1) (1.76, ) (0.1, 0.1) (1, 1) (1.96, ) (0.1, 0.1) (1, 10) (1.9, ) (0., 0.1) (1, 1) (1.006, 1.181) (0.1, 0.) (1, 1) (1.4, 1.155) (0., 0.) (1, 1) (.59,.08) D. Peaucelle 18 May 10, 016
20 π Example l Results when µ d s mnmzed at frst step and (, p) =(1, 1). ( 1, ) µ d µ d (, p) µ c µ dc (0, 0) 1 1 (10 4, 10 4 ) (0.1, 0) (0.49, 0.49) (0, 0.1) (0.061, 0.777) (0.1, 0.1) (0.5611, ) (0., 0.1) (1.190, ) (0.1, 0.) (1.4, ) (0., 0.) (.0445,.5166) 1 1 s µ d computed on SV-LMI wth reduced sze D. Peaucelle 19 May 10, 016
21 π Example l Sze of LMI condtons (applyng non-conservatve sze reducton procedures) ( 1, ) L sf Lsf L sf,a L ob L ob,a L ob,da (0, 0) {5, 0} {5, 0} {, 0} {6, 0} {5, 0} {5, 0} (1, 0) {6, 1} {6, 1} {5, } {7, 1} {7, } {7, } (0, 1) {7, } {6, 1} {5, } {8, } {7, } {10, 5} (1, 1) {7, } {6, 1} {6, } {8, } {8, } {11, 6} s {N r,n c } wth N r rows n each LMI (to be multpled by nb of vertces) s {N r,n c } wth N c columns of S-varables D. Peaucelle 0 May 10, 016
22 π Example n System model x k+1 = 4 1 / x k u k w k l Observer model (desgn for 1 = =0.) A o = , B o = D. Peaucelle 1 May 10, 016
23 Conclusons n Revsted Luenberger observer desgn n case of uncertan systems l Separaton prncple replaced by a mxed norm/peak performance measure l LMI desgn of state-feedback and observer gans one after the other l Heurstc wth no guarantee of success s Surprsngly, K desgn for fxed observer s more complex (prospectve work) s Extensons for contnuous-tme systems: rases ssues about S-varable condtons for desgn (tunng parameters) n Promsng descrptor mult-affne representaton combned to SV-LMIs D. Peaucelle May 10, 016
Synthèse de correcteurs par retour d état observé robustes. pour les systèmes à temps discret rationnels en les incertitudes
Synthèse de correcteurs par retour d état observé robustes pour les systèmes à temps discret rationnels en les incertitudes Dimitri Peaucelle Yoshio Ebihara & Yohei Hosoe Séminaire MOSAR, 16 mars 2016
More informationControl of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design
Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa shoudong.huang@anu.edu.au
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationTHE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS
Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationVisualization of the Economic Impact of Process Uncertainty in Multivariable Control Design
Vsualzaton of the Economc Impact of Process Uncertanty n Multvarable Control Desgn Benjamn Omell & Donald J. Chmelewsk Department of Chemcal & Bologcal Engneerng Illnos Insttute of echnology Mass r r max
More informationNeuro-Adaptive Design - I:
Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationImproved delay-dependent stability criteria for discrete-time stochastic neural networks with time-varying delays
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 ( 4456 446 Improved delay-dependent stablty crtera for dscrete-tme stochastc neural networs wth tme-varyng delays Meng-zhuo Luo a Shou-mng Zhong
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationChapter 2 Linear Parameter-Varying Modeling and Control Synthesis Methods
Chapter 2 Lnear Parameter-Varyng Modelng and Control Synthess Methods Ths chapter s splt nto the followng two man parts: modelng of LPV systems and control synthess methods for LPV systems. 2.1 Modelng
More informationAdaptive sliding mode reliable excitation control design for power systems
Acta Technca 6, No. 3B/17, 593 6 c 17 Insttute of Thermomechancs CAS, v.v.. Adaptve sldng mode relable exctaton control desgn for power systems Xuetng Lu 1, 3, Yanchao Yan Abstract. In ths paper, the problem
More informationSTATS 306B: Unsupervised Learning Spring Lecture 10 April 30
STATS 306B: Unsupervsed Learnng Sprng 2014 Lecture 10 Aprl 30 Lecturer: Lester Mackey Scrbe: Joey Arthur, Rakesh Achanta 10.1 Factor Analyss 10.1.1 Recap Recall the factor analyss (FA) model for lnear
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationx i1 =1 for all i (the constant ).
Chapter 5 The Multple Regresson Model Consder an economc model where the dependent varable s a functon of K explanatory varables. The economc model has the form: y = f ( x,x,..., ) xk Approxmate ths by
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationZeros and Zero Dynamics for Linear, Time-delay System
UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationStability and Stabilization for Discrete Systems with Time-varying Delays Based on the Average Dwell-time Method
Proceedngs of the 29 IEEE Internatonal Conference on Systems, an, and Cybernetcs San Antono, TX, USA - October 29 Stablty and Stablzaton for Dscrete Systems wth Tme-varyng Delays Based on the Average Dwell-tme
More informationAn interval observer design for uncertain nonlinear systems based on the T-S fuzzy model
10.1515/acsc-2017-0025 Archves of Control Scences Volume 27(LXIII), 2017 No. 3, pages 397 407 An nterval observer desgn for uncertan nonlnear systems based on the T-S fuzzy model YAINA ENASRIA, HICHE BOURAS
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationA NOVEL DESIGN APPROACH FOR MULTIVARIABLE QUANTITATIVE FEEDBACK DESIGN WITH TRACKING ERROR SPECIFICATIONS
A OVEL DESIG APPROACH FOR MULTIVARIABLE QUATITATIVE FEEDBACK DESIG WITH TRACKIG ERROR SPECIFICATIOS Seyyed Mohammad Mahd Alav, Al Khak-Sedgh, Batool Labb Department of Electronc and Computer Engneerng,
More informationCS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements
CS 750 Machne Learnng Lecture 5 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square CS 750 Machne Learnng Announcements Homework Due on Wednesday before the class Reports: hand n before
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationSimultaneous BOP Selection and Controller Design for the FCC Process
Smultaneous BOP Selecton and Controller Desgn for the FCC Process Benjamn Omell & Donald J. Chmelewsk Department of Chemcal & Bologcal Engneerng Outlne Motvatng Example Introducton to BOP Selecton and
More informationObservers for non-linear differential-algebraic. system
Observers for non-lnear dfferental-algebrac systems Jan Åslund and Erk Frsk Department of Electrcal Engneerng, Lnköpng Unversty 581 83 Lnköpng, Sweden, {jaasl,frsk}@sy.lu.se Abstract In ths paper we consder
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationDecentralized robust control design using LMI
Acta Montanstca Slovaca Ročník 3 (28) číslo -4 Decentralzed robust control desgn usng LMI Anna Flasová and Dušan Krokavec ávrh robustného decentralzovaného radena pomocou LMI he paper deals wth applcaton
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationMEM Chapter 4b. LMI Lab commands
1 MEM8-7 Chapter 4b LMI Lab commands setlms lmvar lmterm getlms lmedt lmnbr matnbr lmnfo feasp dec2mat evallm showlm setmvar mat2dec mncx dellm delmvar gevp 2 Intalzng the LMI System he descrpton of an
More informationQuantifying Uncertainty
Partcle Flters Quantfyng Uncertanty Sa Ravela M. I. T Last Updated: Sprng 2013 1 Quantfyng Uncertanty Partcle Flters Partcle Flters Appled to Sequental flterng problems Can also be appled to smoothng problems
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationRepresentation Theorem for Convex Nonparametric Least Squares. Timo Kuosmanen
Representaton Theorem or Convex Nonparametrc Least Squares Tmo Kuosmanen 4th Nordc Econometrc Meetng, Tartu, Estona, 4-6 May 007 Motvaton Inerences oten depend crtcally upon the algebrac orm chosen. It
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationOff-policy Reinforcement Learning for Robust Control of Discrete-time Uncertain Linear Systems
Off-polcy Renforcement Learnng for Robust Control of Dscrete-tme Uncertan Lnear Systems Yonglang Yang 1 Zhshan Guo 2 Donald Wunsch 3 Yxn Yn 1 1 School of Automatc and Electrcal Engneerng Unversty of Scence
More informationStabilization and Performance Analysis for a Class of Switched Systems
43rd IEEE Conference on Decson and Control December 14-17, 2004 Atlants, Paradse Island, Bahamas ThB02.6 Stablzaton and Performance Analyss for a Class of Swtched Systems Le Fang, Ha Ln, and Panos J. Antsakls
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationStatic Output Feedback Control for Discrete-time Switched Linear Systems under Arbitrary Switching
29 Amercan Control Conference Hyatt Regency Rverfront, St. Lous, MO, USA June -2, 29 ThA2.6 Statc Output Feedback Control for Dscrete-tme Swtched Lnear Systems under Arbtrary Swtchng Da-We Dng and Guang-Hong
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationFeature Selection & Dynamic Tracking F&P Textbook New: Ch 11, Old: Ch 17 Guido Gerig CS 6320, Spring 2013
Feature Selecton & Dynamc Trackng F&P Textbook New: Ch 11, Old: Ch 17 Gudo Gerg CS 6320, Sprng 2013 Credts: Materal Greg Welch & Gary Bshop, UNC Chapel Hll, some sldes modfed from J.M. Frahm/ M. Pollefeys,
More information6) Derivatives, gradients and Hessian matrices
30C00300 Mathematcal Methods for Economsts (6 cr) 6) Dervatves, gradents and Hessan matrces Smon & Blume chapters: 14, 15 Sldes by: Tmo Kuosmanen 1 Outlne Defnton of dervatve functon Dervatve notatons
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationA RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS
Доклади на Българската академия на науките Comptes rendus de l Académe bulgare des Scences Tome 60 No 9 2007 SCIENCES ET INGENIERIE Théore des systèmes A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationOutput Feedback Stabilization of Networked Control Systems With Packet Dropouts
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 9, SEPTEMBER 2007 705 Output Feedback Stablzaton of Networked Control Systems Wth Packet Dropouts Wen-An Zhang and L Yu Abstract In ths paper, we dscuss
More informationA LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS
A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS Max M.D. SANTOS, Eugêno B. CASTELAN, Jean-Claude HENNET Abstract Ths paper consders the problem of control of dscrete-tme
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationrisk and uncertainty assessment
Optmal forecastng of atmospherc qualty n ndustral regons: rsk and uncertanty assessment Vladmr Penenko Insttute of Computatonal Mathematcs and Mathematcal Geophyscs SD RAS Goal Development of theoretcal
More informationNorm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise
ppled Mathematcal Scences, Vol. 4, 200, no. 60, 2955-296 Norm Bounds for a ransformed ctvty Level Vector n Sraffan Systems: Dual Exercse Nkolaos Rodousaks Department of Publc dmnstraton, Panteon Unversty
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationNeuro-Adaptive Design II:
Lecture 37 Neuro-Adaptve Desgn II: A Robustfyng Tool for Any Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system modelng s
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationController Design for Networked Control Systems in Multiple-packet Transmission with Random Delays
Appled Mehans and Materals Onlne: 03-0- ISSN: 66-748, Vols. 78-80, pp 60-604 do:0.408/www.sentf.net/amm.78-80.60 03 rans eh Publatons, Swtzerland H Controller Desgn for Networed Control Systems n Multple-paet
More informationwhere I = (n x n) diagonal identity matrix with diagonal elements = 1 and off-diagonal elements = 0; and σ 2 e = variance of (Y X).
11.4.1 Estmaton of Multple Regresson Coeffcents In multple lnear regresson, we essentally solve n equatons for the p unnown parameters. hus n must e equal to or greater than p and n practce n should e
More informationMAE140 - Linear Circuits - Winter 16 Final, March 16, 2016
ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have
More informationBayesian predictive Configural Frequency Analysis
Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationSociété de Calcul Mathématique SA
Socété de Calcul Mathématque SA Outls d'ade à la décson Tools for decson help Probablstc Studes: Normalzng the Hstograms Bernard Beauzamy December, 202 I. General constructon of the hstogram Any probablstc
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationC4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )
C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z
More information