AI & ML
Safety-Critical Control via Recurrent Tracking Functions
arXiv eess.SY0 views
arXiv:2510.01147v3 Announce Type: replace Abstract: This paper addresses the challenge of synthesizing safety-critical controllers for high-order nonlinear systems, where constructing valid Control Barrier Functions (CBFs) remains computationally intractable. Leveraging layered control, we design CBFs in reduced-order models (RoMs) while regulating full-order models' (FoMs) dynamics at the same time. Traditional Lyapunov tracking functions are required to decrease monotonically, and systematic synthesis methods for such functions exist only for fully-actuated systems. To overcome this limitation, we introduce Recurrent Tracking Functions (RTFs), which replace the monotonic decay requirement with a weaker finite-time recurrence condition. This relaxation permits transient deviations of tracking errors while ensuring safety. By integrating CBFs for RoMs with RTFs, we construct recurrent CBFs (RCBFs) whose zero-superlevel set is control $\tau$-recurrent, and guarantee safety for all initial states in such a set when RTFs are satisfied. We establish theoretical safety guarantees and validate the approach through a proof-of-concept numerical experiment, demonstrating RTFs' effectiveness and the safety of FoMs.
Source:https://arxiv.org/abs/2510.01147PreviousRisk-Sensitive Stochastic Optimal Control on Positive ConesNextGame-theoretic Regulated Decentralized Coordination for Airspace Sector Overload Mitigation
Related posts
When Is Complex Chunking Worth It? A Multi-Objective Evaluation of Chunking Methods at Scale
0arXiv cs.IR
IMFuse: Instance-Aware Multi-Layer Fusion for LLM-Enhanced Sequential Recommendation
0arXiv cs.IR
When Reviews Are Scarce: Structure-Aware Review Imputation for Recommendation in Realistic Sparse Review Settings
0arXiv cs.IR
Balancing hierarchical representation and quantization: A performance trade-off in text embeddings
0arXiv cs.IR
Alternatives to Shallow Autoencoders for Collaborative Filtering
0arXiv cs.IR
Data-Efficient Scaling-Law Discovery for Recommendation Systems via Coupled Hyperparameter Scaling
0arXiv cs.IR