### Abstract

Language | English |
---|---|

Pages | 1-14 |

Number of pages | 14 |

Journal | arXiv |

Issue number | 1609.00302 |

State | Published - 2016 |

### Fingerprint

### Cite this

*arXiv*, (1609.00302), 1-14.

}

*arXiv*, no. 1609.00302, pp. 1-14.

**Sampling–based verification of Lyapunov’s inequality for piecewise continuous nonlinear systems.** / Bobiti, R.V.; Lazar, M.

Research output: Contribution to journal › Article › Academic

TY - JOUR

T1 - Sampling–based verification of Lyapunov’s inequality for piecewise continuous nonlinear systems

AU - Bobiti,R.V.

AU - Lazar,M.

PY - 2016

Y1 - 2016

N2 - This paper considers a sampling-based approach to stability verification for piecewise continuous nonlinear systems via Lyapunov functions. Depending on the system dynamics, the candidate Lyapunov function and the set of initial states of interest, one generally needs to handle large, possibly non-convex or non-feasible optimization problems. To avoid such problems, we propose a constructive and systematically applicable sampling-based method to Lyapunov's inequality verification. This approach proposes verification of the decrease condition for a candidate Lyapunov function on a finite sampling of a bounded set of initial conditions and then it extends the validity of the Lyapunov function to an infinite set of initial conditions by automatically exploiting continuity properties. This result is based on multi-resolution sampling, to perform efficient state- space exploration. Using hyper-rectangles as basic sampling blocks, to account for different constraint scales on different states, further reduces the amount of samples to be verified. Moreover, the verification is decentralized in the sampling points, which makes the method scalable. The proposed methodology is illustrated through examples.

AB - This paper considers a sampling-based approach to stability verification for piecewise continuous nonlinear systems via Lyapunov functions. Depending on the system dynamics, the candidate Lyapunov function and the set of initial states of interest, one generally needs to handle large, possibly non-convex or non-feasible optimization problems. To avoid such problems, we propose a constructive and systematically applicable sampling-based method to Lyapunov's inequality verification. This approach proposes verification of the decrease condition for a candidate Lyapunov function on a finite sampling of a bounded set of initial conditions and then it extends the validity of the Lyapunov function to an infinite set of initial conditions by automatically exploiting continuity properties. This result is based on multi-resolution sampling, to perform efficient state- space exploration. Using hyper-rectangles as basic sampling blocks, to account for different constraint scales on different states, further reduces the amount of samples to be verified. Moreover, the verification is decentralized in the sampling points, which makes the method scalable. The proposed methodology is illustrated through examples.

M3 - Article

SP - 1

EP - 14

JO - arXiv

T2 - arXiv

JF - arXiv

IS - 1609.00302

ER -