Symplectic inductive bias combined with chain policies yields sufficient conditions for target reachability in Hamiltonian systems whose sample complexity depends on recurrence and geometry rather than ambient dimension.
Safety-Critical Control via Recurrent Tracking Functions
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Symplectic Inductive Bias for Data-Driven Target Reachability in Hamiltonian Systems
Symplectic inductive bias combined with chain policies yields sufficient conditions for target reachability in Hamiltonian systems whose sample complexity depends on recurrence and geometry rather than ambient dimension.