mlsanityData to 7 Oct 2026

Safe and Robust Domains of Attraction for Discrete-Time Systems: A Set-Based Characterization and Certifiable Neural Network Estimation

arXiv 2603.03082 ↗First posted 3 Mar 2026eess.SY cs.LG cs.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

Analyzing nonlinear systems with attracting robust invariant sets (RISs) requires estimating their domains of attraction (DOAs). Despite extensive research, accurately characterizing DOAs for general nonlinear systems remains challenging due to both theoretical and computational limitations, particularly in the presence of uncertainties and state constraints. In this paper, we propose a novel framework for the accurate estimation of safe (state-constrained) and robust DOAs for discrete-time nonlinear uncertain systems with continuous dynamics, open safe sets, compact disturbance sets, and uniformly locally ℓp-stable compact RISs. The notion of uniform ℓp stability is quite general and encompasses, as special cases, uniform exponential and polynomial stability. The DOAs are characterized via newly introduced value functions defined on metric spaces of compact sets. We establish their fundamental mathematical properties and derive the associated Bellman-type (Zubov-type) functional equations. Building on this characterization, we develop a physics-informed neural network (NN) framework to learn the corresponding value functions by embedding the derived Bellman-type equations directly into the training process. To obtain certifiable estimates of the safe robust DOAs from the learned neural approximations, we further introduce a verification procedure that leverages existing formal verification tools. The effectiveness and applicability of the proposed methodology are demonstrated through four numerical examples involving nonlinear uncertain systems subject to state constraints, and its performance is compared with existing methods from the literature.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 44 references that are in the map. First posted on arXiv 3 Mar 2026.

Builds on

11 of 44 references.

References · 11

  1. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  2. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
  3. 2019Branch and Bound for Piecewise Linear Neural Network Verificationcited by 138
  4. 2022Complete Verification via Multi-Neuron Relaxation Guided Branch-and-Boundcited by 92
  5. 2024Neural Network Verification with Branch-and-Bound for General Nonlinearitiescited by 47
  6. 2024Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planescited by 33
  7. 2023Neural Lyapunov Control for Discrete-Time Systemscited by 21
  8. 2023Physics-Informed Neural Network Lyapunov Functions: PDE Characterization, Learning, and Verificationcited by 20
  9. 2021Learning Region of Attraction for Nonlinear Systemscited by 16
  10. 2025Safe Domains of Attraction for Discrete-Time Nonlinear Systems: Characterization and Verifiable Neural Network Estimationcited by 3
  11. 2024Underapproximating Safe Domains of Attraction for Discrete-Time Systems Using Implicit Representations of Backward Reachable Setscited by 2

Built on by

Not cited yet.