Lecture #9 Analysis tools for hybrid systems: Impact maps João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.

Slides:



Advertisements
Similar presentations
Finite Difference Discretization of Elliptic Equations: 1D Problem Lectures 2 and 3.
Advertisements

Lecture #4 Simulation of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Properties of State Variables
Solving Systems of Equations. Rule of Thumb: More equations than unknowns  system is unlikely to have a solution. Same number of equations as unknowns.
1 Formal Models for Stability Analysis : Verifying Average Dwell Time * Sayan Mitra MIT,CSAIL Research Qualifying Exam 20 th December.
Lecture #13 Stability under slow switching & state-dependent switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched.
Lecture #1 Hybrid systems are everywhere: Examples João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
TCOM 501: Networking Theory & Fundamentals
1 Part III Markov Chains & Queueing Systems 10.Discrete-Time Markov Chains 11.Stationary Distributions & Limiting Probabilities 12.State Classification.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
A De-coupled Sliding Mode Controller and Observer for Satellite Attitude Control Ronald Fenton.
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
Some Fundamentals of Stability Theory
Ch 3.3: Linear Independence and the Wronskian
Modern Control Systems1 Lecture 07 Analysis (III) -- Stability 7.1 Bounded-Input Bounded-Output (BIBO) Stability 7.2 Asymptotic Stability 7.3 Lyapunov.
1 Chapter 2 Limits and Continuity Rates of Change and Limits.
ECE 552 Numerical Circuit Analysis Chapter Six NONLINEAR DC ANALYSIS OR: Solution of Nonlinear Algebraic Equations Copyright © I. Hajj 2012 All rights.
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
Computational Optimization
1 © Alexis Kwasinski, 2011 DC micro-grids comprise cascade distributed power architectures – converters act as interfaces Point-of-load converters present.
6. Markov Chain. State Space The state space is the set of values a random variable X can take. E.g.: integer 1 to 6 in a dice experiment, or the locations.
Applied Numerical Analysis Chapter 2 Notes (continued)
Lecture 9. Arithmetic and geometric series and mathematical induction
Autumn 2008 EEE8013 Revision lecture 1 Ordinary Differential Equations.
Ch 5.3: Series Solutions Near an Ordinary Point, Part II A function p is analytic at x 0 if it has a Taylor series expansion that converges to p in some.
Chapter 4 Power Series Solutions 4.1 Introduction
Generalized Semi-Markov Processes (GSMP)
Multiple-Lyapunov Functions for Guaranteeing the Stability of a class of Hybrid Systems.
WEEK 8 SYSTEMS OF EQUATIONS DETERMINANTS AND CRAMER’S RULE.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
LURE 2009 SUMMER PROGRAM John Alford Sam Houston State University.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Lecture #8 Stability and convergence of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Lecture #5 Properties of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Lecture #16 Nonlinear Supervisory Control João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Chapter 8 Integration Techniques. 8.1 Integration by Parts.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
Copyright © Cengage Learning. All rights reserved. 11 Infinite Sequences and Series.
Lecture #3 What can go wrong? Trajectories of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Section 7.7 Improper Integrals. So far in computing definite integrals on the interval a ≤ x ≤ b, we have assumed our interval was of finite length and.
linear  2.3 Newton’s Method ( Newton-Raphson Method ) 1/12 Chapter 2 Solutions of Equations in One Variable – Newton’s Method Idea: Linearize a nonlinear.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Domain of Attraction Remarks on the domain of attraction
Lecture #14 Computational methods to construct multiple Lyapunov functions & Applications João P. Hespanha University of California at Santa Barbara Hybrid.
Lecture #2 How to describe a hybrid system? Formal models for hybrid system João P. Hespanha University of California at Santa Barbara Hybrid Control and.
Lecture #12 Controller realizations for stable switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
1 ۞ An eigenvalue λ and an eigenfunction f(x) of an operator Ĥ in a space S satisfy Week 6 2. Properties of self-adjoint operators where f(x) is implied.
Asymptotic behaviour of blinking (stochastically switched) dynamical systems Vladimir Belykh Mathematics Department Volga State Academy Nizhny Novgorod.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Ch. 3 Iterative Method for Nonlinear problems EE692 Parallel and Distribution.
Infinite Series Copyright © Cengage Learning. All rights reserved.
Chapter Three SEQUENCES
Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems NO CLASSES.
Department of Statistics University of Rajshahi, Bangladesh
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Finite Element Method. History Application Consider the two point boundary value problem.
Eigenvalues, Zeros and Poles
Stability and instability in nonlinear dynamical systems
Mean Value Theorem 5.4.
João P. Hespanha University of California at Santa Barbara
§7-4 Lyapunov Direct Method
Autonomous Cyber-Physical Systems: Dynamical Systems
Lecture #10 Switched systems
Stability Analysis of Linear Systems
Limits, Continuity and Definition of Derivative
Guosong Yang1, A. James Schmidt2, and Daniel Liberzon2
On Topological Entropy and Stability of Switched Linear Systems
Presentation transcript:

