• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Automated Planning and Scheduling(ICAPS 2006); 2006; >On Some Tractable Cases of Logical Filtering
【24h】

On Some Tractable Cases of Logical Filtering

机译：关于逻辑过滤的一些可行案例

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Filtering denotes any method whereby an agent updates its belief state—its knowledge of the state of the world—from a sequence of actions and observations. In logical filtering, the belief state is a logical formula describing the possible world states. Efficient algorithms for logical filtering bear important implications on reasoning tasks such as planning and diagnosis. In this paper, we will identify classes of transition constraints that are amenable to compact and indefinite filtering—presenting efficient algorithms wherever necessary. We will first show that connected row-convex (CRC) constraints are amenable to efficient filtering when path-consistency is enforced in appropriate steps. We will then extend this theory to provide a filtering algorithm based on repeatedly enforcing path-consistency and embedding the domain values of the related variables in tree structures to guarantee global consistency. Finally, we will identify and comment on the problem of multi-agent localization as a potential application of the theory developed in the paper (under some reasonable assumptions).
机译：过滤表示代理通过一系列动作和观察来更新其信念状态（即对世界状态的了解）的任何方法。在逻辑过滤中，信念状态是描述可能世界状态的逻辑公式。用于逻辑过滤的高效算法对诸如计划和诊断之类的推理任务具有重要意义。在本文中，我们将确定适合紧凑和不确定过滤的过渡约束类别，并在必要时提供有效的算法。我们将首先显示，当在适当的步骤中强制执行路径一致性时，连接的行凸（CRC）约束适用于有效的过滤。然后，我们将扩展该理论，以提供一种基于重复执行路径一致性并将相关变量的域值嵌入树结构中以确保全局一致性的过滤算法。最后，我们将识别和评论多智能体本地化问题，以此作为本文开发的理论的潜在应用（在一些合理的假设下）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号