• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Italian Association for Artificial Intelligence Congress; 20070910-13; Rome(IT) >SAT-Based Planning with Minimal-#actions Plans and 'soft' Goals
【24h】

SAT-Based Planning with Minimal-#actions Plans and 'soft' Goals

机译：基于SAT的计划，带有最少的行动计划和“软”目标

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

摘要

Planning as Satisfiability (SAT) is the best approach for optimally solving classical planning problems. The SAT-based planner SAT-PLAN has been the winner in the deterministic track for optimal planners in the 4th International Planning Competition (IPC-4) and the co-winner in the last 5th IPC (together with another SAT-based planner). Given a planning problem 77, SATPLAN works by (ⅰ) generating a SAT formula Π_n with a fixed "makespan" n, and (ⅱ) checking Π_n for satisfiability. The algorithm stops if Π_n is satisfiable, and thus a plan has been found, otherwise n is increased. Despite its efficiency, and the optimality of the makespan, SATPLAN has significant deficiency related in particular to "plan quality", e.g., the number of actions in the returned plan, and the possibility to express and reason on "soft" goals. In this paper, we present SATPLAN, a system, modification of SATPLAN, which makes a significant step towards the elimination of SAT-plan's limitations. Given the optimal makespan, SATPLAN returns plans with minimal number of actions and maximal number of satisfied "soft" goals, with respect to both cardinality and subset inclusions. We selected several benchmarks from different domains from all the IPCs: on these benchmarks we show that the plan quality returned by SATPLAN is often significantly higher than the one returned by SATPLAN. Quite surprisingly, this is often achieved without sacrificing efficiency while obtaining results that are competitive with the winning system of the "SimplePreferences" domain in the satisfying track of the last IPC.
机译：可满足性计划（SAT）是最佳解决经典计划问题的最佳方法。基于SAT的规划师SAT-PLAN在第四届国际规划大赛（IPC-4）的最佳规划师确定性赛中获胜，并且在最近的第五届IPC中（与另一位基于SAT的规划师）共同获胜。给定一个规划问题77，SATPLAN的工作原理是（ⅰ）生成具有固定“ makespan” n的SAT公式_n，以及（ⅱ）检查__n的可满足性。如果满足__n，则算法停止，因此已找到计划，否则增加n。尽管有效率，并且有最优化的制造期，但是SATPLAN仍然存在明显的缺陷，特别是与“计划质量”有关，例如，返回的计划中的操作数量以及表达和推理“软”目标的可能性。在本文中，我们介绍了SATPLAN，这是对SATPLAN的修改，这是朝着消除SAT计划的局限性迈出的重要一步。给定最佳的跨度，SATPLAN返回的方案在基数和子集包含方面都具有最少的动作和最大数量的满足的“软”目标。我们从所有IPC的不同领域中选择了几个基准：在这些基准上，我们显示SATPLAN返回的计划质量通常明显高于SATPLAN返回的计划质量。非常令人惊讶的是，这通常在不牺牲效率的情况下实现，同时获得了与“ SimplePreferences”域的获胜系统在最后一个IPC令人满意的轨道上具有竞争力的结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号