• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IAAI-12;Innovative applications of artificial intelligence conference;AAAI conference on artificial intelligence;Symposium on educational advances in artificial intelligence;AAAI-12;EAAI-12 >Planning Under Time Pressure
【24h】

Planning Under Time Pressure

机译：在时间压力下进行计划

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Current heuristic search algorithms are ill-suited for planning under time pressure. Most classic heuristic search algorithms attempt to find short plans that will execute quickly. Finding such short plans is problematic as it often requires a prohibitive amount of time. Other search techniques disregard execution time and simply attempt to find any legal plan as quickly as possible. The resulting plans are usually of very low quality and take a long time to execute. When time is of the essence, it is undesirable to spend more time looking for a shorter plan than the amount of time saved by the decreased plan length. Likewise, it is undesirable to spend more time executing a longer plan than the amount of time saved by the decreased planning time.
机译：当前的启发式搜索算法不适合在时间压力下进行计划。大多数经典的启发式搜索算法都试图找到可以快速执行的短期计划。找到这样的短期计划是有问题的，因为它通常需要花费大量的时间。其他搜索技术无视执行时间，而只是试图尽快找到任何法律计划。产生的计划通常质量很差，执行时间很长。当时间至关重要时，不希望花更多的时间来寻找更短的计划，而不是花更少的时间来节省计划时间。同样，与减少计划时间所节省的时间相比，花更多的时间执行更长的计划是不希望的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号