mlsanityData to 7 Oct 2026

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

arXiv 2006.02689 ↗First posted 4 Jun 2020cs.AI cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 3; 2023: 1; 2024: 0; 2025: 1.

10 papers.