arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1811.03643math.OCcs.SYeess.SY
收藏

基于Voronoi划分的场景缩减用于LTI系统的快速采样基于随机可达性计算

Voronoi Partition-based Scenario Reduction for Fast Sampling-based Stochastic Reachability Computation of LTI Systems

University of Texas at Austin(德克萨斯大学奥斯汀分校);University of New Mexico(新墨西哥大学);University of Washington(华盛顿大学)

Hossein Sartipizadeh, Abraham P. Vinod, Behcet Acikmese, Meeko Oishi

AI总结:

本文针对具有加性随机不确定性的线性系统提出了一种随机可达性问题的求解方法,通过采样方法计算在有限时间范围内保持安全集并最终到达目标集的最大概率,并利用Voronoi划分减少计算复杂度以提高效率。

摘要:

在本文中,我们针对具有加性随机不确定性的线性系统解决随机可达-避免问题。我们旨在计算在有限时间范围内状态保持在安全集内并最终到达目标集的最大概率。我们采用基于采样的方法,并提供一个下界来保证所估计的结果提供一个下界。由于基于采样的方法具有概率性质,我们的下界保证是概率性的,所提出的下界可用于满足指定的概率置信水平。为了降低计算复杂度,我们提出了一种基于Voronoi划分的方法,通过检查代表性的划分(单元格)来验证可达-避免约束,而不是原始场景。来自安全集和目标集的状态约束被适当收紧,以确保解决方案为原始基于采样的方法提供下界。我们提出了一种系统的方法来选择这些代表性单元格,并提供灵活性,以在准确性和计算成本之间进行权衡。

英文摘要:

In this paper, we address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a target set at the final time. We employ sampling-based methods and provide a lower bound on the number of scenarios required to guarantee that our estimate provides an underapproximation. Due to the probabilistic nature of the sampling-based methods, our underapproximation guarantee is probabilistic, and the proposed lower bound can be used to satisfy a prescribed probabilistic confidence level. To decrease the computational complexity, we propose a Voronoi partition-based to check the reach-avoid constraints at representative partitions (cells), instead of the original scenarios. The state constraints arising from the safe and target sets are tightened appropriately so that the solution provides an underapproximation for the original sampling-based method. We propose a systematic approach for selecting these representative cells and provide the flexibility to trade-off the number of cells needed for accuracy with the computational cost.

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

↑