Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sampling-based verification of Lyapunov's inequality for piecewise continuous nonlinear systems (1609.00302v1)

Published 1 Sep 2016 in cs.SY

Abstract: 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.

Citations (8)

Summary

We haven't generated a summary for this paper yet.