Lecture #9 Analysis tools for hybrid systems: Impact maps João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems

Summary Analysis tools for hybrid systems–Impact maps Fixed-point theorem Stability of periodic solutions

Example #7: Server system with congestion control r server B rate of service (bandwidth) incoming rate q q max q ¸ q max ? r › m r – there is an asymptotically stable periodic solution

Example #7: Server system with congestion control q ¸ q max ? r › m r – For given time t 0, and initial conditions q 0, r 0 If a transition occurred at time t 0, when will the next one occur? right after one jumpright after next jump impact, return, or Poincaré map

Impact maps mode q * jump into mode q * (not necessarily from a different mode) Recurring mode ´ q * 2  such that for every initialization there are infinitely many transitions into q *, i.e., ¤ § {q * = q, (q,x)   (q –,x – ) } Definition: Impact, return, or Poincaré map (Poincaré from ODEs) Function F : R n ! R n such that if t k and t k+1 are consecutive times for which there is a transition into q * then x(t k +1 ) = F(x(t k )) always eventually time-to-impact map ´ function  : R n ! (0, 1 ) such that t k +1 – t k =  ( x(t k ) ) mode q 2 mode q 1 mode q 3 mode q 4

Example #7: Server system with congestion control q ¸ q max ? r › m r – If a transition occurred at time t 0, when will the next one occur? impact map time-to-impact map right after one jumpright after next jump fixpoints.nb average rate?

Example #7: Server system with congestion control q ¸ q max ? r › m r – x 0 › (1,1) x 1 › F(x 0 ) x 2 › F(x 1 ) fixpoints.nb the impact points eventually converge impact maptime-to-impact map

Example #7: Server system with congestion control q ¸ q max ? r › m r – the impact points eventually converge congestion1.nb impact maptime-to-impact map

Contraction Mapping Theorem Contraction mapping ´ function F : R n ! R n for which 9  2 [0,1) such that Lipschitz coefficient Contraction mapping Theorem: If F : R n ! R n is a contraction mapping then 1.there is one and only point x * 2 R n such that F(x * ) = x * 2.for every x 0 2 R n, the sequence x k+1 = F( x k ), k ¸ 0 converges to x * as k !1 fixed-point of F Why? 1.Consider sequence: x k+1 = F( x k ), k ¸ 0. After some work (induction …) 2.This means that the sequence x k+1 = F( x k ),  ¸ 0 is Cauchy, i.e., 8 e > 0 9 N 8 m, k > N : ||x m – x k || · e and therefore x k converges as k ! 1. 3.Let x * be the limit. Then F is continuous

Contraction Mapping Theorem Contraction mapping ´ function F : R n ! R n for which 9  2 [0,1) such that Lipschitz coefficient Contraction mapping Theorem: If F : R n ! R n is a contraction mapping then 1.there is one and only point x * 2 R n such that F(x * ) = x * 2.for every x 0 2 R n, the sequence x k+1 = F( x k ), k ¸ 0 converges to x * as k !1 fixed-point of F Why? So far x * › lim F(x k ) exists and F(x * ) = x * (unique??) 4.Suppose y * is another fixed point: x * must be equal to y *

Contraction Mapping Theorem Contraction mapping ´ function F : R n ! R n for which 9  2 [0,1) such that Lipschitz coefficient Contraction mapping Theorem: If F : R n ! R n is a contraction mapping then 1.there is one and only point x * 2 R n such that F(x * ) = x * 2.for every x 0 2 R n, the sequence x k+1 = F( x k ), k ¸ 0 converges to x * as k !1 fixed-point of F Example: contraction as long as m < 1

Example #7: Server system with congestion control q ¸ q max ? r › m r – the impact points eventually converge to congestion1.nb impact maptime-to-impact map

Impact maps Recurring mode ´ q * 2  such that for every initialization there are infinitely many transitions into q *, i.e., ¤ § {q * = q, (q,x)   (q –,x – ) } Definition: Impact map Function F : R n ! R n such that if t k and t k+1 are consecutive times for which there is a transition into q * then x(t k+1 ) = F(x(t k )) Theorem: Suppose the hybrid system has a recurring mode q * 2  and 1.the corresponding impact map is a contraction 2.the interval map is nonzero on a neighborhood of the fixed point x * of the impact map then a)it has a periodic solution (may be constant) b)the impact points converge to the unique fixed point of F

