Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 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

Converse Barrier Functions via Lyapunov Functions (2007.11086v2)

Published 21 Jul 2020 in math.OC, cs.SY, and eess.SY

Abstract: We prove a robust converse barrier function theorem via the converse Lyapunov theory. While the use of a Lyapunov function as a barrier function is straightforward, the existence of a converse Lyapunov function as a barrier function for a given safety set is not. We establish this link by a robustness argument. We show that the closure of the forward reachable set of a robustly safe set must be robustly asymptotically stable under mild technical assumptions. As a result, all robustly safe dynamical systems must admit a robust barrier function in the form of a Lyapunov function for set stability. We present the results in both continuous-time and discrete-time settings and remark on connections with various barrier function conditions.

Citations (21)

Summary

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