Solving planning problems with deep reinforcement learning and tree search

Deep reinforcement learning methods are capable of learning complex heuristics starting with no prior knowledge, but struggle in environments where the learning signal is sparse. In contrast, planning methods can discover the optimal path to a goal in the absence of external rewards, but often require a hand-crafted heuristic function to be effective. In this thesis, we describe a model-based reinforcement learning method that bridges the middle ground between these two approaches. When evaluated on the complex domain of Sokoban, the model-based method was found to be more performant, stable and sample-efficient than a model-free baseline.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2018

Author dc:creator

• Ge, Victor

Contributors dc:contributor

• Lazebnik, Svetlana

• reinforcement learning
• mcts
• sokoban
• a*
• heuristic

Statement dc:rights

• Copyright 2018 Victor Ge

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/101086

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/101086