【24h】

Planning under Risk and Knightian Uncertainty

机译:风险和骑士不确定性下的规划

获取原文

摘要

Two noteworthy models of planning in AI are probabilistic planning (based on MDPs and its generalizations) and nondeterministic planning (mainly based on model checking). In this paper we: (1) show that probabilistic and nondeterministic planning are extremes of a rich continuum of problems that deal simultaneously with risk and (Knigh-tian) uncertainty; (2) obtain a unifying model for these problems using imprecise MDPs; (3) derive a simplified Bellman's principle of optimality for our model; and (4) show how to adapt and analyze state-of-art algorithms such as (L)RTDP and LDFS in this unifying setup. We discuss examples and connections to various proposals for planning under (general) uncertainty.
机译:人工智能中两个值得注意的计划模型是概率计划(基于MDP及其概括)和非确定性计划(主要基于模型检查)。在本文中,我们:(1)证明概率规划和非确定性规划是同时处理风险和(Knigh-tian)不确定性的一系列问题的极端。 (2)使用不精确的MDP获得这些问题的统一模型; (3)为我们的模型推导简化的贝尔曼最优性原则; (4)显示了如何在这种统一设置中适应和分析最新算法,例如(L)RTDP和LDFS。我们讨论了在(一般)不确定性下进行规划的各种建议的示例和联系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号