Going beyond Zeno through a pointwise asymptotically stable set in - - PowerPoint PPT Presentation

going beyond zeno through a pointwise asymptotically
SMART_READER_LITE
LIVE PREVIEW

Going beyond Zeno through a pointwise asymptotically stable set in - - PowerPoint PPT Presentation

Going beyond Zeno through a pointwise asymptotically stable set in a hybrid system Rafal Goebel Mathematics and Statistics, Loyola University Chicago supported by Simons 315326 Trento, January 2017 Introduction and outline Going past Zeno:


slide-1
SLIDE 1

Going beyond Zeno through a pointwise asymptotically stable set in a hybrid system

Rafal Goebel

Mathematics and Statistics, Loyola University Chicago supported by Simons 315326

Trento, January 2017

slide-2
SLIDE 2

Introduction and outline

Going past Zeno: Hybrid inclusions, examples, and well-posedness Pointwise asymptotic stability Small ordinary time property Good behavior of limits of Zeno solutions Well-posedness past Zeno Optimal control for pointwise asymptotic stability: Finite length Lyapunov functions Optimal and robust feedback stabilization in discrete time Based on:

Set-valued Lyapunov functions for difference inclusions, G., Automatica 2011 Robustness of stability through necessary and sufficient Lyapunov-like conditions ..., G., SCL 2014 Results on optimal stabilization of a continuum of equilibria, G., CDC 2016

and joint work with R. Sanfelice:

Notions and sufficient conditions for pointwise asymptotic stability in hybrid systems, G. and Sanfelice, NOLCOS 2016 How well-posedness of hybrid systems can extend beyond Zeno times G. and Sanfelice, CDC 2016 Goebel Beyond Zeno through a PAS set

slide-3
SLIDE 3

Hybrid Inclusions

Goebel Beyond Zeno through a PAS set

slide-4
SLIDE 4

Hybrid Inclusions

A hybrid inclusion combines a differential inclusion, a difference inclusion, and constraints on motions resulting from the inclusions.

x ∈ C ˙ x ∈ F (x) x ∈ D x+ ∈ G (x) .

Above, ˙ x is velocity, x+ is value after a jump. Single-valued case: x ∈ C ˙ x = f (x) x ∈ D x+ = g (x) . Solutions: parameterized by t and j, with (t, j) evolving in hybrid time domains; satisfy φ(t, j) ∈ C, ˙ φ(t, j) ∈ F(φ(t, j)) when flowing; satisfy φ(t, j) ∈ D, φ(t, j + 1) ∈ G(φ(t, j)) when jumping.

Hybrid Dynamical Systems: Modeling, Stability, and Robustness G., Sanfelice, Teel, Princeton University Press, 2012 Goebel Beyond Zeno through a PAS set

slide-5
SLIDE 5

Pointwise asymptotic stability in a hybrid system — an example

Agents z1, z2, . . . , zI ∈ Rk agree on a target w in the convex hull of zi’s; converge exponentially to w; every T amount of time communicate and agree on a new w. Hybrid inclusion modeling this: state x = (z1, z2, . . . , zI , w, τ); if τ ≥ 0, ˙ zi = w − zi, ˙ w = 0, ˙ τ = −1; if τ = 0, z+

i

= zi, w+ ∈ con{z1, z2, . . . , zI }, τ + = T. Natural to expect convergence of z to and stability of the consensus set {z | z1 = z2 = · · · = zI } In fact, the following set is partially pointwise asymptotically stable: A = {(z, w) | z1 = z2 = · · · = zI = w} × [0, T]

Goebel Beyond Zeno through a PAS set

slide-6
SLIDE 6

Pointwise asymptotic stability in a hybrid system — a twisted example

Two agents z1, z2 ∈ Rk agree on a target w = z1 + z2 2 ; converge to w according to ˙ zi = ci w − zi p |w − zi| , where ci > 0. update w when one agent reduces its distance from w by a factor of 4. Hybrid inclusion with x = (z1, z2, w, τ) ∈ R3k+1 and C = Rk × Rk × Rk × [0, ∞), F(x) = c1 w − z1 p |w − z1| , c2 w − z2 p |w − z2| , 0, −1 ! , D = Rk × Rk × Rk × {0}, G(x) = “ z1, z2, z1+z2

2

, min {t1, t2} ” where ti := √

|a−zi | ci

