Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3AJ7EAUErecord.jsonopen to challenge →
read the original abstract
Learning-based control has recently shown great efficacy in performing complex tasks for various applications. However, to deploy it in real systems, it is of vital importance to guarantee the system will stay safe. Control Barrier Functions (CBFs) offer mathematical tools for designing safety-preserving controllers for systems with known dynamics. In this article, we first introduce a model-uncertainty-aware reformulation of CBF-based safety-critical controllers using Gaussian Process (GP) regression to close the gap between an approximate mathematical model and the real system, which results in a second-order cone program (SOCP)-based control design. We then present the pointwise feasibility conditions of the resulting safety controller, highlighting the level of richness that the available system information must meet to ensure safety. We use these conditions to devise an event-triggered online data collection strategy that ensures the recursive feasibility of the learned safety controller. Our method works by constantly reasoning about whether the current information is sufficient to ensure safety or if new measurements under active safe exploration are required to reduce the uncertainty. As a result, our proposed framework can guarantee the forward invariance of the safe set defined by the CBF with high probability, even if it contains a priori unexplored regions. We validate the proposed framework in two numerical simulation experiments.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Equalized Coverage in Motion Control Performance Prediction for Self-Adaptive Road Vehicles
Applies conformalized quantile regression with equalized coverage to predict motion control performance in automated vehicles under nominal, degraded, and failed actuator conditions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.