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…

Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai Bonet·arXiv — cs.AI

Original Source

Key Takeaways

01.Heuristic search for a plan can store exponentially many states, even when its heuristic is almost perfect
02.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…

This material is provided as an extended analytical summary.

Read full article at source

Aggregated within AI Qazaqstan national intelligence stream with author attribution.