多维马尔可夫决策过程的百分位数估计
Percentile Queries in Multi-Dimensional Markov Decision Processes
摘要:
具有多维权重的马尔可夫决策过程(MDP)可用于分析具有多个目标的系统,这些目标可能是冲突的,并且需要进行权衡分析。我们研究了百分位查询在这样的MDP的复杂性,并给出算法来合成策略,执行这样的约束。给定一个多维加权MDP和一个定量回报函数$f$,阈值$v_i$(每维一个)和概率阈值$α_i$,我们展示了如何计算一个单一的策略来执行,对于所有维度$i$,结果$ρ$满足$f_i(ρ) \geq v_i$的概率至少是$α_i$。我们考虑经典的定量回报从文献(sup,inf,lim sup,lim inf,平均回报,截断和,贴现和)。我们的工作扩展到定量的情况下,多目标模型检验问题研究Etessami等人。在未加权MDPs。
英文摘要:
Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze systems with multiple objectives that may be conflicting and require the analysis of trade-offs. We study the complexity of percentile queries in such MDPs and give algorithms to synthesize strategies that enforce such constraints. Given a multi-dimensional weighted MDP and a quantitative payoff function $f$, thresholds $v_i$ (one per dimension), and probability thresholds $α_i$, we show how to compute a single strategy to enforce that for all dimensions $i$, the probability of outcomes $ρ$ satisfying $f_i(ρ) \geq v_i$ is at least $α_i$. We consider classical quantitative payoffs from the literature (sup, inf, lim sup, lim inf, mean-payoff, truncated sum, discounted sum). Our work extends to the quantitative case the multi-objective model checking problem studied by Etessami et al. in unweighted MDPs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。