首页> 外文会议>International Conference on Principles and Practice of Constraint Programming >Solution Extraction with the 'Critical Path' in Graphplan-Based Optimal Temporal Planning
【24h】

Solution Extraction with the 'Critical Path' in Graphplan-Based Optimal Temporal Planning

机译:基于GraphVan的最优时间计划中的“关键路径”解决方案提取

获取原文

摘要

In AI planning, given the initial state, the goal state and a set of actions, a solution of the problem is a sequence of actions which takes the initial state to the goal state, i.e. a plan. The field has been studied and significantly improved since the past few years. Many state of the art planning systems, such as Graphplan, FF, GP-GSP, TGP, TPSYS, TP4, TLPlan, STAN, LPGP, have shown their good performance on different planning domains. Scientists continue studying to deal with bigger and more complex planning domains which include the explicit modelling of time, resources.
机译:在AI规划中,给定初始状态,目标状态和一组动作,问题的解决方案是将初始状态的一个动作序列,即目标状态,即计划。自过去几年以来,该领域已被研究和显着提高。许多艺术规划系统,如GraphPlan,FF,GP-GSP,TGP,TPSYS,TP4,TLPlan,STAN,LPGP,在不同的规划域中表现出它们的良好性能。科学家们继续学习处理更大,更复杂的规划域,其中包括明确的时间建模,资源。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号