Point-Based POMDP Algorithms: Improved Analysis and Implementation

  title={Point-Based POMDP Algorithms: Improved Analysis and Implementation},
  author={Trey Smith and Reid G. Simmons},
Existing complexity bounds for point-based POMDP value iteration algorithms focus either on the curse of dimensionality or the curse of history. We derive a new bound that relies on both and uses the concept of discounted reachability; our conclusions may help guide future algorithm design. We also discuss recent improvements to our (point-based) heuristic search value iteration algorithm. Our new implementation calculates tighter initial bounds, avoids solving linear programs, and makes more… CONTINUE READING
Highly Influential
This paper has highly influenced 75 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 422 citations. REVIEW CITATIONS

4 Figures & Tables



Citations per Year

423 Citations

Semantic Scholar estimates that this publication has 423 citations based on the available data.

See our FAQ for additional information.