# Learning How to Search for Plans with Exponentially Less Space

> 全文为英语

**Published:** 2026年10月9日
**Author:** Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai Bonet
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/zh/articles/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**
> [在 arXiv — cs.AI 阅读全文](https://arxiv.org/abs/2610.10954)

**标签：** #arXiv

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*