arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0805.1660math.OCmath.DS
收藏

不确定性随机控制算法的样本重用技术

Sample Reuse Techniques of Randomized Algorithms for Control under Uncertainty

Xinjia Chen, Jorge L. Aravena, Kemin Zhou

摘要:

样本重用技术大大降低了概率鲁棒性分析的数值复杂度。现有的结果表明,对于一个嵌套的超球集合,执行$N$等效i.i.d.(相同和独立)的实验,每个球是绝对有界的,独立的球的数量,只取决于初始和最终半径。在本章中,我们将样本重用提升到一个新的通用性水平,并确定执行$N$等效i.i.d.如果集合是嵌套的,则集合链的实验是绝对有界的。只要嵌套属性成立,每个集合甚至不必连接。因此,例如,结果允许确定性和概率分析的集成,以消除不确定性集合中的区域,并进一步降低某些问题的复杂性。从更一般的角度来看,该结果使得能够分析混合实值和离散值随机变量的复杂判定问题。

英文摘要:

Sample reuse techniques have significantly reduced the numerical complexity of probabilistic robustness analysis. Existing results show that for a nested collection of hyper-spheres the complexity of the problem of performing $N$ equivalent i.i.d. (identical and independent) experiments for each sphere is absolutely bounded, independent of the number of spheres and depending only on the initial and final radii. In this chapter we elevate sample reuse to a new level of generality and establish that the numerical complexity of performing $N$ equivalent i.i.d. experiments for a chain of sets is absolutely bounded if the sets are nested. Each set does not even have to be connected, as long as the nested property holds. Thus, for example, the result permits the integration of deterministic and probabilistic analysis to eliminate regions from an uncertainty set and reduce even further the complexity of some problems. With a more general view, the result enables the analysis of complex decision problems mixing real-valued and discrete-valued random variables.

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

↑