用神经网络+验证框架,精准估算受限状态下的非线性系统安全域。
Safe Domains of Attraction for Discrete-Time Nonlinear Systems: Characterization and Verifiable Neural Network Estimation
- 基于新推导的Zubov方程,精确刻画安全吸引域。
- 神经网络逼近解,结合验证工具确保结果可信。
- 适合研究控制安全性和复杂系统稳定性的研究人员。
非线性自治系统的吸引域估计是长期研究热点,但现有方法在高维或带状态约束时仍存在保守或局限性。本文提出一种针对离散时间非线性自治系统在状态约束下的安全吸引域精确估计框架。首先推导出新的Zubov方程,其解即为精确的安全吸引域,且在整个状态空间上唯一且连续。随后提出物理信息神经网络方法近似求解该方程,并设计可利用标准验证工具(如α,β-CROWN和dReal)实现的验证框架,以获得可保证的吸引域估计。通过多个带状态约束的非线性系统数值实验,验证了该方法的有效性。
原文摘要 · Abstract (English)
Analysis of nonlinear autonomous systems typically involves estimating domains of attraction, which have been a topic of extensive research interest for decades. Despite that, accurately estimating domains of attraction for nonlinear systems remains a challenging task, where existing methods are conservative or limited to low-dimensional systems. The estimation becomes even more challenging when accounting for state constraints. In this work, we propose a framework to accurately estimate safe (state-constrained) domains of attraction for discrete-time autonomous nonlinear systems. In establishing this framework, we first derive a new Zubov equation, whose solution corresponds to the exact safe domain of attraction. The solution to the aforementioned Zubov equation is shown to be unique and continuous over the whole state space. We then present a physics-informed approach to approximating the solution of the Zubov equation using neural networks. To obtain certifiable estimates of the domain of attraction from the neural network approximate solutions, we propose a verification framework that can be implemented using standard verification tools (e.g., $α,\!β$-CROWN and dReal). To illustrate its effectiveness, we demonstrate our approach through numerical examples concerning nonlinear systems with state constraints.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。