• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Artificial Intelligence Planning and Scheduling; 2000414-17; Breckenridge,CO(US) >Planning with Reduced Operator Sets
【24h】

Planning with Reduced Operator Sets

机译：使用减少的运算符集进行规划

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

摘要

Classical propositional STRIPS planning is nothing but the search for a path in the state-transition graph induced by the operators in the planning problem. What makes the problem hard is the size and the sometimes adverse structure of this graph. We conjecture that the search for a plan would be more efficient if there were only a small number of paths from the initial state to the goal state. To verify this conjecture, we define the notion of reduced operator sets and describe ways of finding such reduced sets. We demonstrate that some state-of-the-art planners run faster using reduced operator sets.
机译：经典的命题STRIPS规划只不过是在规划问题中由操作员在状态转换图中寻找路径。使该问题变得棘手的是该图的大小和有时不利的结构。我们推测，如果从初始状态到目标状态的路径很少，那么搜索计划的效率就会更高。为了验证这种猜想，我们定义了约简运算符集的概念，并描述了找到此类约简集的方法。我们证明了一些最先进的计划员使用减少的运算符集可以更快地运行。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号