Search arXivSearch

arXiv · 2609.12990

Safe Stabilising Full-Order Affine Control Barrier Functions for Linear Systems (Extended)

Abstract

Control barrier function safety filters enforce constraints by modifying a nominal input, but the resulting switching can destabilise the closed loop even when the nominal and filtered modes are individually stable. This paper presents a design framework for safe and globally exponentially stabilising controllers for linear systems with a single full-relative-degree affine constraint. We show that the filtered-mode spectrum is fixed by the barrier tuning and is independent of the plant, nominal controller, and quadratic-program weighting. This structure yields an explicit nominal controller for which the safety filter remains inactive everywhere. For a prescribed nominal controller, we prove that the nominal and filtered modes admit a strong common quadratic Lyapunov function if and only if the ratio of the nominal characteristic polynomial to the barrier polynomial is strongly strictly positive real. This equivalence characterises the existence of a common quadratic Lyapunov and provides a scalar frequency-domain test, along with an explicit interval of admissible gains. Building on these results, the extended analysis derives an explicit common storage function and reduces an existing LMI synthesis condition to a feasibility test in a single matrix variable. A flexible two-mass example explains a known instability mechanism and demonstrates how the proposed design restores safety and global exponential stability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Faisal Lawan, Joaquin Carrasco, Lanlan Su. 2026-09-11. Safe Stabilising Full-Order Affine Control Barrier Functions for Linear Systems (Extended). https://arxiv.org/abs/2609.12990

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY