arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2208.10752math.OCcs.SYeess.SY
收藏

多项式随机微分方程的到达-避免分析

Reach-Avoid Analysis for Polynomial Stochastic Differential Equations

Bai Xue, Naijun Zhan, Martin Fränzle

AI总结:

本文提出一种基于半定规划和平方和分解的方法,求解多项式随机微分方程系统的到达-避免问题,将非凸问题转化为凸优化,并提供概率保证与实例验证。

摘要:

本文提出了一种新颖的半定规划方法,用于解决由多项式随机微分方程建模的动态系统在开放(即非先验有界)时间范围内的到达-避免问题。本文中的到达-避免问题是一种概率保证:我们从内部逼近一个$p$-到达-避免集合,即初始状态的集合,保证系统以大于$p$的概率最终进入给定目标集,同时在到达目标之前保持在指定安全集内。我们的方法首先构造一个有界值函数,其严格$p$超水平集等于$p$-到达-避免集合。然后,该值函数被简化为一个方程组的二次连续可微解。该方程组利用多元多项式的平方和分解促进了半定规划的构造,从而将非凸的到达-避免问题转化为凸优化问题。该半定规划可以在多项式时间内高效求解,借助许多现有的强大算法,如内点法和现成的软件包。我们想指出,我们的方法可以直接特化以解决经典的安全性验证,例如通过随机屏障证书方法和常微分方程的到达-避免分析。此外,提供了几个示例来展示所提出方法的理论和算法发展。

英文摘要:

In this paper we propose a novel semi-definite programming approach that solves reach-avoid problems over open (i.e., not bounded a priori) time horizons for dynamical systems modeled by polynomial stochastic differential equations. The reach-avoid problem in this paper is a probabilistic guarantee: we approximate from the inner a $p$-reach-avoid set, i.e., the set of initial states guaranteeing with probability larger than $p$ that the system eventually enters a given target set while remaining inside a specified safe set till the target hit. Our approach begins with the construction of a bounded value function, whose strict $p$ super-level set is equal to the $p$-reach-avoid set. This value function is then reduced to a twice continuously differentiable solution to a system of equations. The system of equations facilitates the construction of a semi-definite program using sum-of-squares decomposition for multivariate polynomials and thus the transformation of nonconvex reach-avoid problems into a convex optimization problem. The semi-definite program can be solved efficiently in polynomial time with many existing powerful algorithms such as interior point methods and off-the-shelf software packages. We would like to point out that our approach can straightforwardly be specialized to address classical safety verification by, a.o., stochastic barrier certificate methods and reach-avoid analysis for ordinary differential equations. In addition, several examples are provided to demonstrate theoretical and algorithmic developments of the proposed method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