Safe and Robust Domains of Attraction for Discrete-Time Systems: A Set-Based Characterization and Certifiable Neural Network Estimation
Authors: Mohamed Serry, Maxwell Fitzsimmons, Jun Liu
Organizations: department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada · Department of Mechanical and Mechatronics Engineering at the University of Waterloo
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.
Figures & tables
Parameters/Variables
Xl/Xv
Ns
Nd / Npi
Ntraj
Loss(θ)
tcpu,ev
tt
te
tv,gpu
Ex. VII-B
NNnom
0.7 [[−12,12]]
500
5000
1
9e-6
1.9
227.0
0.6/6.2
16.0/NA
NNprop
1000
4.0e-6
278.0
218.7
0.6/6.1
17.2/19.5
Ex. VII-C
NNnom
[[−12,12]]
500
5000
1
4.3e-5
0.5
215.0
0.6/6.5
22.9/22.9
NNprop
1000
7.8e-5
245.4
211.0
0.6/7.8
15.7/38.6
Ex. VII-D
NNnom
[−4π,4π]×[[−12,12]]
500
7000
1
1.4e-4
0.9
656.8
66.5/399.0
26.3/NA
NNprop
3000
1.0e-4
683.7
622.2
65.5/385.5
23.4/43.0
TABLE I: Neural network architectures/parameters and corresponding CPU times for the four numerical examples. Here, NNnom denotes the neural networks trained using the nominal dynamics (i.e., the framework in [ 3 ] ), whereas NNprop denotes those trained using the proposed framework. The quantity tev represents the CPU time required to evaluate ⋃i=1Nd{W~Ns({zd(i)})} , tt is the CPU time required for neural network training, te is the CPU time required to estimate the parameters c2 , ω1 , and ω2 (for both unperturbed and perturbed scenarios), and tv,gpu is the CPU time required to verify these parameters (for both unperturbed and perturbed scenarios) using a GPU. “NA” indicates verification failure. All reported CPU times are given in seconds.
Fig. 1: Certified ROAs for Example VII-B under Scenario 1 (uncertainty neglected, top) and Scenario 2 (full disturbance considered, bottom). Red circles indicate the state constraints. The nominally trained neural network fails to yield a certifiable ROA under Scenario 2.
Fig. 2: Certified ROAs for Example VII-C under Scenario 1 (uncertainty neglected, top) and Scenario 2 (full disturbance considered, bottom). Red lines indicate the state constraints.
Fig. 3: Certified ROAs for Example VII-D under Scenario 1 (uncertainty neglected, top) and Scenario 2 (full disturbance considered, bottom). The nominally trained neural network fails to yield a certifiable ROA under Scenario 2.
Fig. 4: Certified ROAs for Example VII-E . The ROA based on parameter-dependent Lyapunov functions is digitized from [ 8 ] .
Robust control designs feedback that maintains stability, safety, and performance despite disturbances, uncertainty, model errors, and changing conditions.
Analyzing nonlinear systems with stabilizable controlled invariant sets (CISs) requires accurate estimation of their domains of stabilization (DOS) together with associated stabilizing controllers. Despite extensive research, estimating DOSs for general nonlinear systems remains challenging due to fundamental theoretical and computational limitations. In this paper, we propose a novel framework for estimating DOSs for controlled input-constrained discrete-time systems. The DOS is characterized via newly introduced value functions defined on metric spaces of compact sets. We establish the fundamental properties of these value functions and derive the associated Bellman-type (Zubov-type) functional equations. Building on this characterization, we develop a physics-informed neural network (NN) framework that learns the value functions by embedding the derived functional equations directly into the training process. The proposed methodology is demonstrated through two numerical examples, illustrating its ability to accurately estimate DOSs and synthesize stabilizing controllers from the learned value functions.
Mohamed Serry, S. Sivaranjani, Jun Liu
Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada. · Department of Mechanical and Mechatronics Engineering at the University of Waterloo. · School of Industrial Engineering, Purdue University, 15 N Grant Street, West Lafayette, 47907, Indiana.
In many safety-critical applications, control of uncertain dynamical systems relies on observers that estimate states and external disturbances. Neural network observers can improve estimation accuracy, but certifying their Lyapunov stability via Linear Matrix Inequality (LMI) constraints leads to large-scale semidefinite programs (SDPs) that are difficult to solve for large networks. To overcome this scalability bottleneck, we propose a novel two-stage training framework for provably stable neural network observers. Our approach decouples the optimization into a point-guided Lyapunov pre-training phase, which rapidly achieves high estimation accuracy and local stability over sampled states, followed by an LMI fine-tuning phase that efficiently satisfies a strict global Lyapunov stability certificate. We provide formal theoretical guarantees for local stability radii and probabilistic coverage over a prescribed compact error-state domain under specified regularity and sampling assumptions. Experiments on nonlinear control benchmarks and X-29 aircraft ablations show that our LMI-certified neural network observers train significantly faster than direct LMI-based methods and generalize robustly across diverse systems, achieving improved tracking accuracy over a range of observer baselines. The code is available at https://github.com/Berry-Myon/LearningNeuralNetworkObserver.
Zhangyi Wang, Jiaxu Liu, Song Chen +2
College of Control Science and Engineering, Zhejiang University, China · School of Science, Huzhou Normal University, China · Department of Mathematics, National University of Singapore, Singapore
We propose a framework for training neural network controllers with certified robust forward invariant polytopes. First, we parameterize a family of lifted control systems in a higher dimensional space, where the original neural controlled system evolves on an invariant subspace of each lifted system. We use interval analysis and neural network verifiers to further construct a family of lifted embedding systems, carefully capturing the knowledge of this invariant subspace. If the vector field of any lifted embedding system satisfies a sign constraint at a single point, then a certain convex polytope of the original system is robustly forward invariant. Treating the neural network controller and the lifted system parameters as variables, we propose an algorithm to train controllers with certified forward invariant polytopes in the closed-loop control system. Through two examples, we demonstrate how the simplicity of the sign constraint allows our approach to scale with system dimension to over 50 states, and outperform state-of-the-art Lyapunov-based sampling approaches in runtime.
Akash Harapanahalli, Samuel Coogan
School of Electrical and Computer Engineering, Georgia Institute of Technology