论文标题
证明集成剂代理与设置值不确定性的覆盖范围集合
Certifying the Intersection of Reach Sets of Integrator Agents with Set-valued Input Uncertainties
论文作者
论文摘要
我们考虑在连续时间与紧凑的设置值输入不确定性验证一对相同集成剂的安全性的问题。我们将此验证问题编码为证明或伪造其覆盖范围集的交集的问题。我们将其转录为一个变分问题，即最大程度地减少两个触及范围内的支撑函数。我们通过详细开发两种情况，即说明了所提出的公式的计算障碍。当输入具有随时间变化的规范和通用的超侧面不确定性时。我们表明，后一种情况允许通过二阶锥形编程分布式认证。
We consider the problem of verifying safety for a pair of identical integrator agents in continuous time with compact set-valued input uncertainties. We encode this verification problem as that of certifying or falsifying the intersection of their reach sets. We transcribe the same into a variational problem, namely that of minimizing the support function of the difference of the two reach sets over the unit sphere. We illustrate the computational tractability of the proposed formulation by developing two cases in detail, viz. when the inputs have time-varying norm-bounded and generic hyperrectangular uncertainties. We show that the latter case allows distributed certification via second order cone programming.
