TY - GEN
T1 - Generalized Barrier Functions
T2 - 60th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2024
AU - Shen, Yue
AU - Sibai, Hussein
AU - Mallada, Enrique
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Barrier functions constitute an effective tool for assessing and enforcing safety-critical constraints on dynamical systems. To this end, one is required to find a function h that satisfies a Lyapunov-like differential condition, thereby ensuring the invariance of its zero super-level set h≥ 0, This methodology, however, does not prescribe a general method for finding the function h that satisfies such differential conditions, which, in general, can be a daunting task. In this paper, we seek to overcome this limitation by developing a generalized barrier condition that makes the search for h easier. We do this in two steps. First, we develop integral barrier conditions that reveal equivalent asymptotic behavior to the differential ones, but without requiring differentiability of h. Subsequently, we further replace the stringent invariance requirement on h ≥ 0 with a more flexible concept known as recurrence. A set is (τ-)recurrent if every trajectory that starts in the set returns to it (within τ seconds) infinitely often. We show that, under mild conditions, a simple sign distance function can satisfy our relaxed condition and that the (τ-)recurrence of the super-level set h≥ 0 is sufficient to guarantee the system's safety.
AB - Barrier functions constitute an effective tool for assessing and enforcing safety-critical constraints on dynamical systems. To this end, one is required to find a function h that satisfies a Lyapunov-like differential condition, thereby ensuring the invariance of its zero super-level set h≥ 0, This methodology, however, does not prescribe a general method for finding the function h that satisfies such differential conditions, which, in general, can be a daunting task. In this paper, we seek to overcome this limitation by developing a generalized barrier condition that makes the search for h easier. We do this in two steps. First, we develop integral barrier conditions that reveal equivalent asymptotic behavior to the differential ones, but without requiring differentiability of h. Subsequently, we further replace the stringent invariance requirement on h ≥ 0 with a more flexible concept known as recurrence. A set is (τ-)recurrent if every trajectory that starts in the set returns to it (within τ seconds) infinitely often. We show that, under mild conditions, a simple sign distance function can satisfy our relaxed condition and that the (τ-)recurrence of the super-level set h≥ 0 is sufficient to guarantee the system's safety.
UR - http://www.scopus.com/inward/record.url?scp=85211098413&partnerID=8YFLogxK
U2 - 10.1109/Allerton63246.2024.10735269
DO - 10.1109/Allerton63246.2024.10735269
M3 - Conference contribution
AN - SCOPUS:85211098413
T3 - 2024 60th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2024
BT - 2024 60th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2024
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 24 September 2024 through 27 September 2024
ER -