distributed control synthesis using euler s method
play

Distributed control synthesis using Eulers method ent 2 , Julien - PowerPoint PPT Presentation

Distributed control synthesis using Eulers method ent 2 , Julien Alexandre dit Sandretto 4 , Alexandre Adrien Le Co Chapoutot 4 , Laurent Fribourg 1 , Florian De Vuyst 2 , Ludovic Chamoin 3 September 4, 2017 1 CNRS - LSV - ENS Paris-Saclay -


  1. Distributed control synthesis using Euler’s method ent 2 , Julien Alexandre dit Sandretto 4 , Alexandre Adrien Le Co¨ Chapoutot 4 , Laurent Fribourg 1 , Florian De Vuyst 2 , Ludovic Chamoin 3 September 4, 2017 1 CNRS - LSV - ENS Paris-Saclay - INRIA 2 CMLA - ENS Paris-Saclay 3 LMT - ENS Paris-Saclay 4 U2IS - ENSTA ParisTech RP17 Conference September 4, 2017 1 / 17

  2. Switched systems Switched systems A continuous switched system x ( t ) = f σ ( t ) ( x ( t )) ˙ state x ( t ) ∈ R n switching rule σ ( · ) : R + − → U finite set of (switched) modes U = { 1 , . . . , N } RP17 Conference September 4, 2017 2 / 17

  3. Switched systems Switched systems A continuous switched system x ( t ) = f σ ( t ) ( x ( t )) ˙ state x ( t ) ∈ R n switching rule σ ( · ) : R + − → U finite set of (switched) modes U = { 1 , . . . , N } We focus on sampled switched systems: given a sampling period τ > 0, switchings will occur at instants τ , 2 τ , . . . RP17 Conference September 4, 2017 2 / 17

  4. Switched systems Switched systems A continuous switched system x ( t ) = f σ ( t ) ( x ( t )) ˙ state x ( t ) ∈ R n switching rule σ ( · ) : R + − → U finite set of (switched) modes U = { 1 , . . . , N } We focus on sampled switched systems: given a sampling period τ > 0, switchings will occur at instants τ , 2 τ , . . . Control Synthesis problem: Find at each sampling time, the appropriate mode u ∈ U (in function of the value of x ( t )) in order to make the system satisfy a certain property. RP17 Conference September 4, 2017 2 / 17

  5. Switched systems Example: Two-room apartment ˙ � T 1 � � − α 21 − α e 1 − α f u 1 � � T 1 � � α e 1 T e + α f T f u 1 � α 21 = + . T 2 α 12 − α 12 − α e 2 − α f u 2 T 2 α e 2 T e + α f T f u 2 RP17 Conference September 4, 2017 3 / 17

  6. Switched systems Example: Two-room apartment ˙ � T 1 � � − α 21 − α e 1 − α f u 1 � � T 1 � � α e 1 T e + α f T f u 1 � α 21 = + . T 2 α 12 − α 12 − α e 2 − α f u 2 T 2 α e 2 T e + α f T f u 2 � � � � � � � � � � u 1 0 0 1 1 Modes: = , , , ; sampling period τ u 2 0 1 0 1 RP17 Conference September 4, 2017 3 / 17

  7. Switched systems Example: Two-room apartment T 1 = f 1 ˙ u 1 ( T 1 ( t ) , T 2 ( t )) ˙ T 2 = f 2 u 2 ( T 1 ( t ) , T 2 ( t )) � � � � � � � 1 � � 1 � 0 0 u 1 Modes: = ; sampling period τ , , , 0 1 0 1 u 2 RP17 Conference September 4, 2017 3 / 17

  8. Switched systems Example: Two-room apartment T 1 = f 1 ˙ u 1 ( T 1 ( t ) , T 2 ( t )) ˙ T 2 = f 2 u 2 ( T 1 ( t ) , T 2 ( t )) � � � � � � � 1 � � 1 � 0 0 u 1 Modes: = ; sampling period τ , , , 0 1 0 1 u 2 �� � � � � �� 0 0 1 A pattern π is a finite sequence of modes, e.g. · · 1 0 1 RP17 Conference September 4, 2017 3 / 17

  9. Switched systems Example: Two-room apartment T 1 = f 1 ˙ u 1 ( T 1 ( t ) , T 2 ( t )) ˙ T 2 = f 2 u 2 ( T 1 ( t ) , T 2 ( t )) � � � � � � � 1 � � 1 � 0 0 u 1 Modes: = ; sampling period τ , , , 0 1 0 1 u 2 �� � � � � �� 0 0 1 A pattern π is a finite sequence of modes, e.g. · · 1 0 1 A state dependent control consists in selecting at each τ a mode (or a pattern) according to the current value of the state. RP17 Conference September 4, 2017 3 / 17

  10. Switched systems Reachability and Stability Problems We consider the state-dependent control problem of synthesizing σ : At each sampling time t , find the appropriate switched mode u ∈ U according to the current value of x , in order to achieve some objectives: RP17 Conference September 4, 2017 4 / 17

  11. Switched systems Reachability and Stability Problems We consider the state-dependent control problem of synthesizing σ : At each sampling time t , find the appropriate switched mode u ∈ U according to the current value of x , in order to achieve some objectives: reachability (given a target region R , find a control which drives x to R , for any x in R init ) RP17 Conference September 4, 2017 4 / 17

  12. Switched systems Reachability and Stability Problems We consider the state-dependent control problem of synthesizing σ : At each sampling time t , find the appropriate switched mode u ∈ U according to the current value of x , in order to achieve some objectives: reachability (given a target region R , find a control which drives x to R , for any x in R init ) stability (once in R , find a control which always maintain x in a neighborhood S = R + ε of R ) RP17 Conference September 4, 2017 4 / 17

  13. Switched systems Reachability and Stability Problems We consider the state-dependent control problem of synthesizing σ : At each sampling time t , find the appropriate switched mode u ∈ U according to the current value of x , in order to achieve some objectives: reachability (given a target region R , find a control which drives x to R , for any x in R init ) stability (once in R , find a control which always maintain x in a neighborhood S = R + ε of R ) NB: classic stabilization to an equilibrium point, impossible to achieve here � practical stability RP17 Conference September 4, 2017 4 / 17

  14. (R,S)-stability Focus on ( R , S )-stability Being given a recurrence (rectang.) set R and a safety (rectang.) set S , we consider the state-dependent control problem of synthesizing σ : At each sampling time t , determine the switched mode u ∈ U in function of the value of x ( t ), in order to satisfy: (R,S)-stability: if x (0) ∈ R , then x ( t ): 1 returns infinitely often into R , and 2 always stays in S . RP17 Conference September 4, 2017 5 / 17

  15. (R,S)-stability Focus on ( R , S )-stability Being given a recurrence (rectang.) set R and a safety (rectang.) set S , we consider the state-dependent control problem of synthesizing σ : At each sampling time t , determine the switched mode u ∈ U in function of the value of x ( t ), in order to satisfy: (R,S)-stability: if x (0) ∈ R , then x ( t ): 1 returns infinitely often into R , and 2 always stays in S . ⇒ Need to know x ( t ) RP17 Conference September 4, 2017 5 / 17

  16. Euler’s method Euler’s estimation method of x ( t ) (with ˙ x ( t ) = f ( x ( t ))) x ( t ) = ˜ ˜ x ( t 0 ) + f (˜ x ( t 0 ))( t − t 0 ) Suppose that, for the current step size τ (or a sub-sampling size h ), the derivative is constant and equal to the derivative at the starting point RP17 Conference September 4, 2017 6 / 17

  17. Euler’s method Global error estimated with Lipschitz constant L The global error at t = t 0 + kh is equal to � x ( t ) − ˜ x ( t ) � . RP17 Conference September 4, 2017 7 / 17

  18. Euler’s method Global error estimated with Lipschitz constant L The global error at t = t 0 + kh is equal to � x ( t ) − ˜ x ( t ) � . In case n = 1, if f is Lipschitz cont. ( � f ( y ) − f ( x ) � ≤ L � y − x � ), then: error ( t ) ≤ hM 2 L ( e L ( t − t 0 ) − 1) where L is the Lipschitz constant of f (and M an upper bound on f ′′ ). RP17 Conference September 4, 2017 7 / 17

  19. Euler’s method Global error estimated with Lipschitz constant L The global error at t = t 0 + kh is equal to � x ( t ) − ˜ x ( t ) � . In case n = 1, if f is Lipschitz cont. ( � f ( y ) − f ( x ) � ≤ L � y − x � ), then: error ( t ) ≤ hM 2 L ( e L ( t − t 0 ) − 1) where L is the Lipschitz constant of f (and M an upper bound on f ′′ ). In case of “stiff” equations, L can be very large. RP17 Conference September 4, 2017 7 / 17

  20. Euler’s method Global error estimated with Lipschitz constant L The global error at t = t 0 + kh is equal to � x ( t ) − ˜ x ( t ) � . In case n = 1, if f is Lipschitz cont. ( � f ( y ) − f ( x ) � ≤ L � y − x � ), then: error ( t ) ≤ hM 2 L ( e L ( t − t 0 ) − 1) where L is the Lipschitz constant of f (and M an upper bound on f ′′ ). In case of “stiff” equations, L can be very large. We now consider a more appropriate constant λ that leads to sharper estimations of the Euler error. RP17 Conference September 4, 2017 7 / 17

  21. Euler’s method Dahlquist’s constant λ (“one-sided Lipschitz” constant) λ ∈ R is a constant s.t., for all x , y ∈ S : � f ( y ) − f ( x ) , y − x � ≤ λ � y − x � 2 where �· , ·� denote the scalar product of two vectors of R n 1 Define V ( x , x ′ ) = � x − x ′ � 2 ; we have: dV dt ≤ λ V (hence V = V 0 e λ t ). So V is an exponentially stable Lyapunov function when λ < 0. RP17 Conference September 4, 2017 8 / 17

  22. Euler’s method Dahlquist’s constant λ (“one-sided Lipschitz” constant) λ ∈ R is a constant s.t., for all x , y ∈ S : � f ( y ) − f ( x ) , y − x � ≤ λ � y − x � 2 where �· , ·� denote the scalar product of two vectors of R n λ can be < 0 ( → contractivity) 1 ; even in case λ > 0, in practice: λ << L − → sharper ( λ -exponential based) estimation of Euler error 1 Define V ( x , x ′ ) = � x − x ′ � 2 ; we have: dV dt ≤ λ V (hence V = V 0 e λ t ). So V is an exponentially stable Lyapunov function when λ < 0. RP17 Conference September 4, 2017 8 / 17

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend