A New View on Planning in Online Reinforcement Learning
This paper investigates a new approach to model-based reinforcement learning using background planning: mixing (approximate) dynamic programming updates and model-free updates, similar to the Dyna architecture. Background planning with learned models is often worse than model-free alternatives, such as Double DQN, even though the former uses significantly more memory and computation. The fundamental problem is that learned models can be inaccurate and often generate invalid states, especially when iterated many steps. In this paper, we avoid this limitation by constraining background planning to a set of (abstract) subgoals and learning only local, subgoal-conditioned models. This goal-space planning (GSP) approach is more computationally efficient, naturally incorporates temporal abstraction for faster long-horizon planning and avoids learning the transition dynamics entirely. We show that our GSP algorithm can propagate value from an abstract space in a manner that helps a variety of base learners learn significantly faster in different domains.
Code (0)
등록된 구현이 없습니다.
Tasks
Model-based Reinforcement Learningreinforcement-learningReinforcement LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Bag of Views: An Appearance-based Approach to Next-Best-View Planning for 3D Reconstruction
UAV-based intelligent data acquisition for 3D reconstruction and monitoring of infrastructure has experienced an increasing surge of interest due to recent advancements in image processing and deep learning-based techniq…
3D ReconstructionDataset GenerationLatent Variable Representation for Reinforcement Learning
Deep latent variable models have achieved significant empirical successes in model-based reinforcement learning (RL) due to their expressiveness in modeling complex transition dynamics. On the other hand, it remains uncl…
Model-based Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Latent Skill Planning for Exploration and Transfer
To quickly solve new tasks in complex environments, intelligent agents need to build up reusable knowledge. For example, a learned world model captures knowledge about the environment that applies to new tasks. Similarly…
ExIt-OOS: Towards Learning from Planning in Imperfect Information Games
The current state of the art in playing many important perfect information games, including Chess and Go, combines planning and deep reinforcement learning with self-play. We extend this approach to imperfect information…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Exposure-Based Multi-Agent Inspection of a Tumbling Target Using Deep Reinforcement Learning
As space becomes more congested, on orbit inspection is an increasingly relevant activity whether to observe a defunct satellite for planning repairs or to de-orbit it. However, the task of on orbit inspection itself is …
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)