arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.0553eess.SYcs.LGcs.SY
收藏

基于采样的近似方法在一般马尔可夫过程的概率可达-避免问题中的定量性能

Sampling-based Approximations with Quantitative Performance for the Probabilistic Reach-Avoid Problem over General Markov Processes

Eindhoven University of Technology(埃因霍温理工大学);Delft University of Technology(代尔夫特理工大学);University of Oxford(牛津大学)

Sofie Haesaert, Robert Babuska, Alessandro Abate

AI总结:

本文提出基于拟合值迭代算法的近似计算方案,用于解决一般马尔可夫过程的概率可达-避免问题,并提供可计算的误差界以保障安全应用。

摘要:

本文研究了具有马尔可夫性质的随机过程,其在一般(不可数)状态空间中演化,并依赖于非确定性量(控制输入)影响概率动态。本文针对最大可达-避免规范的计算及相应最优控制器的合成进行了研究。可达-避免规范评估模型任何有限时间轨迹进入给定目标集的概率,同时避免给定的不期望状态集。本文提出基于随机采样的近似计算方案,基于拟合值迭代算法,并提供可先验计算的正式概率误差界,从而对数值方案的输出进行定量评估,使其对安全关键应用具有意义。此外,本文还提供了更紧的基于样本的概率误差界。整体计算方案与文献中的其他近似算法相关联,并最终在基准案例研究中评估其性能。

英文摘要:

This article deals with stochastic processes endowed with the Markov (memoryless) property and evolving over general (uncountable) state spaces. The models further depend on a non-deterministic quantity in the form of a control input, which can be selected to affect the probabilistic dynamics. We address the computation of maximal reach-avoid specifications, together with the synthesis of the corresponding optimal controllers. The reach-avoid specification deals with assessing the likelihood that any finite-horizon trajectory of the model enters a given goal set, while avoiding a given set of undesired states. This article newly provides an approximate computational scheme for the reach-avoid specification based on the Fitted Value Iteration algorithm, which hinges on random sample extractions, and gives a-priori computable formal probabilistic bounds on the error made by the approximation algorithm: as such, the output of the numerical scheme is quantitatively assessed and thus meaningful for safety-critical applications. Furthermore, we provide tighter probabilistic error bounds that are sample-based. The overall computational scheme is put in relationship with alternative approximation algorithms in the literature, and finally its performance is practically assessed over a benchmark case study.

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

↑