Deep Hierarchical Reinforcement Learning Algorithm In Partially Observable Markov Decision Processes

Abstract

In recent years, reinforcement learning has achieved many remarkable successes due to the growing adoption of deep learning techniques and the rapid growth in computing power. Nevertheless, it is well-known that flat reinforcement learning algorithms are often not able to learn well and data-efficient in tasks having hierarchical structures, e.g. consisting of multiple subtasks. Hierarchical reinforcement learning is a principled approach that is able to tackle these challenging tasks. On the other hand, many real-world tasks usually have only partial observability in which state measurements are often imperfect and partially observable. The problems of RL in such settings can be formulated as a partially observable Markov decision process (POMDP). In this paper, we study hierarchical RL in POMDP in which the tasks have only partial observability and possess hierarchical properties. We propose a hierarchical deep reinforcement learning approach for learning in hierarchical POMDP. The d

Stats

• citations51
• S2 citations—
• github stars0
• HF likes0
• heat score12.87
• arxiv keytuyen2018deep

Related papers

• Dynamic Deep-reinforcement-learning Algorithm In Partially Observable Markov Decision Processes (2023)0.00
• Provable Representation With Efficient Planning For Partial Observable Reinforcement Learning (2023)0.00
• Real-time Recurrent Reinforcement Learning (2023)2.26
• Globally Optimal Hierarchical Reinforcement Learning For Linearly-solvable Markov Decision Processes (2021)2.26
• Hierarchy Through Composition With Linearly Solvable Markov Decision Processes (2016)0.00
• On Improving Deep Reinforcement Learning For Pomdps (2017)0.00
• Learning Interpretable Policies In Hindsight-observable Pomdps Through Partially Supervised Reinforcement Learning (2024)2.26
• Group Distributionally Robust Reinforcement Learning With Hierarchical Latent Variables (2022)0.00