Approximate Control for Continuous-Time POMDPs
Not on the map. Why?
Abstract (arXiv)
This work proposes a decision-making framework for partially observable systems in continuous time with discrete state and action spaces. As optimal decision-making becomes intractable for large state spaces we employ approximation methods for the filtering and the control problem that scale well with an increasing number of states. Specifically, we approximate the high-dimensional filtering distribution by projecting it onto a parametric family of distributions, and integrate it into a control heuristic based on the fully observable system to obtain a scalable policy. We demonstrate the effectiveness of our approach on several partially observed systems, including queueing systems and chemical reaction networks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 51 references that are in the map. First posted on arXiv 2 Feb 2024.
Builds on
8 of 51 references.
References · 8
- 2018Deep Variational Reinforcement Learning for POMDPscited by 122
- 2016DESPOT: Online POMDP Planning with Regularizationcited by 105
- 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 81
- 2017QMDP-Net: Deep Learning for Planning under Partial Observabilitycited by 51
- 2019Making Deep Q-learning methods robust to time discretizationcited by 51
- 2020Model-based Reinforcement Learning for Semi-Markov Decision Processes with Neural ODEscited by 32
- 2021Structured World Belief for Reinforcement Learning in POMDPcited by 21
- 2020POMDPs in Continuous Time and Discrete Spacescited by 3
Built on by
Not cited yet.