Lecture #8 Stability and convergence of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.

Slides:



Advertisements
Similar presentations
 (x) f(x,u) u x f(x,  (x) x. Example: Using feed-forward, what should be canceled?
Advertisements

Lecture #4 Simulation of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
INTRODUCTION to SWITCHED SYSTEMS ; STABILITY under ARBITRARY SWITCHING
THE ROLE OF LIE BRACKETS IN STABILITY OF LINEAR AND NONLINEAR SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical &
NONLINEAR OBSERVABILITY NOTIONS and STABILITY of SWITCHED SYSTEMS CDC ’02 João Hespanha Univ. of California at Santa Barbara Daniel Liberzon Univ. of Illinois.
Properties of State Variables
TOWARDS ROBUST LIE-ALGEBRAIC STABILITY CONDITIONS for SWITCHED LINEAR SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical &
1 of 9 ON ALMOST LYAPUNOV FUNCTIONS Daniel Liberzon University of Illinois, Urbana-Champaign, U.S.A. TexPoint fonts used in EMF. Read the TexPoint manual.
Lecture #13 Stability under slow switching & state-dependent switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched.
1 Stability of Hybrid Automata with Average Dwell Time: An Invariant Approach Daniel Liberzon Coordinated Science Laboratory University of Illinois at.
Lecture #1 Hybrid systems are everywhere: Examples João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1cs542g-term Notes. 2 Solving Nonlinear Systems  Most thoroughly explored in the context of optimization  For systems arising in implicit time.
Lecture 8: Clock Distribution, PLL & DLL
Spring semester 2006 ESE 601: Hybrid Systems Review material on continuous systems I.
Some Fundamentals of Stability Theory
Modern Control Systems1 Lecture 07 Analysis (III) -- Stability 7.1 Bounded-Input Bounded-Output (BIBO) Stability 7.2 Asymptotic Stability 7.3 Lyapunov.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 10. Ordinary differential equations. Initial value problems.
1 of 12 COMMUTATORS, ROBUSTNESS, and STABILITY of SWITCHED LINEAR SYSTEMS SIAM Conference on Control & its Applications, Paris, July 2015 Daniel Liberzon.
1 © Alexis Kwasinski, 2011 DC micro-grids comprise cascade distributed power architectures – converters act as interfaces Point-of-load converters present.
Autumn 2008 EEE8013 Revision lecture 1 Ordinary Differential Equations.
EE3010 SaS, L7 1/19 Lecture 7: Linear Systems and Convolution Specific objectives for today: We’re looking at continuous time signals and systems Understand.
Multiple-Lyapunov Functions for Guaranteeing the Stability of a class of Hybrid Systems.
1  (x) f(x,u) u x f(x,  (x) x Example: Using feed-forward, what should be canceled?
Lecture #9 Analysis tools for hybrid systems: Impact maps João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
TUTORIAL on LOGIC-BASED CONTROL Part I: SWITCHED CONTROL SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Department of Mechanical Engineering The University of Strathclyde, Glasgow Hybrid Systems: Modelling, Analysis and Control Yan Pang Department of Mechanical.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
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.
All Pair Shortest Path IOI/ACM ICPC Training June 2004.
LYAPUNOV STABILITY THEORY:
Feedback Linearization Presented by : Shubham Bhat (ECES-817)
Motivation As we’ve seen, chaos in nonlinear oscillator systems, such as the driven damped pendulum discussed last time is very complicated! –The nonlinear.
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.
Hybrid Modeling of TCP Congestion Control João P. Hespanha, Stephan Bohacek, Katia Obraczka, Junsoo Lee University of Southern California.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Lecture #14 Computational methods to construct multiple Lyapunov functions & Applications João P. Hespanha University of California at Santa Barbara Hybrid.
COMMUTATION RELATIONS and STABILITY of SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
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.
State Observer (Estimator)
Lecture #12 Controller realizations for stable switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Asymptotic behaviour of blinking (stochastically switched) dynamical systems Vladimir Belykh Mathematics Department Volga State Academy Nizhny Novgorod.
4. Introduction to Signal and Systems
STABILITY of SWITCHED SYSTEMS – family of asymptotically stable systems – piecewise constant switching signal Want GUAS w.r.t. want GUES For switched linear.
Ordinary Differential Equations
From Natural Language to LTL: Difficulties Capturing Natural Language Specification in Formal Languages for Automatic Analysis Elsa L Gunter NJIT.
Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems NO CLASSES.
17 1 Stability Recurrent Networks 17 3 Types of Stability Asymptotically Stable Stable in the Sense of Lyapunov Unstable A ball bearing, with dissipative.
Controller Synthesis For Timed Automata Authors : Eugene Asarin, Oded Maler, Amir Pnueli and Joseph Sifakis Yean-Ru Chen Embedded System Laboratory of.
Ch 9.6: Liapunov’s Second Method In Section 9.3 we showed how the stability of a critical point of an almost linear system can usually be determined from.
11-1 Lyapunov Based Redesign Motivation But the real system is is unknown but not necessarily small. We assume it has a known bound. Consider.
Eigenvalues, Zeros and Poles
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Stability and instability in nonlinear dynamical systems
João P. Hespanha University of California at Santa Barbara
§7-4 Lyapunov Direct Method
Autonomous Cyber-Physical Systems: Dynamical Systems
SWITCHED SYSTEMS Switched system: is a family of systems
SWITCHED SYSTEMS Switched system: is a family of systems
Stability.
Lecture #6 Reachability
Lecture #10 Switched systems
Stability Analysis of Linear Systems
Signals and Systems Lecture 2
Guosong Yang1, A. James Schmidt2, and Daniel Liberzon2
Lecture 3: Signals & Systems Concepts
On Topological Entropy and Stability of Switched Linear Systems
Presentation transcript:

Lecture #8 Stability and convergence of hybrid systems João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems

Summary Lyapunov stability of hybrid systems

Properties of hybrid systems  sig ´ set of all piecewise continuous signals x:[0,T) ! R n, T 2 (0, 1 ]  sig ´ set of all piecewise constant signals q:[0,T) ! , T 2 (0, 1 ] Sequence property ´ p :  sig £  sig ! {false,true} E.g., A pair of signals (q, x) 2  sig £  sig satisfies p if p(q, x) = true A hybrid automaton H satisfies p ( write H ² p ) if p ( q, x ) = true, for every solution (q, x) of H “ensemble properties” ´ property of the whole family of solutions (cannot be checked just by looking at isolated solutions) e.g., continuity with respect to initial conditions…

Lyapunov stability of ODEs (recall) Definition (continuity definition): A solution x * is (Lyapunov) stable if T is continuous at x * 0 › x * (0), i.e., 8 e > 0 9  >0 : ||x 0 – x * 0 || ·  ) ||T(x 0 ) – T(x * 0 )|| sig · e  sig ´ set of all piecewise continuous signals taking values in R n Given a signal x 2  sig, ||x|| sig › sup t ¸ 0 ||x(t)|| ODE can be seen as an operator T : R n !  sig that maps x 0 2 R n into the solution that starts at x(0) = x 0 signal norm sup t ¸ 0 ||x(t) – x * (t)|| · e  e x(t)x(t) x*(t)x*(t) pend.m

Lyapunov stability of hybrid systems mode q 1 mode q 2  1 (q 1, x – ) = q 2 ? x  ›  2 (q 1, x – )  sig ´ set of all piecewise continuous signals x:[0,T) ! R n, T 2 (0, 1 ]  sig ´ set of all piecewise constant signals q:[0,T) ! , T 2 (0, 1 ] Definition (continuity definition): A solution (q *,x * ) is (Lyapunov) stable if T is continuous at (q * (0), x * (0)). Hybrid automaton can be seen as an operator T :  £ R n !  sig  £  sig that maps (q 0, x 0 ) 2  £ R n into the solution that starts at q(0) = q 0, x(0) = x 0 To make sense of continuity we need ways to measure “distances” in  £ R n and  sig  £  sig

Lyapunov stability of hybrid systems Definition (continuity definition): A solution (q *,x * ) is (Lyapunov) stable if T is continuous at (q 0 *, x 0 * ) › (q * (0), x * (0)), i.e., 8 e > 0 9  >0 : d 0 ( (q * (0), x * (0)), (q(0), x(0)) ) ·   sup t ¸ 0 d T ( (q * (t), x * (t)), (q(t), x(t)) ) · e A few possible “metrics” one cares very much about the discrete states matching one does not care at all about the discrete states matching 1.If the solution starts close to (q *,x * ) (with respect to the metric d 0 ) it will remain close to it forever (with respect to the metric d T ) 2. e can be made arbitrarily small by choosing  sufficiently small Note: may actually not be metrics on  £ R n because one may want “zero-distance” between points. However, still define a topology on  £ R n, which is what is really needed to make sense of continuity. See “alternative” lecture #8 for more…

Example #2: Thermostat t turn heater off turn heater on q = 2 x x · 73 ? x ¸ 77 ? q = 1 q = 2 heater room x ´ mean temperature Why? no trajectory is stableall trajectories are stable for d disc “metric” both on initial cond. and trajectory (d 0 = d T = d disc ) for d 0 = d disc and d T = d cont some trajectories are stable others unstable for d cont “metric” both on initial cond. and trajectory (d 0 = d T = d cont )

Example #5: Tank system y pump goal ´ prevent the tank from emptying or filling up constant outflow ´  = 1 pump-on inflow ´ = 3  =.5 ´ delay between command is sent to pump and the time it is executed pump off (q = 1) wait to on (q = 2) pump on (q = 3 ) wait to off (q = 4) y · 1 ? y ¸ 2 ?  › 0  ¸  ?  › 0 this “metric” only distinguishes between modes based on the state of the pump

Example #4: Inverted pendulum swing-up  u 2 [-1,1] Hybrid controller: 1 st pump/remove energy into/from the system by applying maximum force, until E ¼ 0 (energy control) 2 nd wait until pendulum is close to the upright position 3 th next to upright position use feedback linearization controller pump energy remove energy wait stabilize E 2 [- ,  ] ? E >  E < –   + |  | · 

Example #4: Inverted pendulum swing-up  u 2 [-1,1] pump energy remove energy wait stabilize E 2 [- ,  ] ? E >  E < –   + |  | ·  A possible “metric” 1. for solutions (q *, x * ) that start in “s,” we only consider perturbations that also start in “s” 2. for solutions (q *, x * ) that start outside “s,” the perturbations can start in any state

Asymptotic stability for hybrid systems Definition: A solution (q *, x * ) is (globally) asymptotically stable if it is stable, every solution (q,x) exists globally, and q ! q *, x ! x * as t !1, i.e., 8 e > 0 9  >0 sup t ¸  d T ( (q * (t), x * (t)), (q(t), x(t)) ) · e Hybrid automaton can be seen as an operator T :  £ R n !  sig  £  sig that maps (q 0, x 0 ) 2  £ R n into the solution that starts at q(0) = q 0, x(0) = x 0 Definition (continuity definition): A solution (q *,x * ) is (Lyapunov) stable if T is continuous at (q 0 *, x 0 * ) › (q * (0), x * (0)), i.e., 8 e > 0 9  >0 : d 0 ( (q * (0), x * (0)), (q(0), x(0)) ) ·   sup t ¸ 0 d T ( (q * (t), x * (t)), (q(t), x(t)) ) · e

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 – every solution exists globally and converges to a periodic solution that is stable. Do we have asymptotic stability?

Example #7: Server system with congestion control r server B rate of service (bandwidth) incoming rate q q max every solution exists globally and converges to a periodic solution that is stable. Do we have asymptotic stability? q ¸ q max ? r › m r – No, its difficult to have asymptotic stability for non-constant solutions due to the “synchronization” requirement. (not even stability… Always?)

Example #2: Thermostat t turn heater off turn heater on q = 2 x x · 73 ? x ¸ 77 ? q = 1 q = 2 heater room x ´ mean temperature no trajectory is stable all trajectories are stable but not asymptotically for d disc “metric” both on initial cond. and trajectory (d 0 = d T = d disc ) Why? for d 0 = d disc and d T = d cont

Stability of sets (q(t), x(t)) For constant trajectories (q *,x * ) its just the sup-norm: distance at the point t where the (q(t), x(t)) is the furthest apart from (q *, x * ) can also be viewed as the distance from the trajectory (q, x) to the set {(q * (t), x * (t)) :t ¸ t 0 } (q * (t), x * (t)) Poincaré distance between (q, x), (q *,x * ) 2  sig  £  sig after t 0

Stability of sets Definition: A solution (q *, x * ) is Poincaré asymptotically stable if it is Poincaré stable, every solution (q, x) exists globally, and d P ((q,x), (q *,x * ); t ) ! 0 as t !1 in more modern terminology one would say that the following set is asymptotically stable:{ (q * (t), x * (t)) : t ¸ 0 } ½  £  Definition: A solution (q *, x * ) is Poincaré stable if 8 e > 0 9  >0 : d 0 ( (q(0), x(0)), (q * (0), x * (0)) ) ·   d P ((q *,x * ), (q,x); 0) = sup t ¸ 0 inf  ¸ 0 d T ( (q(t), x(t)), (q * (  ), x * (  )) ) · e in more modern terminology one would say that the following set is stable { (q * (t), x * (t)) : t ¸ 0 } ½  £  Poincaré distance between (q, x), (q *,x * ) 2  sig  £  sig after t 0

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 – q max r q all trajectories are Poincaré asymptotically stable

To think about … 1.With hybrid systems there are many possible notions of stability. (especially due to the topology imposed on the discrete state) WHICH ONE IS THE BEST? (engineering question, not a mathematical one) What type of perturbations do you want to consider on the initial conditions? (this will define the topology on the initial conditions) What type of changes are you willing to accept in the solution? (this will define the topology on the solution) 2.Even with ODEs there are several alternatives: e.g., 8 e > 0 9  >0 : ||x 0 – x eq || ·  ) sup t ¸ 0 ||x(t) – x eq || · e or 8 e > 0 9  >0 : ||x 0 – x eq || ·  )s 0 1 ||x(t) – x eq || dt · e or 8 e > 0 9  >0 : ||x 0 – x 0 * || ·  ) d P ( x, x * ; 0 ) · e (even for linear systems these definitions may differ: Why?) Lyapunov integral Poincaré

Next lecture… Analysis tools for hybrid systems: Impact maps Fixed-point theorem Stability of periodic solutions