Paper

{
  "raw_xml": "<entry>\n    <id>http://arxiv.org/abs/2603.03082v1</id>\n    <title>Safe and Robust Domains of Attraction for Discrete-Time Systems: A Set-Based Characterization and Certifiable Neural Network Estimation</title>\n    <updated>2026-03-03T15:26:06Z</updated>\n    <link href='https://arxiv.org/abs/2603.03082v1' rel='alternate' type='text/html'/>\n    <link href='https://arxiv.org/pdf/2603.03082v1' rel='related' title='pdf' type='application/pdf'/>\n    <summary>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 $\\ell_p$-stable compact RISs. The notion of uniform $\\ell_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.</summary>\n    <category scheme='http://arxiv.org/schemas/atom' term='eess.SY'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='cs.LG'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='math.DS'/>\n    <category scheme='http://arxiv.org/schemas/atom' term='math.OC'/>\n    <published>2026-03-03T15:26:06Z</published>\n    <arxiv:primary_category term='eess.SY'/>\n    <author>\n      <name>Mohamed Serry</name>\n    </author>\n    <author>\n      <name>Maxwell Fitzsimmons</name>\n    </author>\n    <author>\n      <name>Jun Liu</name>\n    </author>\n  </entry>"
}