Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning
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
Citing papers per year: 2021: 5; 2022: 3; 2023: 1; 2024: 0; 2025: 1.
10 papers.
- 2021Variational Automatic Curriculum Learning for Sparse-Reward Cooperative Multi-Agent Problemscited by 25
- 2023Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goalcited by 10
- 2021A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instancescited by 9
- 2025Reinforcement learning with combinatorial actions for coupled restless banditscited by 5
- 2021Solving Sokoban with forward-backward reinforcement learningcited by 4
- 2021Untangling Braids with Multi-agent Q-Learningcited by 3
- 2022Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planningcited by 3
- 2022A Differentiable Loss Function for Learning Heuristics in A*cited by 2
- 2021Transfer Learning and Curriculum Learning in Sokobancited by 1
- 2022Graph Value Iterationcited by 0
- 2025Reinforcement learning with combinatorial actions for coupled restless bandits1 Mar 2025
- 2023Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal30 Oct 2023
- 2022Graph Value Iteration20 Sep 2022
- 2022A Differentiable Loss Function for Learning Heuristics in A*12 Sep 2022
- 2022Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning28 Jun 2022
- 2021Variational Automatic Curriculum Learning for Sparse-Reward Cooperative Multi-Agent Problems8 Nov 2021
- 2021A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances3 Oct 2021
- 2021Untangling Braids with Multi-agent Q-Learning29 Sep 2021
- 2021Transfer Learning and Curriculum Learning in Sokoban25 May 2021
- 2021Solving Sokoban with forward-backward reinforcement learning5 May 2021