【24h】

Hybrid Propositional Encodings of Planning

机译:规划的混合命题编码

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

摘要

Casting planning as propositional satisfiability has been recently shown to be a very promising technique of plan synthesis. Some challenges, one of which is the development of hybrid propositional encodings (that combine the important notions from the existing encodings) have also been posed to the community [1]. The existing encodings [3] are either entirely based only on the plan space planning (also known as "causal" or "least commitment" or "partial order" planning) or only on the state space planning. To answer this challenge, we have developed several hybrid encodings.
机译:最近已证明将铸造计划作为命题可满足性是一种非常有希望的计划综合技术。社区已经提出了一些挑战,其中之一就是混合命题编码的发展(结合了来自现有编码的重要概念)[1]。现有编码[3]要么完全基于计划空间计划(也称为“因果”或“最小承诺”或“部分订单”计划),要么仅基于状态空间计划。为了应对这一挑战,我们开发了几种混合编码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号