Deep Reinforcement Learning with Model Learning and Monte Carlo Tree Search in Minecraft

By Stephan Alaniz. 2018

16 citations recorded by the source corpus.

Deep reinforcement learning has been successfully applied to several visual-input tasks using model-free methods. In this paper, we propose a model-based approach that combines learning a DNN-based transition model with Monte Carlo tree search to solve a block-placing task in Minecraft. Our learned transition model predicts the next frame and the rewards one step ahead given the last four frames of the agent's first-person-view image and the current action. Then a Monte Carlo tree search algorithm uses this model to plan the best sequence of actions for the agent to perform. On the proposed task in Minecraft, our model-based approach reaches the performance comparable to the Deep Q-Network's, but learns faster and, thus, is more training sample efficient.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Reinforcement Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Sergey Levine
  3. Yoshua Bengio
  4. Quoc V. Le
  5. Jianfeng Gao
  6. Kyunghyun Cho
  7. Jason Aaron Edward Weston
  8. Ruslan Salakhutdinov

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Trevor Darrell
  4. Xiaogang Wang
  5. Jitendra Malik
  6. Bernt Schiele
  7. Ming-Hsuan Yang
  8. Cordelia Schmid

In Reinforcement Learning

  1. Sergey Levine
  2. Chelsea Finn
  3. Pieter Abbeel
  4. George Tucker
  5. Shixiang Shane Gu
  6. Ofir Nachum
  7. Aviral Kumar
  8. Arthur Szlam

Citations in the corpus