Partially Observable Total-Cost Markov Decision Processes with Weakly Continuous Transition Probabilities
Not on the map. Why?
Abstract (arXiv)
This paper describes sufficient conditions for the existence of optimal policies for Partially Observable Markov Decision Processes (POMDPs) with Borel state, observation, and action sets and with the expected total costs. Action sets may not be compact and one-step cost functions may be unbounded. The introduced conditions are also sufficient for the validity of optimality equations, semi-continuity of value functions, and convergence of value iterations to optimal values. Since POMDPs can be reduced to Completely Observable Markov Decision Processes (COMDPs), whose states are posterior state distributions, this paper focuses on the validity of the above mentioned optimality properties for COMDPs. The central question is whether transition probabilities for a COMDP are weakly continuous. We introduce sufficient conditions for this and show that the transition probabilities for a COMDP are weakly continuous, if transition probabilities of the underlying Markov Decision Process are weakly continuous and observation probabilities for the POMDP are continuous in the total variation. Moreover, the continuity in the total variation of the observation probabilities cannot be weakened to setwise continuity. The results are illustrated with counterexamples and examples.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Jan 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
6 papers.
- 2021Convergence of Finite Memory Q-Learning for POMDPs and Near Optimality of Learned Policies under Filter Stabilitycited by 22
- 2021Q-Learning for MDPs with General Spaces: Convergence and Near Optimality via Quantization under Weak Continuitycited by 11
- 2023Q-Learning for Stochastic Control under General Information Structures and Non-Markovian Environmentscited by 7
- 2022Multi-Step Prediction in Linearized Latent State Spaces for Representation Learningcited by 1
- 2024Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learningcited by 0
- 2025Computing optimal policies for managing inventories with noisy observationscited by 0
- 2025Computing optimal policies for managing inventories with noisy observations26 Jul 2025
- 2024Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learning6 Sep 2024
- 2023Q-Learning for Stochastic Control under General Information Structures and Non-Markovian Environments31 Oct 2023
- 2022Multi-Step Prediction in Linearized Latent State Spaces for Representation Learning2 Sep 2022
- 2021Q-Learning for MDPs with General Spaces: Convergence and Near Optimality via Quantization under Weak Continuity12 Nov 2021
- 2021Convergence of Finite Memory Q-Learning for POMDPs and Near Optimality of Learned Policies under Filter Stability22 Mar 2021