Astana time
AI QAZAQSTANKZ · AIBeta

Smart portal about artificial intelligence and high technology in Kazakhstan

Research1 min read

From the original source:

arXiv — cs.AI

Read full article at arXiv — cs.AI

This material was compiled from public sources. If its publication affects your rights → Request removal

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.AIBy: Dominik Drexler, Simon St{\aa}hlberg, Markus Fritzsche, Blai BonetOctober 9, 2026 (Oct 9)
Available in 1 languages

AI Summary & Key Takeaways

  • 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…
Research
KZ·AI 8CF3
Инсайт дня

Learning How to Search for Plans with Exponentially Less Space

Tags:#arXiv
Share:

Related stories

Back to list