Search arXivSearch

arXiv · 2608.20467

Learning-Based Measurement-Robust Control Barrier Functions for Obstacle Avoidance under State Estimation Error

Abstract

Safety filters are an effective tool for enforcing constraints in safety-critical systems, but most existing methods assume perfect state information, which is rarely available in practice. Recent work has begun to close this gap by developing filtering mechanisms that are robust to state estimation error, but these methods can still exhibit safety violations or overly conservative behavior as estimation error grows. Focusing on obstacle avoidance, we develop two new control barrier function (CBF) formulations: drift-measurement-robust (DMR)-CBFs and neural measurement-robust (NMR)-CBFs. The DMR-CBF augments the standard CBF condition with an inner optimization over the worst-case uncertainty in the drift dynamics, improving robustness to estimation error. This DMR-CBF then supervises a pretraining phase for the NMR-CBF, which replaces the inner optimization with a learned term. The NMR-CBF is subsequently finetuned through differentiable trajectory rollouts, yielding a filter that achieves empirical safety comparable to the DMR-CBF while reducing both conservativeness and computational cost. We provide theoretical analysis of the DMR-CBF along with numerical results on a planar double integrator and a 12D quadrotor, where both proposed approaches prevent collisions while other robust methods either fail or are overly conservative. Finally, we deployed the NMR-CBF on a Unitree Go2, enabling successful navigation of an obstacle field under odometry errors that caused a standard CBF to collide.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicholas Rober, Yixuan Jia, Jonathan P. How. 2026-08-20. Learning-Based Measurement-Robust Control Barrier Functions for Obstacle Avoidance under State Estimation Error. https://arxiv.org/abs/2608.20467

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