Learning to Plan with Tree Search via Deep RL

Dylan Cope, Justin Svegliato, Stuart Russell

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

87 Downloads (Pure)

Abstract

Tree search is an important component of many decision-making algorithms but often relies on an evaluation function that estimates the desirability of each node. In this paper, we propose to learn which nodes to expand based on a variety of object-level features. We introduce a reward function for this problem based on value of computation estimates with respect to improving the policy for the underlying problem. We apply deep reinforcement learning to this problem in an approach we call Reinforcement Learning for Tree Search (RLTS) and demonstrate that it can yield better performance than baselines in a procedurally generated environment.
Original languageEnglish
Title of host publicationBridging the Gap Between AI Planning and Reinforcement Learning Workshop (PRL @ IJCAI 2023) at the International Joint Conference on Artificial Intelligence
Publication statusAccepted/In press - 2023

Keywords

  • Reinforcement Learning
  • Tree Search
  • Value of Computation
  • Metareasoning

Fingerprint

Dive into the research topics of 'Learning to Plan with Tree Search via Deep RL'. Together they form a unique fingerprint.

Cite this