arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.01918eess.SYcs.SY

对具有未知扰动分布的随机系统实现有限时间概率安全保证

PAC Finite-Time Safety Guarantees for Stochastic Systems with Unknown Disturbance Distributions

Taoran Wu, Dominik Wagner, C. -H. Luke Ong, Bai Xue

AI总结:

本文提出了一种基于数据驱动的方法,通过有限样本建立随机系统在有限时间内的概率安全保证,结合VC维、场景优化和Rademacher复杂性理论,揭示样本大小、模型复杂度与安全容忍度之间的权衡。

摘要:

我们研究了如何利用屏障证书方法,为受未知扰动分布影响的离散时间随机动态系统建立有限时间概率安全保证。我们的方法开发了一种数据驱动的安全认证框架,该框架仅依赖于有限数量的独立同分布(i.i.d.)扰动样本。在此框架下,我们提出了一种认证程序,使得在对采样扰动具有至少$1-δ$置信度的情况下,如果认证程序的结果被接受,则系统在有限的时间范围内保持在规定安全集内的概率至少为$1-ε$。关键挑战在于正式表征由有限样本引起的可能近似正确(PAC)泛化行为。为此,我们利用来自VC维、场景优化和Rademacher复杂性的工具推导出PAC泛化界限。这些结果揭示了样本大小、模型复杂性和安全容忍度之间的根本权衡,为设计可靠的、数据驱动的安全证书提供了理论洞察和实际指导。

英文摘要:

We investigate the problem of establishing finite-time probabilistic safety guarantees for discrete-time stochastic dynamical systems subject to unknown disturbance distributions, using barrier certificate methods. Our approach develops a data-driven safety certification framework that relies only on a finite collection of independent and identically distributed (i.i.d.) disturbance samples. Within this framework, we propose a certification procedure such that, with confidence at least $1-δ$ over the sampled disturbances, if the output of the certification procedure is accepted, the probability that the system remains within a prescribed safe set over a finite horizon is at least $1-ε$. A key challenge lies in formally characterizing the probably approximately correct (PAC) generalization behavior induced by finite samples. To address this, we derive PAC generalization bounds using tools from VC dimension, scenario optimization, and Rademacher complexity. These results illuminate the fundamental trade-offs between sample size, model complexity, and safety tolerance, providing both theoretical insight and practical guidance for designing reliable, data-driven safety certificates in discrete-time stochastic systems.

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

↑