{
  "id": "1512.03873",
  "version": "v1",
  "published": "2015-12-12T05:25:04.000Z",
  "updated": "2015-12-12T05:25:04.000Z",
  "title": "Structural Results for Partially Observed Markov Decision Processes",
  "authors": [
    "Vikram Krishnamurthy"
  ],
  "categories": [
    "math.OC"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-12-12T05:25:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "markov decision processes",
      "structural results",
      "optimal policy",
      "brute force computations",
      "introductory tutorial"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}