. Then A = {z | z1 = z2 = w, τ = 0} is pointwise small ordinary time asymptotically stable.

Goebel Beyond Zeno through a PAS set

slide-7
SLIDE 7

(Nominal) well-posedness

Goebel Beyond Zeno through a PAS set

slide-8
SLIDE 8

(Nominal) well-posedness

For a differential equation ˙ x = f (x) or inclusion ˙ x ∈ F(x), if f or F is sufficiently regular, for every bounded sequence of solutions there exists a locally uniformly convergent subsequence (Arzela-Ascoli); the limit of the subsequence is a solution; and if solutions are unique, this reduces to continuous dependence of solutions, over bounded time intervals, on initial conditions. For a hybrid inclusion (C, F, D, G), under Basic Assumptions: C, D closed; F, G closed graph; F(x) nonempty, convex for all x ∈ C; G(x) nonempty for all x ∈ D.

  • ne has that, for every bounded sequence of solutions

there exists a graphically convergent subsequence; the graphical limit of the subsequence is a solution; and more... In short: (C, F, D, G) is well-posed.

Goebel Beyond Zeno through a PAS set

slide-9
SLIDE 9

(Nominal) well-posedness

Consequences of nominal well-posedness include: (a) Solutions, over bounded hybrid time domains, depend on initial conditions in an

  • uter-semicontinuous way and this can be characterized in terms of distances between

graphs of solutions. (b) Solutions, over bounded hybrid time domains, depend on initial conditions continuously when uniqueness of solutions can be ensured. (c) The Krasovskii-LaSalle invariance principle, and other arguments relying on invariance, apply. (d) For a compact asymptotically stable set the basin of attraction is open and from it, the convergence to the set is uniform and it admits a KL bound.

Goebel Beyond Zeno through a PAS set

slide-10
SLIDE 10

(Nominal) well-posedness

Consequences of nominal well-posedness include: (a) Solutions, over bounded hybrid time domains, depend on initial conditions in an

  • uter-semicontinuous way and this can be characterized in terms of distances between

graphs of solutions. (b) Solutions, over bounded hybrid time domains, depend on initial conditions continuously when uniqueness of solutions can be ensured. (c) The Krasovskii-LaSalle invariance principle, and other arguments relying on invariance, apply. (d) For a compact asymptotically stable set the basin of attraction is open and from it, the convergence to the set is uniform and it admits a KL bound. However: Even if solutions have limits, the limits need not depend regularly on initial conditions. Infinite-horizon reachable sets need not depend regularly on initial conditions. Even if solutions are Zeno, the Zeno times need not depend regularly on initial conditions.

Goebel Beyond Zeno through a PAS set

slide-11
SLIDE 11

Pointwise asymptotic stability a.k.a. semistability

Goebel Beyond Zeno through a PAS set

slide-12
SLIDE 12

Pointwise asymptotic stability a.k.a. semistability

Definition

The closed set A is pointwise asymptotically stable (PAS) if every point a ∈ A is Lyapunov stable, that is, for every a ∈ A, ε > 0 there exists δ > 0 such that every solution from a + δB remains in a + ǫB; every solution is convergent and its limit is in A. PAS is AS if A={a}, PAS = ⇒ AS if A compact, PAS ?? AS if A closed PAS is not AS, even if every a ∈ A is an equilibrium. Standard Lyapunov conditions are not sufficient for PAS. Examples: Steepest descent / negative gradient flow: ˙ x ∈ −∂f (x) with f convex, A = arg min f Saddle-point dynamics: ˙ x ∈ −∂xh(x, y), ˙ y ∈ ∂yh(x, y) with h convex-concave, A the set

  • f saddle points

Convex optimization algorithms (proximal-point, and more) with Fejer property: x+ − a ≤ x − a for every a ∈ A = arg min f Numerous consensus algorithms, with A = {x | x1 = x2 = · · · = xn}

Goebel Beyond Zeno through a PAS set

slide-13
SLIDE 13

Pointwise asymptotic stability a.k.a. semistability

Definition

The closed set A is pointwise asymptotically stable (PAS) if every point a ∈ A is Lyapunov stable, that is, for every a ∈ A, ε > 0 there exists δ > 0 such that every solution from a + δB remains in a + ǫB; every solution is convergent and its limit is in A.

