# Learning How to Search for Plans with Exponentially Less Space

> Толық мәтін ағылшын тілінде

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