arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.05522eess.SYcs.AIcs.FLcs.SY
收藏

线性PETC系统的概率保证数据驱动抽象

Data-driven Abstractions with Probabilistic Guarantees for Linear PETC Systems

TU Delft(代尔夫特理工大学)

Andrea Peruffo, Manuel Mazo

摘要:

我们采用的情况下的方法来计算可能近似正确(PAC)的边界上产生的平均样本间时间(AIST)由一个未知的PETC系统,基于有限数量的样本。我们扩展的情况下的方法,多类SVM算法,以构建一个PAC映射之间的具体的,未知的状态空间和样本间的时间。然后,我们建立了一个流量模型,应用$\ell$ -完全关系,并找到,在底层图中,最小和最大的平均重量的周期:这些提供了上下限的AIST。数值基准测试表明,我们的方法,这是对基于模型的国家的最先进的工具进行比较的实用性。

英文摘要:

We employ the scenario approach to compute probably approximately correct (PAC) bounds on the average inter-sample time (AIST) generated by an unknown PETC system, based on a finite number of samples. We extend the scenario approach to multiclass SVM algorithms in order to construct a PAC map between the concrete, unknown state-space and the inter-sample times. We then build a traffic model applying an $\ell$-complete relation and find, in the underlying graph, the cycles of minimum and maximum average weight: these provide lower and upper bounds on the AIST. Numerical benchmarks show the practical applicability of our method, which is compared against model-based state-of-the-art tools.

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

↑