Singular perturbation of autonomous linear systems, Campbell and Rose 1979 A continuous algorithm for finding the saddle points of convex-concave functions, Venets 84 Nontangency-based Lyapunov tests ..., Bhat, Bernstein 03 several articles by Haddad et al. 08, 09, 10,. . . Arc-length-based Lyapunov tests ..., Bhat, Bernstein 10 links to consensus: Stability of multiagent systems with time-dependent communication links, Moreau 05 Stability of leaderless discrete-time multi-agent systems, Angeli, Bliman 06 set-valued Lyapunov functions in discrete time Set-valued Lyapunov functions for difference inclusions, G. 2011 Robustness of stability through necessary and sufficient Lyapunov-like conditions ..., G. 2014 Goebel Beyond Zeno through a PAS set

slide-14
SLIDE 14

Strict set-valued Lyapunov function for a closed set A

Definition

A set-valued mapping W : Rn ⇒ Rn is a strict set-valued Lyapunov function if it has right growth and regularity properties and there exist continuous and positive definite with respect to A functions c, d : Rn → R so that for every solution φ : [0, T] → Rn to ˙ x ∈ F(x) such that φ(t) ∈ C for every t ∈ (0, T), W (φ(t)) + Z t c(φ(s)) dsB ⊂ W (φ(0)) ∀t ∈ [0, T]. W (G(x)) + d(x)B ⊂ W (x) ∀x ∈ D. Compare to V (G(x)) + d(x) ≤ V (x)

Goebel Beyond Zeno through a PAS set

slide-15
SLIDE 15

Strict set-valued Lyapunov function for a closed set A

Definition

A set-valued mapping W : Rn ⇒ Rn is a strict set-valued Lyapunov function if it has right growth and regularity properties and there exist continuous and positive definite with respect to A functions c, d : Rn → R so that for every solution φ : [0, T] → Rn to ˙ x ∈ F(x) such that φ(t) ∈ C for every t ∈ (0, T), W (φ(t)) + Z t c(φ(s)) dsB ⊂ W (φ(0)) ∀t ∈ [0, T]. W (G(x)) + d(x)B ⊂ W (x) ∀x ∈ D. Compare to V (G(x)) + d(x) ≤ V (x)

Theorem

If there exists a strict set-valued Lyapunov function then A is PAS. Converse results: exist for discrete time, expected for hybrid.

Goebel Beyond Zeno through a PAS set

slide-16
SLIDE 16

Weak set-valued Lyapunov function for a closed set A

Definition

A set-valued mapping W : Rn ⇒ Rn is a weak set-valued Lyapunov function if it has right growth and regularity properties and for every solution φ : [0, T] → Rn to ˙ x ∈ F(x) such that φ(t) ∈ C for every t ∈ (0, T), W (φ(t)) ⊂ W (φ(0)) ∀t ∈ [0, T]. W (G(x)) ⊂ W (x) ∀x ∈ D.

Goebel Beyond Zeno through a PAS set

slide-17
SLIDE 17

Weak set-valued Lyapunov function for a closed set A

Definition

A set-valued mapping W : Rn ⇒ Rn is a weak set-valued Lyapunov function if it has right growth and regularity properties and for every solution φ : [0, T] → Rn to ˙ x ∈ F(x) such that φ(t) ∈ C for every t ∈ (0, T), W (φ(t)) ⊂ W (φ(0)) ∀t ∈ [0, T]. W (G(x)) ⊂ W (x) ∀x ∈ D.

Theorem

If there exists a continuous weak set-valued Lyapunov function W ; every weakly invariant set on which W is constant is contained in A; and C, F, D, G satisfies the Hybrid Basic Assumptions; then A is PAS. Proof: invariance principle.

Goebel Beyond Zeno through a PAS set

slide-18
SLIDE 18

Consequences of PAS

Theorem

