Vector Barrier Certificates and Comparison Systems
|
|
- Rosamund Francis
- 5 years ago
- Views:
Transcription
1 Vector Barrier Certificates and Comparison Systems Andrew Sogokon 1 Khalil Ghorbal 2 Yong Kiam Tan 1 André Platzer Carnegie Mellon University, Pittsburgh, USA 2 - Inria, Rennes, France 16 July 2018, FM 2018, Oxford, UK 1/26
2 Preliminaries: Systems of ODEs An autonomous n-dimensional system of ODEs has the general form: x 1 = f 1(x 1,..., x n),. x n = f n(x 1,..., x n), where x i denotes the time derivative dx i dt and fi are continuous functions. 2/26
3 Preliminaries: Systems of ODEs An autonomous n-dimensional system of ODEs has the general form: x 1 = f 1(x 1,..., x n),. x n = f n(x 1,..., x n), where x i denotes the time derivative dx i dt and fi are continuous functions. We write x = f(x). The vector field f : R n R n gives the direction of motion at each point in space. 2/26
4 Preliminaries: Systems of ODEs An autonomous n-dimensional system of ODEs has the general form: x 1 = f 1(x 1,..., x n),. x n = f n(x 1,..., x n), where x i denotes the time derivative dx i dt and fi are continuous functions. We write x = f(x). The vector field f : R n R n gives the direction of motion at each point in space. A solution x(x 0, t) : R n R R n exactly describes the motion of a particle x 0 under the influence of the vector field. 2/26
5 Example: Van der Pol oscillator The Van der Pol system oscillator evolves according to the following ODEs: x 1 = x 2, x 2 = (1 x 2 1)x 2 x 1 3/26
6 Example: Van der Pol oscillator The Van der Pol system oscillator evolves according to the following ODEs: x 1 = x 2, x 2 = (1 x 2 1)x 2 x 1 x 0 3/26
7 Example: Van der Pol oscillator The Van der Pol system oscillator evolves according to the following ODEs: x 1 = x 2, x 2 = (1 x 2 1)x 2 x 1 x 0 x(x 0, t) 3/26
8 Barrier certificates Lyapunov-like safety verification method, due to Prajna & Jadbabaie (2004). MAIN IDEA: Find a differentiable function B : R n R such that B(x) > 0 holds for every x Unsafe, For all x 0 Init, B(x(x 0, t)) 0 holds for all future t. 4/26
9 Barrier certificates Lyapunov-like safety verification method, due to Prajna & Jadbabaie (2004). MAIN IDEA: Find a differentiable function B : R n R such that B(x) > 0 holds for every x Unsafe, For all x 0 Init, B(x(x 0, t)) 0 holds for all future t. x2 Init Unsafe x 1 4/26
10 Barrier certificates Lyapunov-like safety verification method, due to Prajna & Jadbabaie (2004). MAIN IDEA: Find a differentiable function B : R n R such that B(x) > 0 holds for every x Unsafe, For all x 0 Init, B(x(x 0, t)) 0 holds for all future t. B > 0 x2 B 0 Init Unsafe B > 0 x 1 4/26
11 Barrier certificates (more formally) Lemma (Safety with semantic barrier certificates) Given : a system of n first-order ODEs x = f(x), 5/26
12 Barrier certificates (more formally) Lemma (Safety with semantic barrier certificates) Given : a system of n first-order ODEs x = f(x), possibly an evolution constraint Q R n, 5/26
13 Barrier certificates (more formally) Lemma (Safety with semantic barrier certificates) Given : a system of n first-order ODEs x = f(x), possibly an evolution constraint Q R n, a set of initial states Init R n, 5/26
14 Barrier certificates (more formally) Lemma (Safety with semantic barrier certificates) Given : a system of n first-order ODEs x = f(x), possibly an evolution constraint Q R n, a set of initial states Init R n, and a set of unsafe states Unsafe R n, 5/26
15 Barrier certificates (more formally) Lemma (Safety with semantic barrier certificates) Given : a system of n first-order ODEs x = f(x), possibly an evolution constraint Q R n, a set of initial states Init R n, and a set of unsafe states Unsafe R n, if a differentiable (barrier) function B : R n R satisfies the following conditions, then the system is safe: 1 x Unsafe. B(x) > 0, ( ) 2 x 0 Init. t 0. ( τ [0, t]. x(x 0, τ) Q) B(x(x 0, t)) 0. 5/26
16 Kinds of barrier certificates Recall the (semantic) conditions: 1 x Unsafe. B(x) > 0, ( ) 2 x 0 Init. t 0. ( τ [0, t]. x(x 0, τ) Q) B(x(x 0, t)) 0. 6/26
17 Kinds of barrier certificates Recall the (semantic) conditions: 1 x Unsafe. B(x) > 0, ( ) 2 x 0 Init. t 0. ( τ [0, t]. x(x 0, τ) Q) B(x(x 0, t)) 0. Several direct sufficient conditions have been proposed to ensure the last requirement. Observe that the solutions x(x 0, t) are not explicit. Convex (Prajna & Jadbabaie, 2004) Exponential-type (Kong et al., 2013) General (Dai et al., 2017) Q B 0. Q B λb. Q B ω(b), t 0. b(t) 0, b is the solution to b = ω(b). 6/26
18 Kinds of barrier certificates Recall the (semantic) conditions: 1 x Unsafe. B(x) > 0, ( ) 2 x 0 Init. t 0. ( τ [0, t]. x(x 0, τ) Q) B(x(x 0, t)) 0. Several direct sufficient conditions have been proposed to ensure the last requirement. Observe that the solutions x(x 0, t) are not explicit. Convex (Prajna & Jadbabaie, 2004) Exponential-type (Kong et al., 2013) General (Dai et al., 2017) Q B 0. Q B λb. Q B ω(b), t 0. b(t) 0, b is the solution to b = ω(b). All these conditions are instantiations of the comparison principle. 6/26
19 Comparison principle Used by R. Conti (1956), F. Brauer, C. Corduneanu (1960s), many others. Not a new idea in applied mathematics; used in stability theory. 7/26
20 Comparison principle Used by R. Conti (1956), F. Brauer, C. Corduneanu (1960s), many others. Not a new idea in applied mathematics; used in stability theory. MAIN IDEA: Given x = f(x), if a positive definite differentiable function V : R n R satisfies the differential inequality V ω(v ), where ω : R R is an appropriate scalar function, one may infer the stability of x = f(x) from the stability of the one-dimensional system v = ω(v). 7/26
21 Comparison principle Used by R. Conti (1956), F. Brauer, C. Corduneanu (1960s), many others. Not a new idea in applied mathematics; used in stability theory. MAIN IDEA: Given x = f(x), if a positive definite differentiable function V : R n R satisfies the differential inequality V ω(v ), where ω : R R is an appropriate scalar function, one may infer the stability of x = f(x) from the stability of the one-dimensional system v = ω(v). One obtains an abstraction of the system by another one-dimensional system. 7/26
22 Comparison theorem (scalar majorization) The comparison principle hinges on an appropriate comparison theorem. Theorem (Scalar comparison theorem) Let V (t) and v(t) be real valued functions differentiable on [0, T ]. If V ω(v ) and v = ω(v) holds on [0, T ] for some locally Lipschitz continuous function ω and if V (0) = v(0), then for all t [0, T ] one has V (t) v(t). Informally, Solutions to the ODE v = ω(v) act as upper bounds (i.e. majorize) solutions to V ω(v ). 8/26
23 Comparison principle 1. Introduce a fresh variable v (really a function of time v(t)), 9/26
24 Comparison principle 1. Introduce a fresh variable v (really a function of time v(t)), 2. Replace the scalar differential inequality V ω(v ) by an equality. 9/26
25 Comparison principle 1. Introduce a fresh variable v (really a function of time v(t)), 2. Replace the scalar differential inequality V ω(v ) by an equality. V ω(v ) v = ω(v) 9/26
26 Comparison principle 1. Introduce a fresh variable v (really a function of time v(t)), 2. Replace the scalar differential inequality V ω(v ) by an equality. V ω(v ) v = ω(v) Obtain one-dimensional abstraction; 1-d systems are easy to study. ω(v) v 9/26
27 Kinds of barrier certificates Recall the (semantic) conditions: 1 x Unsafe. B(x) > 0, ( ) 2 x 0 Init. t 0. ( τ [0, t]. x(x 0, τ) Q) B(x(x 0, t)) 0. Several direct sufficient conditions have been proposed to ensure the last requirement. Observe that the solutions x(x 0, t) are not explicit. Convex (Prajna & Jadbabaie, 2004) Exponential-type (Kong et al., 2013) General (Dai et al., 2017) Q B 0. Q B λb. Q B ω(b), t 0. b(t) 0, b is the solution to b = ω(b). All these conditions are instantiations of the comparison principle. 10/26
28 Convex barrier certificates (Prajna & Jadbabaie, 2004) ω(b) Differential inequality B 0 0 B 0 b Comparison system b = 0 11/26
29 Exponential-type barrier certificates (Kong et al., 2013) ω(b) λb Differential inequality B λb B 0 b Comparison system b = λb 12/26
30 General barrier certificates (Dai, et al., 2017) ω(b) ω(b) Differential inequality B ω(b) r 1 r 2 B r 1 r 2 b Comparison system b = ω(b) 13/26
31 Scalar barrier certificates as comparison systems ω(b) ω(b) λb ω(b) ω(b) 0 B B r 1 r 2 B 0 b 0 b r 1 r 2 b (a) Constant (zero) Convex (b) Linear Exponential (c) Non-linear General 14/26
32 Scalar barrier certificates as comparison systems ω(b) ω(b) λb ω(b) ω(b) 0 B B r 1 r 2 B 0 b 0 b r 1 r 2 b (a) Constant (zero) Convex (b) Linear Exponential (c) Non-linear General Can we leverage the comparison principle to go beyond the scalar case? 14/26
33 Vector comparison systems R.E. Bellman introduced vector Lyapunov functions in /26
34 Vector comparison systems R.E. Bellman introduced vector Lyapunov functions in MAIN IDEA: Given x = f(x), if a positive definite differentiable function V : R n R m satisfies the differential inequality V ω(v ), where ω : R m R m is an appropriate vector function, one may infer the stability of x = f(x) from the stability of the m-dimensional system v = ω(v). 15/26
35 Vector comparison systems R.E. Bellman introduced vector Lyapunov functions in MAIN IDEA: Given x = f(x), if a positive definite differentiable function V : R n R m satisfies the differential inequality V ω(v ), where ω : R m R m is an appropriate vector function, one may infer the stability of x = f(x) from the stability of the m-dimensional system v = ω(v). One obtains an abstraction of the system by another m-dimensional system. 15/26
36 Vector comparison systems R.E. Bellman introduced vector Lyapunov functions in MAIN IDEA: Given x = f(x), if a positive definite differentiable function V : R n R m satisfies the differential inequality V ω(v ), where ω : R m R m is an appropriate vector function, one may infer the stability of x = f(x) from the stability of the m-dimensional system v = ω(v). One obtains an abstraction of the system by another m-dimensional system.!!! CAVEAT: The vector function ω needs to be quasi-monotone increasing. 15/26
37 Quasi-monotone increasing functions Definition A function ω : R m R m is said to be quasi-monotone increasing if ω i (x) ω i (y) for all i = 1,..., m and all x, y such that x i = y i, and x k y k for all k i. 16/26
38 Quasi-monotone increasing functions Definition A function ω : R m R m is said to be quasi-monotone increasing if ω i (x) ω i (y) for all i = 1,..., m and all x, y such that x i = y i, and x k y k for all k i. Every scalar function is (trivially) quasi-monotone increasing. 16/26
39 Quasi-monotone increasing functions Definition A function ω : R m R m is said to be quasi-monotone increasing if ω i (x) ω i (y) for all i = 1,..., m and all x, y such that x i = y i, and x k y k for all k i. Every scalar function is (trivially) quasi-monotone increasing. A linear function ω(x) = Ax is quasi-monotone increasing if and only if A is essentially non-negative, i.e. all off-diagonal entries of A are non-negative. 16/26
40 Quasi-monotone increasing functions Definition A function ω : R m R m is said to be quasi-monotone increasing if ω i (x) ω i (y) for all i = 1,..., m and all x, y such that x i = y i, and x k y k for all k i. Every scalar function is (trivially) quasi-monotone increasing. A linear function ω(x) = Ax is quasi-monotone increasing if and only if A is essentially non-negative, i.e. all off-diagonal entries of A are non-negative. Matrices with this property are also known as Metzler matrices. 16/26
41 Vector comparison principle 1. Introduce a fresh vector of variables v (vector function of time v(t)), 17/26
42 Vector comparison principle 1. Introduce a fresh vector of variables v (vector function of time v(t)), 2. Replace the vector differential inequality V ω(v ) by an equality. 17/26
43 Vector comparison principle 1. Introduce a fresh vector of variables v (vector function of time v(t)), 2. Replace the vector differential inequality V ω(v ) by an equality. V ω(v ) v = ω(v) 17/26
44 v Vector comparison principle 1. Introduce a fresh vector of variables v (vector function of time v(t)), 2. Replace the vector differential inequality V ω(v ) by an equality. V ω(v ) v = ω(v) Obtain an m-dimensional abstraction. More general than the scalar principle. v 17/26
45 Vector comparison principle Theorem (Linear vector comparison theorem) For a given system of ODEs x = f(x) and a Metzler matrix, A R m m, if V = (V 1, V 2,..., V m ) satisfies the system of differential inequalities V AV, then for all t 0 the inequality V (t) v(t) holds component-wise, where v(t) is the solution to the comparison system v = Av, and v(0) = V (0). 18/26
46 Vector comparison principle Theorem (Linear vector comparison theorem) For a given system of ODEs x = f(x) and a Metzler matrix, A R m m, if V = (V 1, V 2,..., V m ) satisfies the system of differential inequalities V AV, then for all t 0 the inequality V (t) v(t) holds component-wise, where v(t) is the solution to the comparison system v = Av, and v(0) = V (0). Metzler matrices have another important property: Lemma If A R m m is a Metzler matrix, then for any v 0 0, the solution v(t) to the linear system v = Av is such that v(t) 0 for all t 0. 18/26
47 Vector barrier certificates Theorem Given an m-vector of functions B = (B 1, B 2,..., B m ) and some essentially non-negative m m matrix A, if the following conditions hold, then the system is safe: VBC 1. x R n. (Init m i=1 B i 0), VBC 2. x R n. (Unsafe m i=1 B i > 0), VBC 3. x R n. (Q B AB). 19/26
48 Vector barrier certificates Theorem Given an m-vector of functions B = (B 1, B 2,..., B m ) and some essentially non-negative m m matrix A, if the following conditions hold, then the system is safe: VBC 1. x R n. (Init m i=1 B i 0), VBC 2. x R n. (Unsafe m i=1 B i > 0), VBC 3. x R n. (Q B AB). Generation? 19/26
49 Vector barrier certificates Theorem Given an m-vector of functions B = (B 1, B 2,..., B m ) and some essentially non-negative m m matrix A, if the following conditions hold, then the system is safe: VBC 1. x R n. (Init m i=1 B i 0), VBC 2. x R n. (Unsafe m i=1 B i > 0), VBC 3. x R n. (Q B AB). Generation? Unfortunately VBC 2 leads to non-convexity. Convexity enables the use of efficient semidefinite solvers. 19/26
50 Vector barrier certificate (convex) Theorem Given an m-vector of functions B = (B 1, B 2,..., B m ) and some essentially non-negative m m matrix A, if for some i {1,..., m} the following conditions hold, then the system is safe: VBC 1. x R n. (Init m i=1 B i 0), VBC 2. x R n. (Unsafe B i > 0), VBC 3. x R n. (Q B AB). The above conditions define a convex set. 20/26
51 Generating vector barrier certificates using SDP Solve a sum-of-squares optimization problem for size m vector barrier certificates B 1, B 2,..., B m, with i {1,..., m}: B i Σ a j=1σ Ii,j I j 0 for all i = 1, 2,..., m (VBC 1) B i Σ b j=1σ Uj U j ɛ 0 (VBC 2) Σ m j=1a ijb j B i Σ c j=1σ Qi,j Q j 0 for all i = 1, 2,..., m (VBC 3) Possible using e.g. SOSTOOLS toolbox in Matlab, together with a semidefinite solve (e.g. SeDuMi). 21/26
52 Vector barrier certificates (deductive power) Theorem Polynomial convex or exponential-type barrier certificates (trivially) satisfy the conditions VBC 1-3 (or VBC 1-3). The converse is false. 22/26
53 Vector barrier certificates (deductive power) Theorem Polynomial convex or exponential-type barrier certificates (trivially) satisfy the conditions VBC 1-3 (or VBC 1-3). The converse is false. There are vector barrier certificates for some safety properties where scalar barrier certificates do not exist. 22/26
54 Vector barrier certificates (deductive power) Theorem Polynomial convex or exponential-type barrier certificates (trivially) satisfy the conditions VBC 1-3 (or VBC 1-3). The converse is false. There are vector barrier certificates for some safety properties where scalar barrier certificates do not exist. Vector barrier certificates can also exist with lower polynomial degrees than is possible with scalar barrier certificates! 22/26
55 Vector barrier certificates (example) x 1 = x 2, x 2 = x 1, ( ) ( )( ) B Vector barrier certificate (B 1, B 2) = (x 1, x 2) satisfies B 1 B B 2 and has polynomial degree 1. No scalar barrier certificate of degree 1 exists x x1 23/26
56 Summary The comparison principle is a powerful and fundamental abstraction mechanism for ODEs. 24/26
57 Summary The comparison principle is a powerful and fundamental abstraction mechanism for ODEs. Existing (scalar) notions of barrier certificates follow easily from this principle. 24/26
58 Summary The comparison principle is a powerful and fundamental abstraction mechanism for ODEs. Existing (scalar) notions of barrier certificates follow easily from this principle. A generalization of existing notions of barrier certificates is achieved, following Bellman s use of the vector comparison principle. 24/26
59 Summary The comparison principle is a powerful and fundamental abstraction mechanism for ODEs. Existing (scalar) notions of barrier certificates follow easily from this principle. A generalization of existing notions of barrier certificates is achieved, following Bellman s use of the vector comparison principle. Also possible to use time-dependent Metzler matrices, i.e. A(t). Work on this ongoing. 24/26
60 Limitations Choosing an appropriate Metzler matrix A for the comparison system is generally non-trivial. 25/26
61 Limitations Choosing an appropriate Metzler matrix A for the comparison system is generally non-trivial. Numerical inaccuracies in the results (to be expected with existing solvers). 25/26
62 Limitations Choosing an appropriate Metzler matrix A for the comparison system is generally non-trivial. Numerical inaccuracies in the results (to be expected with existing solvers). Trade-off: dimension of the comparison system vs degree of the barrier functions. 25/26
63 End Questions? Acknowledgments This work was supported by the National Science Foundation under NSF CPS Award CNS and by the AFOSR under grant number FA ; the third author was supported by the National Science Scholarship from A*STAR, Singapore. 26/26
Vector Barrier Certificates and Comparison Systems
Vector Barrier Certificates and Comparison Systems Andrew Sogokon 1, Khalil Ghorbal 2, Yong Kiam Tan 1, and André Platzer 1 1 Computer Science Department, Carnegie Mellon University, Pittsburgh, USA {asogokon
More informationFormal Verification and Automated Generation of Invariant Sets
Formal Verification and Automated Generation of Invariant Sets Khalil Ghorbal Carnegie Mellon University Joint work with Andrew Sogokon and André Platzer Toulouse, France 11-12 June, 2015 K. Ghorbal (CMU,
More informationA Hierarchy of Proof Rules for Checking Positive Invariance of Algebraic and Semi-Algebraic Sets
A Hierarchy of Proof Rules for Checking Positive Invariance of Algebraic and Semi-Algebraic Sets Khalil Ghorbal a,, Andrew Sogokon b, André Platzer a a Carnegie Mellon University, Computer Science Department,
More informationLecture 6 Verification of Hybrid Systems
Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More informationCOMPLEX behaviors that can be exhibited by modern engineering
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 8, AUGUST 2007 1415 A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates Stephen Prajna, Member, IEEE, Ali Jadbabaie,
More informationCharacterizing Algebraic Invariants by Differential Radical Invariants
Characterizing Algebraic Invariants by Differential Radical Invariants Khalil Ghorbal Carnegie Mellon university Joint work with André Platzer ÉNS Paris April 1st, 2014 K. Ghorbal (CMU) Invited Talk 1
More informationDeductive Verification of Continuous Dynamical Systems
Deductive Verification of Continuous Dynamical Systems Dept. of Computer Science, Stanford University (Joint work with Ashish Tiwari, SRI International.) 1 Introduction What are Continuous Dynamical Systems?
More informationOptimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE
Optimization over Nonnegative Polynomials: Algorithms and Applications Amir Ali Ahmadi Princeton, ORFE INFORMS Optimization Society Conference (Tutorial Talk) Princeton University March 17, 2016 1 Optimization
More informationModern Optimal Control
Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints
More informationA Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering August 2007 A Framework for Worst-Case and Stochastic Safety Verification Using Barrier
More informationPolynomial level-set methods for nonlinear dynamical systems analysis
Proceedings of the Allerton Conference on Communication, Control and Computing pages 64 649, 8-3 September 5. 5.7..4 Polynomial level-set methods for nonlinear dynamical systems analysis Ta-Chung Wang,4
More informationA Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets
A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets Khalil Ghorbal 1 Andrew Sogokon 2 André Platzer 1 1. Carnegie Mellon University 2. University of Edinburgh VMCAI, Mumbai,
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationNonlinear Systems Theory
Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we
More informationUsing Theorem Provers to Guarantee Closed-Loop Properties
Using Theorem Provers to Guarantee Closed-Loop Properties Nikos Aréchiga Sarah Loos André Platzer Bruce Krogh Carnegie Mellon University April 27, 2012 Aréchiga, Loos, Platzer, Krogh (CMU) Theorem Provers
More informationStability and Robustness Analysis of Nonlinear Systems via Contraction Metrics and SOS Programming
arxiv:math/0603313v1 [math.oc 13 Mar 2006 Stability and Robustness Analysis of Nonlinear Systems via Contraction Metrics and SOS Programming Erin M. Aylward 1 Pablo A. Parrilo 1 Jean-Jacques E. Slotine
More informationSTABILITY ANALYSIS AND CONTROL DESIGN
STABILITY ANALYSIS AND CONTROL DESIGN WITH IMPACTS AND FRICTION Michael Posa Massachusetts Institute of Technology Collaboration with Mark Tobenkin and Russ Tedrake ICRA Workshop on Robust Optimization-Based
More informationEN Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015
EN530.678 Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015 Prof: Marin Kobilarov 0.1 Model prerequisites Consider ẋ = f(t, x). We will make the following basic assumptions
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More informationThe moment-lp and moment-sos approaches
The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY
More informationAnalytical Validation Tools for Safety Critical Systems
Analytical Validation Tools for Safety Critical Systems Peter Seiler and Gary Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA Andrew Packard
More informationExample: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma
4-1 Algebra and Duality P. Parrilo and S. Lall 2006.06.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone of valid
More informationDiagonalization of Matrices
LECTURE 4 Diagonalization of Matrices Recall that a diagonal matrix is a square n n matrix with non-zero entries only along the diagonal from the upper left to the lower right (the main diagonal) Diagonal
More informationODE Homework 1. Due Wed. 19 August 2009; At the beginning of the class
ODE Homework Due Wed. 9 August 2009; At the beginning of the class. (a) Solve Lẏ + Ry = E sin(ωt) with y(0) = k () L, R, E, ω are positive constants. (b) What is the limit of the solution as ω 0? (c) Is
More informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationOptimality Conditions for Constrained Optimization
72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)
More informationFast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
More informationOn Stability of Linear Complementarity Systems
On Stability of Linear Complementarity Systems Alen Agheksanterian University of Maryland Baltimore County Math 710A: Special Topics in Optimization On Stability of Linear Complementarity Systems Alen
More informationFinite difference method for elliptic problems: I
Finite difference method for elliptic problems: I Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationOptimization-based Modeling and Analysis Techniques for Safety-Critical Software Verification
Optimization-based Modeling and Analysis Techniques for Safety-Critical Software Verification Mardavij Roozbehani Eric Feron Laboratory for Information and Decision Systems Department of Aeronautics and
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationConverse Results on Existence of Sum of Squares Lyapunov Functions
2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12-15, 2011 Converse Results on Existence of Sum of Squares Lyapunov Functions Amir
More informationA Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets Khalil Ghorbal 1 Andrew Sogokon 2 André Platzer 1
A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets Khalil Ghorbal 1 Andrew Sogokon 2 André Platzer 1 November 2014 CMU-CS-14-140 School of Computer Science Carnegie Mellon
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Systems of Differential Equations Phase Plane Analysis Hanz Richter Mechanical Engineering Department Cleveland State University Systems of Nonlinear
More informationConvex Optimization 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Convex Optimization 1 Many optimization objectives generated
More informationSOSTOOLS and its Control Applications
SOSTOOLS and its Control Applications Stephen Prajna 1, Antonis Papachristodoulou 1, Peter Seiler 2, and Pablo A. Parrilo 3 1 Control and Dynamical Systems, California Institute of Technology, Pasadena,
More informationChapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems
Chapter #4 Robust and Adaptive Control Systems Nonlinear Dynamics.... Linear Combination.... Equilibrium points... 3 3. Linearisation... 5 4. Limit cycles... 3 5. Bifurcations... 4 6. Stability... 6 7.
More informationUNIT 3 INTEGRATION 3.0 INTRODUCTION 3.1 OBJECTIVES. Structure
Calculus UNIT 3 INTEGRATION Structure 3.0 Introduction 3.1 Objectives 3.2 Basic Integration Rules 3.3 Integration by Substitution 3.4 Integration of Rational Functions 3.5 Integration by Parts 3.6 Answers
More informationBounded Model Checking with SAT/SMT. Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39
Bounded Model Checking with SAT/SMT Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39 Recap: Symbolic Model Checking with BDDs Method used by most industrial strength model checkers:
More informationCHAPTER 3. Matrix Eigenvalue Problems
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More information1 Positive and completely positive linear maps
Part 5 Functions Matrices We study functions on matrices related to the Löwner (positive semidefinite) ordering on positive semidefinite matrices that A B means A B is positive semi-definite. Note that
More informationHybrid Systems - Lecture n. 3 Lyapunov stability
OUTLINE Focus: stability of equilibrium point Hybrid Systems - Lecture n. 3 Lyapunov stability Maria Prandini DEI - Politecnico di Milano E-mail: prandini@elet.polimi.it continuous systems decribed by
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Lyapunov Stability - I Hanz Richter Mechanical Engineering Department Cleveland State University Definition of Stability - Lyapunov Sense Lyapunov
More informationNonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1
Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium
More informationHandout 2: Invariant Sets and Stability
Engineering Tripos Part IIB Nonlinear Systems and Control Module 4F2 1 Invariant Sets Handout 2: Invariant Sets and Stability Consider again the autonomous dynamical system ẋ = f(x), x() = x (1) with state
More informationFormally Analyzing Adaptive Flight Control
Formally Analyzing Adaptive Flight Control Ashish Tiwari SRI International 333 Ravenswood Ave Menlo Park, CA 94025 Supported in part by NASA IRAC NRA grant number: NNX08AB95A Ashish Tiwari Symbolic Verification
More informationVerification Constraint Problems with Strengthening
Verification Constraint Problems with Strengthening Aaron R. Bradley and Zohar Manna Computer Science Department Stanford University Stanford, CA 94305-9045 {arbrad,manna}@cs.stanford.edu Abstract. The
More informationAn alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version
1 An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version Robert Shorten 1, Oliver Mason 1 and Christopher King 2 Abstract The original
More informationChap 4. State-Space Solutions and
Chap 4. State-Space Solutions and Realizations Outlines 1. Introduction 2. Solution of LTI State Equation 3. Equivalent State Equations 4. Realizations 5. Solution of Linear Time-Varying (LTV) Equations
More informationSynthesizing Switching Logic using Constraint Solving
Synthesizing Switching Logic using Constraint Solving Ankur Taly 1, Sumit Gulwani 2, and Ashish Tiwari 3 1 Computer Science Dept., Stanford University ataly@stanford.edu 2 Microsoft Research, Redmond,
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
More informationAppendix A Solving Linear Matrix Inequality (LMI) Problems
Appendix A Solving Linear Matrix Inequality (LMI) Problems In this section, we present a brief introduction about linear matrix inequalities which have been used extensively to solve the FDI problems described
More informationLyapunov Function Synthesis using Handelman Representations.
Lyapunov Function Synthesis using Handelman Representations. Sriram Sankaranarayanan Xin Chen Erika Ábrahám University of Colorado, Boulder, CO, USA ( e-mail: first.lastname@colorado.edu). RWTH Aachen
More informationLecture 8 : Eigenvalues and Eigenvectors
CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with
More informationUNIVERSITY OF MANITOBA
Question Points Score INSTRUCTIONS TO STUDENTS: This is a 6 hour examination. No extra time will be given. No texts, notes, or other aids are permitted. There are no calculators, cellphones or electronic
More informationAbstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation
Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation or potatoes & ice cream cones Mendes Oulamara, Arnaud Venet Computer Aided Verification, 2015 July 22, 2015 ÉCOLE NORMALE
More informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
More informationProf. Krstic Nonlinear Systems MAE281A Homework set 1 Linearization & phase portrait
Prof. Krstic Nonlinear Systems MAE28A Homework set Linearization & phase portrait. For each of the following systems, find all equilibrium points and determine the type of each isolated equilibrium. Use
More informationACM106a - Homework 2 Solutions
ACM06a - Homework 2 Solutions prepared by Svitlana Vyetrenko October 7, 2006. Chapter 2, problem 2.2 (solution adapted from Golub, Van Loan, pp.52-54): For the proof we will use the fact that if A C m
More informationStability of Stochastic Differential Equations
Lyapunov stability theory for ODEs s Stability of Stochastic Differential Equations Part 1: Introduction Department of Mathematics and Statistics University of Strathclyde Glasgow, G1 1XH December 2010
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationStability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5
EECE 571M/491M, Spring 2008 Lecture 5 Stability of Continuous Systems http://courses.ece.ubc.ca/491m moishi@ece.ubc.ca Dr. Meeko Oishi Electrical and Computer Engineering University of British Columbia,
More informationReflections and Rotations in R 3
Reflections and Rotations in R 3 P. J. Ryan May 29, 21 Rotations as Compositions of Reflections Recall that the reflection in the hyperplane H through the origin in R n is given by f(x) = x 2 ξ, x ξ (1)
More informationA Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1
A Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1 Ali Jadbabaie, Claudio De Persis, and Tae-Woong Yoon 2 Department of Electrical Engineering
More informationA COMPONENT-BASED APPROACH TO HYBRID SYSTEMS SAFETY VERIFICATION
A COMPONENT-BASED APPROACH TO HYBRID SYSTEMS SAFETY VERIFICATION Andreas Müller andreas.mueller@jku.at Werner Retschitzegger werner.retschitzegger@jku.at Wieland Schwinger wieland.schwinger@jku.at Johannes
More informationLecture 7. Please note. Additional tutorial. Please note that there is no lecture on Tuesday, 15 November 2011.
Lecture 7 3 Ordinary differential equations (ODEs) (continued) 6 Linear equations of second order 7 Systems of differential equations Please note Please note that there is no lecture on Tuesday, 15 November
More information10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )
c Dr. Igor Zelenko, Fall 2017 1 10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections 7.2-7.4) 1. When each of the functions F 1, F 2,..., F n in right-hand side
More informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationNonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems
Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin
More informationControllability of linear PDEs (I): The wave equation
Controllability of linear PDEs (I): The wave equation M. González-Burgos IMUS, Universidad de Sevilla Doc Course, Course 2, Sevilla, 2018 Contents 1 Introduction. Statement of the problem 2 Distributed
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More information21 Linear State-Space Representations
ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may
More informationSolution of Linear State-space Systems
Solution of Linear State-space Systems Homogeneous (u=0) LTV systems first Theorem (Peano-Baker series) The unique solution to x(t) = (t, )x 0 where The matrix function is given by is called the state
More informationNonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems
Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationd A 0 + m t k A k 0 whenever λ min (B k (x)) t k λ max (B k (x)) for k = 1, 2,..., m x n B n (k).
MATRIX CUBES PARAMETERIZED BY EIGENVALUES JIAWANG NIE AND BERND STURMFELS Abstract. An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix
More informationAssignment 1: From the Definition of Convexity to Helley Theorem
Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationDiscrete abstractions of hybrid systems for verification
Discrete abstractions of hybrid systems for verification George J. Pappas Departments of ESE and CIS University of Pennsylvania pappasg@ee.upenn.edu http://www.seas.upenn.edu/~pappasg DISC Summer School
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationContinuous methods for numerical linear algebra problems
Continuous methods for numerical linear algebra problems Li-Zhi Liao (http://www.math.hkbu.edu.hk/ liliao) Department of Mathematics Hong Kong Baptist University The First International Summer School on
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More informationMath 54 Homework 3 Solutions 9/
Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of
More informationAgenda. 1 Cone programming. 2 Convex cones. 3 Generalized inequalities. 4 Linear programming (LP) 5 Second-order cone programming (SOCP)
Agenda 1 Cone programming 2 Convex cones 3 Generalized inequalities 4 Linear programming (LP) 5 Second-order cone programming (SOCP) 6 Semidefinite programming (SDP) 7 Examples Optimization problem in
More informationA Characterization of the Hurwitz Stability of Metzler Matrices
29 American Control Conference Hyatt Regency Riverfront, St Louis, MO, USA June -2, 29 WeC52 A Characterization of the Hurwitz Stability of Metzler Matrices Kumpati S Narendra and Robert Shorten 2 Abstract
More informationA projection algorithm for strictly monotone linear complementarity problems.
A projection algorithm for strictly monotone linear complementarity problems. Erik Zawadzki Department of Computer Science epz@cs.cmu.edu Geoffrey J. Gordon Machine Learning Department ggordon@cs.cmu.edu
More informationTOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS
TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS ALEX HUMMELS Abstract. This paper proves a theorem that gives conditions for the topological equivalence of linear ordinary differential
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationAre There Sixth Order Three Dimensional PNS Hankel Tensors?
Are There Sixth Order Three Dimensional PNS Hankel Tensors? Guoyin Li Liqun Qi Qun Wang November 17, 014 Abstract Are there positive semi-definite PSD) but not sums of squares SOS) Hankel tensors? If the
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationOn Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems
1 On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems O. Mason and R. Shorten Abstract We consider the problem of common linear copositive function existence for
More informationControl Software Model Checking Using Bisimulation Functions for Nonlinear Systems
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Control Software Model Checking Using Bisimulation Functions for Nonlinear Systems James Kapinski 1, Alexandre
More informationA heuristic prover for real inequalities
A heuristic prover for real inequalities Jeremy Avigad Department of Philosophy and Department of Mathematical Sciences Carnegie Mellon University joint work with Robert Y. Lewis and Cody Roux (many slides
More informationMore First-Order Optimization Algorithms
More First-Order Optimization Algorithms Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapters 3, 8, 3 The SDM
More informationDimensionality reduction of SDPs through sketching
Technische Universität München Workshop on "Probabilistic techniques and Quantum Information Theory", Institut Henri Poincaré Joint work with Andreas Bluhm arxiv:1707.09863 Semidefinite Programs (SDPs)
More information