arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.04545eess.SYcs.SYmath.OC
收藏

不确定线性系统前向可达集的任意时间椭球过逼近

Anytime Ellipsoidal Over-approximation of Forward Reach Sets of Uncertain Linear Systems

Shadi Haddad, Abhishek Halder

摘要:

计算受控不确定动力系统的可达集的紧过逼近是安全关键信息物理系统(CPS)验证中的常见实践。虽然有几种算法可用于此目的,但它们在CPS应用中往往对计算要求很高,因为在这里,诸如处理器可用性的计算资源往往是稀缺的、时变的并且难以建模。一个自然的想法是设计“计算感知”算法,它可以以可证明安全的方式动态地适应处理器的可用性。尽管这个想法应该适用于更广泛的背景,但这里我们重点关注椭圆体过近似。我们证明了椭球过近似的不确定线性系统的到达集的算法,是非常适合于任何时候的实施的意义上的过近似的质量可以动态地权衡取决于可用的计算时间,所有的同时保证安全。我们给出了一个数值例子来说明的想法,并指出可能的未来发展方向。

英文摘要:

Computing tight over-approximation of reach sets of a controlled uncertain dynamical system is a common practice in verification of safety-critical cyber-physical systems (CPS). While several algorithms are available for this purpose, they tend to be computationally demanding in CPS applications since here, the computational resources such as processor availability tend to be scarce, time-varying and difficult to model. A natural idea then is to design "computation-aware" algorithms that can dynamically adapt with respect to the processor availability in a provably safe manner. Even though this idea should be applicable in broader context, here we focus on ellipsoidal over-approximations. We demonstrate that the algorithms for ellipsoidal over-approximation of reach sets of uncertain linear systems, are well-suited for anytime implementation in the sense the quality of the over-approximation can be dynamically traded off depending on the computational time available, all the while guaranteeing safety. We give a numerical example to illustrate the idea, and point out possible future directions.

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

↑