If C, F, D, G satisfies Basic Assumptions and the closed set A ⊂ Rn is PAS, then (a) the set-valued mapping L defined by L(x) = [  lim

t+j→∞ φ(t, j) | φ(0, 0) = x

ff is outer semicontinuous and locally bounded; (b) the set-valued mapping R∞ defined by R∞(x) = R∞(x) is outer semicontinuous and locally bounded and R∞(x) = R∞(x) ∪ L(x) for every x, where the set-valued mapping R∞ is defined by R∞(x) = [ {φ(t, j) | φ(0, 0) = x, (t, j) ∈ domφ} ; In single-valued case, outer semicontinuity and local boundedness is continuity.

Goebel Beyond Zeno through a PAS set

slide-19
SLIDE 19

Small ordinary time property

Definition

A set A ⊂ Rn is pointwise small ordinary time asymptotically stable (PSOTAS) if it is pointwise asymptotically stable and every a ∈ A is SOT stable: for every ε > 0 there exists δ > 0 such that lengtht dom φ < ε if φ(0, 0) ∈ a + δB.

Theorem

Suppose that a closed set A ⊂ Rn is PAS and there exists a continuously differentiable V : Rn → R such that (a) V is positive definite with respect to A; (b) there exists c > 0 and ρ ∈ [0, 1) such that ∇V (x) · f ≤ −c (V (x))ρ ∀x ∈ C, f ∈ F(x); (c) V (g) ≤ V (x) ∀x ∈ D, g ∈ G(x); and there exist no nontrivial flowing solutions φ satisfying φ(t, j) ⊂ A for all (t, j) ∈ dom φ. Then A is PSOTAS.

Goebel Beyond Zeno through a PAS set

slide-20
SLIDE 20

The twisted example, revisited

Two agents z1, z2 ∈ Rk agree on a target w = z1 + z2 2 ; converge to w according to ˙ zi = ci w − zi p |w − zi| , where ci > 0. update w when one agent reduces its distance from w by a factor of 4. Consider the set A = {(z1, z2, w) | z1 = z2 = w} × {0}. Then the set-valued mapping W (η) = co{z1, z2, w} × [0, max{τ, min {t1, t2}}] is a weak set-valued Lyapunov function; the functon V (x) = 1

2

` z1 − w2 + z2 − w2´ satisfies ˙ V (x(t)) ≤ −23/4 min{c1, c2} (V (x(t)))3/4 . PSOTAS of A follows!

Goebel Beyond Zeno through a PAS set

slide-21
SLIDE 21

Consequences of PSOTAS

Theorem

If C, F, D, G satisfies Hybrid Basic Assumptions and the closed set A ⊂ Rn is PSOTAS, then (a) every complete solution φ is Zeno: its Zeno time tφ is finite tφ := sup{t | ∃j (t, j) ∈ dom φ} < ∞; (b) for every graphically convergent φi to φ, lim

i→∞ tφi = tφ;

(c) the function T(x) = sup{tφ | φ(0, 0) = x} is locally bounded, upper semicontinuous, and the supremum defining it is attained. If solutions are unique, T is continuous.

Goebel Beyond Zeno through a PAS set

slide-22
SLIDE 22

Summary so far

Suppose that: C, F, D, G satisfies Hybrid Basic Assumptions; the closed set A is PSOTAS. Then: limits of complete solutions depend reasonably on initial conditions; complete solutions are Zeno and their Zeno times depend reasonably on initial conditions. Idea: solutions can be extended past their Zeno times, from their Zeno limits, via another hybrid system (not a new idea) so that their extensions depend reasonably on the pre-Zeno initial conditions!

Goebel Beyond Zeno through a PAS set

slide-23
SLIDE 23

Going past Zeno

Hybrid system 1: C1, F1, D1, G1 satisfies Basic Assumptions; the closed set A1 is PSOTAS. Re-initialization map: Ψ is locally bounded and has closed graph. Hybrid system 2: C2, F2, D2, G2 satisfies Basic Assumptions; Solution (φ, ψ), where: φ solves system 1; ψ solves system 2; ψ(tφ, 0) ∈ Ψ lim

t→tφ,j→∞ φ(t, j)

! , where tφ is the Zeno time of φ.

Goebel Beyond Zeno through a PAS set

slide-24
SLIDE 24

Going past Zeno

Hybrid system 1: C1, F1, D1, G1 satisfies Basic Assumptions; the closed set A1 is PSOTAS. Re-initialization map: Ψ is locally bounded and has closed graph. Hybrid system 2: C2, F2, D2, G2 satisfies Basic Assumptions; Solution (φ, ψ), where: φ solves system 1; ψ solves system 2; ψ(tφ, 0) ∈ Ψ lim

t→tφ,j→∞ φ(t, j)

! , where tφ is the Zeno time of φ. ψ over bounded hybrid time domains depends outer-semicontinuously on φ(0, 0). Consequence: if system 2 has a compact GAS set A2, then convergence to A2 is uniform from compact sets of φ(0, 0), etc.

Goebel Beyond Zeno through a PAS set

slide-25
SLIDE 25

The twisted example, revisited

Hybrid system 1: two agents z1, z2 ∈ Rk agree on a target w = (z1 + z2)/2; converge to w according to ˙ zi = ci(w − zi)/ p |w − zi|; update w when one agent reduces its distance from w by a factor of 4. Re-initialization map: Ψ is a continuous function. Hybrid system 2: ˙ x = f2(x), where f2 is a Lipschitz continuous function. Solution (φ, ψ), where: φ solves system 1; ψ solves system 2; ψ(tφ, 0) = Ψ lim

t→tφ,j→∞ φ(t, j)

! , where tφ is the Zeno time of φ. ψ(t) depends continuously on φ(0, 0), for t > tφ.

Goebel Beyond Zeno through a PAS set

slide-26
SLIDE 26

PAS from optimal control

Goebel Beyond Zeno through a PAS set

slide-27
SLIDE 27

PAS from optimal control — the big picture

If A is pointwise asymptotically controllable with locally exponential convergence rate for the hybrid inclusion with input (x, u) ∈ C ˙ x ∈ F (x, u) (x, u) ∈ D x+ ∈ G (x, u) , then minimization of cost like

J

X

j=0

Z tj+1

tj

dA (φ(t, j)) + u(t, j) dt +

J−1

X

j=0

dA ` φ(tj+1, j) ´ + u(tj+1, j)

  • ver infinite horizon yields optimal solutions that result in PAS.

Goebel Beyond Zeno through a PAS set

slide-28
SLIDE 28

Length-based sufficient condition for PAS in discrete time

Motivation:

Arc-length-based Lyapunov tests ..., Bhat, Bernstein 10

For ˙ x = f (x), inequality ˙ V ≤ −f implies Z ∞ ˙ x(t) dt < ∞... finite length!

Goebel Beyond Zeno through a PAS set

slide-29
SLIDE 29

Length-based sufficient condition for PAS in discrete time

Motivation:

Arc-length-based Lyapunov tests ..., Bhat, Bernstein 10

For ˙ x = f (x), inequality ˙ V ≤ −f implies Z ∞ ˙ x(t) dt < ∞... finite length!

Theorem

Suppose that A ⊂ Rn is a closed set, V : Rn → [0, ∞) is positive definite with respect to A and continuous at every a ∈ A, α : Rn → [0, ∞) is continuous and positive definite with respect to A. If V (g(x)) + α(x) + g(x) − x ≤ V (x) ∀x ∈ Rn, then A is pointwise asymptotically stable for x+ = g(x).

Proof idea:

  • V (g(x)) + α(x) ≤ V (x) ensures asymptotic stability of A (not pointwise!)
  • V (g(x)) + g(x) − x ≤ V (x) ensures finite length, so convergence, of each solution
  • V (a) = 0 at a ∈ A and continuity implies small length of solutions from near a,

and so Lyapunov stability of a Goebel Beyond Zeno through a PAS set

slide-30
SLIDE 30

Pointwise asymptotic controllability in discrete time

Let G : Rn × U → Rn be a function, U ⊂ Rk be a set. Consider x+ = G(x, u), u ∈ U. The control system is pointwise asymptotically controllable to a set A ⊂ Rn with locally exponential convergence rate: (a) for every ξ ∈ Rn, there exists an open-loop control uξ : {0, 1, 2, . . . } → U such that the resulting solution φξ from ξ converges, and limj→∞ φξ(j) ∈ A; (b) for every a ∈ A, for every ε > 0 there exists δ > 0 such that, for every ξ with ξ − a < δ, the solution φξ from (a) is such that φξ(j) − a < ε for every j; (c) there exists an open set O containing A and constants M, γ > 0 such that, for every ξ ∈ O, the solution φξ from (a) satisfies φξ(j) − aξ ≤ Me−γjξ − aξ ∀j, where aξ = limj→∞ φξ(j).

Goebel Beyond Zeno through a PAS set

slide-31
SLIDE 31

Optimal feedback stabilization in discrete time

Theorem

If G is continuous, U compact, A closed and PAC Assumption holds for x+ = G(x, u), u ∈ U, then there exists a feedback u : Rn → U such that A is robustly PAS for x+ = G(x, u(x)).

Goebel Beyond Zeno through a PAS set

slide-32
SLIDE 32

Optimal feedback stabilization in discrete time

Theorem

If G is continuous, U compact, A closed and PAC Assumption holds for x+ = G(x, u), u ∈ U, then there exists a feedback u : Rn → U such that A is robustly PAS for x+ = G(x, u(x)). Proof idea: let dA(x) be the distance from A: dA(x) = mina∈A x − a, let V (ξ) = inf

u:{0,1,2,... }→U ∞

X

j=0

dA(φ(j)) + φ(j + 1) − φ(j) and consider optimal (or suboptimal) feedback.

Goebel Beyond Zeno through a PAS set

slide-33
SLIDE 33

Optimal feedback stabilization in discrete time

Theorem

If G is continuous, U compact, A closed and PAC Assumption holds for x+ = G(x, u), u ∈ U, then there exists a feedback u : Rn → U such that A is robustly PAS for x+ = G(x, u(x)). Proof idea: let dA(x) be the distance from A: dA(x) = mina∈A x − a, let V (ξ) = inf

u:{0,1,2,... }→U ∞

X

j=0

dA(φ(j)) + φ(j + 1) − φ(j) and consider optimal (or suboptimal) feedback.

Under further assumptions on g, for example G(x, u) − x ≤ ν(dA(x) + u), can consider V (ξ) = inf

u:{0,1,2,... }→U ∞

X

j=0

dA(φ(j)) + u(j) Goebel Beyond Zeno through a PAS set

slide-34
SLIDE 34

Robustness of optimal feedback in discrete time

Definition

A is robustly PAS for x+ = G(x, u(x)) =: g(x) if there exists ρ : Rn → [0, ∞), continuous and positive definite with respect to A and such that A is PAS for x+ ∈ gρ(x), where gρ : Rn ⇒ Rn is a set-valued mapping defined by gρ(x) = [

y∈g(x+ρ(x)B)

y + ρ(y)B.

This covers measurement error, actuator error, and external disturbance.

Given the optimal value function V , define a set-valued mapping W : W (x) = x + V (x)B. This W is a continuous set-valued Lyapunov function, and a result of

Robustness of stability through necessary and sufficient Lyapunov-like conditions ..., G. 2014

implies robustness.

Goebel Beyond Zeno through a PAS set

slide-35
SLIDE 35

The End

Summary: In the right circumstances (PSOTAS), Zeno solutions to hybrid systems can be extended past their Zeno times and well-posedness is preserved. PAS can be achieved via optimal control. Further questions for hybrid systems: Converse set-valued Lyapunov results and relation to robustness of PAS? Infinitesimal characterization of set-valued Lyapunov functions (in continuous and then hybrid time)? Thank you for your attention.

Goebel Beyond Zeno through a PAS set

slide-36
SLIDE 36

Bonus: Finite-length Lyapunov function in hybrid setting

Definition

A continuously differentiable function V : Rn → [0, ∞) is a finite-length Lyapunov function if V is positive definite with respect to A, and there exist continuous c, d : Rn → [0, ∞), positive definite with respect to A, such that the following hold: for every x ∈ C, f ∈ F(x), ∇V (x) · f ≤ −c(x) − f , for every x ∈ D, g ∈ G(x), V (g) − V (x) ≤ −d(x) − g − x.

Inspired by Arc-length-based Lyapunov tests ..., Bhat, Bernstein 10 which used ∇V (x) · f (x) ≤ −f (x) for ˙ x = f (x) Goebel Beyond Zeno through a PAS set

slide-37
SLIDE 37

Bonus: Finite-length Lyapunov function in hybrid setting

Definition

A continuously differentiable function V : Rn → [0, ∞) is a finite-length Lyapunov function if V is positive definite with respect to A, and there exist continuous c, d : Rn → [0, ∞), positive definite with respect to A, such that the following hold: for every x ∈ C, f ∈ F(x), ∇V (x) · f ≤ −c(x) − f , for every x ∈ D, g ∈ G(x), V (g) − V (x) ≤ −d(x) − g − x.

Inspired by Arc-length-based Lyapunov tests ..., Bhat, Bernstein 10 which used ∇V (x) · f (x) ≤ −f (x) for ˙ x = f (x)

Theorem

If there exists a finite-time Lyapunov function then A is PAS. Key to proof / justification of name:

J

X

j=0

Z tj+1

tj

˙ φ(t, j)) ds +

J

X

j=1

φ(tj, j + 1) − φ(tj, j) ≤ V (φ(0, 0)) − V (φ(T, J))

Goebel Beyond Zeno through a PAS set