Approximate Control for Continuous-Time POMDPs
Yannick Eich, Bastian Alt, Heinz Koeppl
TL;DR
This work addresses control under partial observability in continuous time with discrete states by decoupling filtering and control. It introduces entropic matching to obtain a low-dimensional, parametric belief evolution and a QMDP-inspired control policy that scales to large state spaces. The approach is demonstrated on queueing networks, predator-prey CRNs, and closed-loop CRNs, with findings showing competitive performance against particle filters and strong qualitative improvements in stability and balancing. The results indicate that scalable CT-POMDP control is feasible and potentially impactful for complex stochastic systems where exact filtering and optimal control are intractable.
Abstract
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.