Impact maps Theorem: Suppose the hybrid system has a recurring mode q * 2  and 1.the corresponding impact map is a contraction 2.the interval map is nonzero on a neighborhood of the fixed point x* of the impact map then a)it has a (global) periodic solution with period T ›  (x * ) (may be constant) b)the impact points converge to the unique fixed point of F Why? a)Since F is a contraction it has a fixed point x * 2 R n Take any t 0. Since F(x * ) = x *, q(t 0 ) = q *, x(t 0 ) = x * ) q(t 0 +T) = q *, x(t 0 +T) = F(x * ) = x * b)Impact points are defined by the sequence x(t k+1 ) = F(x(t k )), which converges to the fixed point x *

Example #1: Bouncing ball x 1 · 0 & x 2 < 0 ? x 2 › – c x 2 – t time-to-impact map is not bounded below contraction mapping for c < 1 impact maptime-to-impact map

Impact maps Theorem: Suppose the hybrid system has a recurring mode and 1.the corresponding impact map is a contraction 2.the interval map is nonzero on a neighborhood of the fixed point x* of the impact map then a)it has a periodic solution (may be constant) b)the impact points converge to the unique fixed point of F Does not necessarily mean that the periodic solution is stable (Lyapunov or Poincaré sense) Is the periodic solution unique? yes/no? in what sense

Impact maps the periodic solution is an ellipse any solution “outside” is far from the periodic solution when x 1 = 0 q = 1 q = 2 jump to q = 1 (impact points) x1x1 x2x2

Impact maps Theorem: Suppose the hybrid system has a recurring mode and 1.the corresponding impact map is a contraction 2.the interval map is nonzero on a neighborhood of the fixed point x* of the impact map then a)it has a periodic solution (may be constant) b)the impact points converge to the unique fixed point of F Moreover, if 1.the sequence of jumps between consecutive transitions to q * is the same for every initial condition 2. f is locally Lipschitz with respect to x   (continuous-state reset) is continuous with respect to x 4.interval map is bounded in a neighborhood of x* then a)any solution converges to a periodic solution b)every periodic solution is Poincaré asymptotically stable

Impact maps Why? (since the sequence of jumps is the same we don’t need to worry about  ) a)i) 1–3 guarantee continuity with respect to initial conditions (on finite interval) ii) Therefore, if at an impact time t k, x is close to the fixed point x* it will remain close to the periodic solution until the next impact (time between impacts is bounded because of 4) iii) Moreover, if x(t k ) converges to x* the whole solution converges to the periodic solution b)Stability from ii) convergence from iii) plus the fact that, from a Poincaré perspective, all periodic solutions are really the same (by uniqueness of fixed point) Moreover, if 1.the sequence of jumps between consecutive transitions to q * is the same for every initial condition 2. f is locally Lipschitz with respect to x   (continuous-state reset) is continuous with respect to x 4.interval map is bounded in a neighborhood of x* then a)any solution converges to a periodic solution b)every periodic solution is Poincaré asymptotically stable

Proving that a function is a contraction Contraction mapping ´ function F : R n ! R n for which 9  2 [0,1) such that Mean Value Theorem: || F(x) – F(x’) || ·  || x – x’ || 8 x, x’ 2 R n where A good tool to prove that a mapping is contraction… A mapping may be contracting for one norm but not for another – often most of the effort is spent in finding the “right” norm contraction for || ¢ || 1 not a contraction for || ¢ || 2 (constant matrix for a linear or affine F)

Stability of difference equations Given a discrete-time system equilibrium point ´ x eq 2 R n for which F(x eq ) = x eq thus x k = x eq 8 k ¸ 0 is a solution to the difference equation Definition ( e –  definition): The equilibrium point x eq 2 R n is (Lyapunov) stable if The equilibrium point x eq 2 R n is (globally) asymptotically stable if it is Lyapunov stable and for every initial state x k ! x eq as k !1. (when F is a contraction we automatically have that an equilibrium point exists & global asymptotic stability with exponential convergence)

Impact maps Theorem: Suppose the hybrid system has a recurring mode and 1.the discrete-time impact system x k+1 = F(x k ) has an asymptotically stable equilibrium point x eq 2.the interval map is nonzero on a neighborhood of the equilibrium point x eq of the impact system then a)it has a periodic solution (may be constant) b)the impact points converge to x eq Moreover, if 1.the sequence of jumps between consecutive transitions to q * is the same for every initial condition 2. f is locally Lipschitz with respect to x   (continuous-state reset) is continuous with respect to x 4.interval map is bounded in a neighborhood of x eq then a)any solution converges to a periodic solution b)every periodic solution is Poincaré asymptotically stable

Next lecture… Decoupling between continuous and discrete dynamics Switched systems Supervisors Stability of switched systems Stability under arbitrary switching