Learning How to Search for Plans with Exponentially Less Space
arXiv:2610.10954v1 Announce Type: new Abstract: 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 ob…
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-10-09 04:00 · arXiv cs.AI
Learning How to Search for Plans with Exponentially Less Space