Deep Reinforcement Learning with Model Learning and Monte Carlo Tree Search in Minecraft
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningMinecraftReinforcement LearningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Hedging of Financial Derivative Contracts via Monte Carlo Tree Search
The construction of approximate replication strategies for pricing and hedging of derivative contracts in incomplete markets is a key problem of financial engineering. Recently Reinforcement Learning algorithms for hedgi…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)StarCraft II Build Order Optimization using Deep Reinforcement Learning and Monte-Carlo Tree Search
The real-time strategy game of StarCraft II has been posed as a challenge for reinforcement learning by Google's DeepMind. This study examines the use of an agent based on the Monte-Carlo Tree Search algorithm for optimi…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+2Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network
We present a self-learning approach that combines deep reinforcement learning and Monte Carlo tree search to solve the traveling salesman problem. The proposed approach has two advantages. First, it adopts deep reinforce…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+2Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?
Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…
Reinforcement LearningLearning Position Evaluation Functions Used in Monte Carlo Softmax Search
This paper makes two proposals for Monte Carlo Softmax Search, which is a recently proposed method that is classified as a selective search like the Monte Carlo Tree Search. The first proposal separately defines the node…
PositionReinforcement Learning