随机系统安全性的统一视角:从障碍函数到有限抽象
A Unifying Perspective for Safety of Stochastic Systems: From Barrier Functions to Finite Abstractions
AI总结:
本文提出统一视角,将随机障碍函数与有限抽象方法视为随机动态规划近似,证明其正确性并揭示抽象方法可提供渐近最优安全证书但计算成本更高。
摘要:
为随机动态系统提供安全保证是控制理论、机器学习和机器人学等多个领域的核心问题。现有方法要么采用随机障碍函数(SBFs),要么依赖基于有限抽象的数值方法。随机障碍函数类似于李雅普诺夫函数,用于建立(概率)集合不变性,而基于抽象的方法则用有限模型近似随机系统,以计算安全概率界限。本文提出了一个统一视角来看待这些看似不同的方法。具体而言,我们证明这两种方法都可以被解释为随机动态规划问题的近似。这一视角使我们能够正式确立这两种技术的正确性,刻画其收敛性和最优性性质,并分析它们各自的假设、优势和局限性。我们的分析表明,与基于随机障碍函数的方法不同,基于抽象的方法能够提供渐近最优的安全证书,尽管代价是增加计算负担。
英文摘要:
Providing safety guarantees for stochastic dynamical systems is a central problem in various fields, including control theory, machine learning, and robotics. Existing methods either employ Stochastic Barrier Functions (SBFs) or rely on numerical approaches based on finite abstractions. SBFs, analogous to Lyapunov functions, are used to establish (probabilistic) set invariance, whereas abstraction-based approaches approximate the stochastic system with a finite model to compute safety probability bounds. This paper presents a unifying perspective on these seemingly different approaches. Specifically, we show that both methods can be interpreted as approximations of a stochastic dynamic programming problem. This perspective allows us to formally establish the correctness of both techniques, characterize their convergence and optimality properties, and analyze their respective assumptions, advantages, and limitations. Our analysis reveals that, unlike SBFs-based methods, abstraction-based approaches can provide asymptotically optimal safety certificates, albeit at the cost of increased computational effort.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。