Singular Perturbations for Control Systems Safety
math.OC, cs.SY, eess.SY
Submitted: 2026-10-31
Updated: 2026-10-31
License: http://creativecommons.org/licenses/by/4.0/
The gist: Control Barrier Functions (CBFs) offer a powerful theory for enforcing safety in dynamical systems.
Terminology
Abstract
Control Barrier Functions (CBFs) offer a powerful theory for enforcing safety in dynamical systems. Yet, applying this framework to complex systems is challenging when subsystems are feedback-interconnected and operate at different timescales. Such structures arise naturally in multiphysics systems and in control architectures where physical plants interact with optimization, estimation, and control algorithms. In many of these settings, safety involves only part of the system, motivating the design of reduced-order certificates. Inspired by singular perturbation theory, we establish sufficient conditions, involving separation between slow and fast dynamics, under which a reduced-order safety certificate can be lifted to the full interconnected system. Specifically, we construct a composite CBF ensuring forward invariance of a lifted subset of the original safe set. We also show that the certified safe set expands monotonically as the tuning parameter accelerating the fast dynamics is reduced. Numerical results validate the approach on two robotic systems: a planar 2-DoF manipulator with motor dynamics and a 6-DoF UR10e manipulator controlled by a suboptimal optimization algorithm.
Sources
- Hybrid Lyapunov and Barrier Function-Based Control with Stabilization Guarantees
- Composite Adaptive Control Barrier Functions for Safety-Critical Systems with Parametric Uncertainty
- Lifting Safety Through Reduced-Order Model Architectures: An Invariant Manifold Approach
- Logarithmic Barrier Functions for Practically Safe Extremum Seeking Control
- Safe Feedback Optimization through Control Barrier Functions
- Safe Control of Feedback-Interconnected Systems via Singular Perturbations
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise