# Learning How to Search for Plans with Exponentially Less Space

**Published:** October 9, 2026
**Author:** Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai Bonet
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/en/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…

> From the original source: **arXiv — cs.AI**
> [Read full article at arXiv — cs.AI](https://arxiv.org/abs/2610.10954)

**Tags:** #arXiv

---

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