pith. sign in

arxiv: 2006.02689 · v1 · pith:IYYG3DEWnew · submitted 2020-06-04 · 💻 cs.AI · cs.LG

Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning

classification 💻 cs.AI cs.LG
keywords planninginstancesdeephardapproachcurrentcurriculum-drivendomains
0
0 comments X
read the original abstract

Despite significant progress in general AI planning, certain domains remain out of reach of current AI planning systems. Sokoban is a PSPACE-complete planning task and represents one of the hardest domains for current AI planners. Even domain-specific specialized search methods fail quickly due to the exponential search complexity on hard instances. Our approach based on deep reinforcement learning augmented with a curriculum-driven method is the first one to solve hard instances within one day of training while other modern solvers cannot solve these instances within any reasonable time limit. In contrast to prior efforts, which use carefully handcrafted pruning techniques, our approach automatically uncovers domain structure. Our results reveal that deep RL provides a promising framework for solving previously unsolved AI planning problems, provided a proper training curriculum can be devised.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Self-Improvement for Fast, High-Quality Plan Generation

    cs.AI 2026-05 unverdicted novelty 7.0

    Self-improvement of a decoder-only transformer yields plans averaging 30% shorter than a source symbolic planner, over 80% optimal where known, with sub-exponential latency scaling.