Structural Results for Partially Observed Markov Decision Processes
Not on the map. Why?
Abstract (arXiv)
This article provides an introductory tutorial on structural results in partially observed Markov decision processes (POMDPs). Typically, computing the optimal policy of a POMDP is computationally intractable. We use lattice program- ming methods to characterize the structure of the optimal policy of a POMDP without brute force computations.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 12 Dec 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Reinforcement Learning Design for Quickest Change Detection21 Mar 2024