Converse Barrier Certificates for Finite-time Safety Verification of Continuous-time Perturbed Deterministic Systems (2402.17167v1)
Abstract: In this paper, we investigate the problem of verifying the finite-time safety of continuous-time perturbed deterministic systems represented by ordinary differential equations in the presence of measurable disturbances. Given a finite time horizon, if the system is safe, it, starting from a compact initial set, will remain within an open and bounded safe region throughout the specified time horizon, regardless of the disturbances. The main contribution of this work is to uncover that there exists a time-dependent barrier certificate if and only if the system is safe. This barrier certificate satisfies the following conditions: negativity over the initial set at the initial time instant, non-negativity over the boundary of the safe set, and non-increasing behavior along the system dynamics over the specified finite time horizon. The existence problem is explored using a Hamilton-Jacobi differential equation, which has a unique Lipschitz viscosity solution.
- Control barrier functions: Theory and applications. In 2019 18th European control conference (ECC), pages 3420–3431. IEEE, 2019.
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations, volume 12. Springer, 1997.
- A smooth converse lyapunov theorem for robust stability. SIAM Journal on Control and Optimization, 34(1):124–160, 1996.
- J. Liu. Converse barrier functions via lyapunov functions. IEEE Transactions on Automatic Control, 67(1):497–503, 2021.
- K. Margellos and J. Lygeros. Hamilton–jacobi formulation for reach–avoid differential games. IEEE Transactions on automatic control, 56(8):1849–1861, 2011.
- A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games. IEEE Transactions on automatic control, 50(7):947–957, 2005.
- S. Prajna and A. Jadbabaie. Safety verification of hybrid systems using barrier certificates. In International Workshop on Hybrid Systems: Computation and Control, pages 477–492. Springer, 2004.
- A framework for worst-case and stochastic safety verification using barrier certificates. IEEE Transactions on Automatic Control, 52(8):1415–1428, 2007.
- S. Prajna and A. Rantzer. On the necessity of barrier certificates. IFAC Proceedings Volumes, 38(1):526–531, 2005.
- S. Prajna and A. Rantzer. Convex programs for temporal verification of nonlinear dynamical systems. SIAM Journal on Control and Optimization, 46(3):999–1021, 2007.
- S. Ratschan. Converse theorems for safety and barrier certificates. IEEE Transactions on Automatic Control, 63(8):2628–2632, 2018.
- A barrier function approach to finite-time stochastic system verification and control. Automatica, 125:109439, 2021.
- J. Steinhardt and R. Tedrake. Finite-time regional verification of stochastic non-linear systems. The International Journal of Robotics Research, 31(7):901–923, 2012.
- G. Ting and X. Bican. Barrier certificate generation for safety verification of continuous systems for a bounded time. Journal of Software, 27(3):645–654, 2016.
- Safety-critical control of stochastic systems using stochastic control barrier functions. In 2021 60th IEEE Conference on Decision and Control (CDC), pages 5924–5931. IEEE, 2021.
- R. Wisniewski and C. Sloth. Converse barrier certificate theorems. IEEE Transactions on Automatic Control, 61(5):1356–1361, 2015.
- B. Xue. A new framework for bounding reachability probabilities of continuous-time stochastic systems. arXiv preprint arXiv:2312.15843, 2023.
- Inner-approximating reachable sets for polynomial systems with time-varying uncertainties. IEEE Transactions on Automatic Control, 65(4):1468–1483, 2019.
- Robust invariant sets generation for state-constrained perturbed polynomial systems. In Proceedings of the 22nd ACM international conference on hybrid systems: Computation and control, pages 128–137, 2019.
- Differential games based on invariant sets generation. In 2022 American Control Conference (ACC), pages 1285–1292. IEEE, 2022.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.