阿斯塔纳时间
AI QAZAQSTANKZ · AI测试版

哈萨克斯坦人工智能与高科技领域的智能门户

Research1 分钟阅读

内容来自原始来源：

arXiv — cs.AI

在 arXiv — cs.AI 阅读全文

本内容来自公开来源。若发布内容影响您的权利 → 申请删除信息

标题为英语Learning How to Search for Plans with Exponentially Less Space

Heuristic search for a plan can store exponentially many states, even when its heuristic is almost perfect. We instead learn search control, one specification per domain, written as an indexical policy: a generalized policy with registers that hold objects and modes that…

arXiv — cs.AI作者: Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai Bonet2026年10月9日 (10月9日)
提供 1 种语言版本

AI 摘要：要点

  • Heuristic search for a plan can store exponentially many states, even when its heuristic is almost perfect
  • We instead learn search control, one specification per domain, written as an indexical policy: a generalized policy with registers that hold objects and modes that…
Research
KZ·AI 8CF3
Инсайт дня

Learning How to Search for Plans with Exponentially Less Space

标签：#arXiv
Поделиться:

相关文章

返回列表