首页> 外文期刊>Artificial intelligence >Knowledge-based programs as succinct policies for partially observable domains
【24h】

Knowledge-based programs as succinct policies for partially observable domains

机译:基于知识的计划作为部分可观察域的简洁政策

获取原文
获取原文并翻译 | 示例
           

摘要

We suggest to express policies for contingent planning by knowledge-based programs (KBPs). KBPs, introduced by Fagin et al. (1995) [32], are high-level protocols describing the actions that the agent should perform as a function of their current knowledge: branching conditions are epistemic formulas that are interpretable by the agent. The main aim of our paper is to show that KBPs can be seen as a succinct language for expressing policies in single-agent contingent planning. KBP are conceptually very close to languages used for expressing policies in the partially observable planning literature: like them, they have conditional and looping structures, with actions as atomic programs and Boolean formulas on beliefs for choosing the execution path. Now, the specificity of KBPs is that branching conditions refer to the belief state and not to the observations. Because of their structural proximity, KBPs and standard languages for representing policies have the same power of expressivity: every standard policy can be expressed as a KBP, and every KBP can be "unfolded" into a standard policy. However, KBPs are more succinct, more readable, and more explainable than standard policies. On the other hand, they require more online computation time, but we show that this is an unavoidable tradeoff. We study knowledge-based programs along four criteria: expressivity, succinctness, complexity of online execution, and complexity of verification.
机译:我们建议通过知识为基础的计划(KBPS)表达裁决规划的政策。由Fagin等人介绍的Kbps。 (1995)[32]是描述代理应作为其当前知识的函数执行的动作的高级协议:分支条件是代理商可解决的认知公式。我们文件的主要目的是表明Kbps可以被视为在单次代理人队伍规划中表达政策的简洁语言。 KBP在概念上非常接近用于在部分可观察的规划文献中表达政策的语言:与它们一样,它们具有条件和循环结构,以及采用原子序表和布尔公式,用于选择执行路径的原子序表和布尔公式。现在,Kbps的特异性是,分支条件是指信仰状态而不是观察结果。由于它们的结构接近,用于代表策略的Kbps和标准语言具有相同的富有力量:每个标准策略都可以表示为KBP,每个KBP都可以“展开”到标准策略中。然而,KBPS比标准政策更加简洁,更可读,更可说明。另一方面,它们需要更多在线计算时间,但我们表明这是一个不可避免的权衡。我们沿四个标准研究基于知识的计划:表达性,简洁,在线执行的复杂性以及验证的复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号