计算达芬奇管之间的距离
Computing Distances between Reach Flowpipes
AI总结:
本文研究了在噪声和初始状态不确定性下两个混合动力系统差异的量化,提出通过达芬奇管计算轨迹集的上下界,并扩展了斯科罗霍德距离到达芬奇管以计算轨迹集的距离界。
摘要:
我们研究了在噪声和初始状态不确定性下两个混合动力系统差异的量化。尽管这些系统的轨迹集是无限的,但可以使用达芬奇管来符号化地近似轨迹集,达芬奇管计算了随时间演化的可达集的上下界。我们通过达芬奇管之间的距离来估计两个系统对应轨迹集之间的距离。对于两个单独的轨迹,斯科罗霍德距离已被提出作为鲁棒且高效的距离度量,能够捕捉值和时间扭曲。在本文中,我们扩展了斯科罗霍德距离到达芬奇管,并提供了计算两个轨迹集距离上下界的算法。我们的算法利用了新的几何见解,用于计算两个随时间演化的多面体集之间的最坏情况和最佳情况距离。
英文摘要:
We investigate quantifying the difference between two hybrid dynamical systems under noise and initial-state uncertainty. While the set of traces for these systems is infinite, it is possible to symbolically approximate trace sets using \emph{reachpipes} that compute upper and lower bounds on the evolution of the reachable sets with time. We estimate distances between corresponding sets of trajectories of two systems in terms of distances between the reachpipes. In case of two individual traces, the Skorokhod distance has been proposed as a robust and efficient notion of distance which captures both value and timing distortions. In this paper, we extend the computation of the Skorokhod distance to reachpipes, and provide algorithms to compute upper and lower bounds on the distance between two sets of traces. Our algorithms use new geometric insights that are used to compute the worst-case and best-case distances between two polyhedral sets evolving with time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。