Reinforcement Learning under Partial Observability Guided by Learned Environment Models
Not on the map. Why?
Abstract (arXiv)
In practical applications, we can rarely assume full observability of a system's environment, despite such knowledge being important for determining a reactive control system's precise interaction with its environment. Therefore, we propose an approach for reinforcement learning (RL) in partially observable environments. While assuming that the environment behaves like a partially observable Markov decision process with known discrete actions, we assume no knowledge about its structure or transition probabilities. Our approach combines Q-learning with IoAlergia, a method for learning Markov decision processes (MDP). By learning MDP models of the environment from episodes of the RL agent, we enable RL in partially observable domains without explicit, additional memory to track previous interactions for dealing with ambiguities stemming from partial observability. We instead provide RL with additional observations in the form of abstract environment states by simulating new experiences on learned environment models to track the explored states. In our evaluation, we report on the validity of our approach and its promising performance in comparison to six state-of-the-art deep RL techniques with recurrent neural networks and fixed memory.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 11 of its 26 references that are in the map. First posted on arXiv 23 Jun 2022.
Builds on
11 of 26 references.
References · 11
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
- 2016OpenAI Gymcited by 1,736
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
- 2017Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximationcited by 121
- 2019Joint Inference of Reward Machines and Policies for Reinforcement Learningcited by 56
- 2019Reinforcement Learning with Non-Markovian Rewardscited by 45
- 2020Active Finite Reward Automaton Inference and Reinforcement Learning Using Queries and Counterexamplescited by 23
- 2019Induction of Subgoal Automata for Reinforcement Learningcited by 17
- 2014Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applicationscited by 9
- 2020Verification of indefinite-horizon POMDPscited by 8
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2022Optimizing Crop Management with Reinforcement Learning and Imitation Learningcited by 13
- 2022Automata Learning meets Shieldingcited by 9
- 2025Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environmentscited by 1
- 2026ATLAS: Discovering Agent Strategies through LLM-Guided Abstraction and Automata Learningcited by 0
- 2026ATLAS: Discovering Agent Strategies through LLM-Guided Abstraction and Automata Learning14 Aug 2026
- 2025Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments24 Jul 2025
- 2022Automata Learning meets Shielding4 Dec 2022
- 2022Optimizing Crop Management with Reinforcement Learning and Imitation Learning20 Sep 2022