arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.02689cs.AIcs.LG
收藏

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

Cornell University(康奈尔大学)

Dieqiao Feng, Carla P. Gomes, Bart Selman

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