The page you are looking for has moved. You will be redirected to the new location in 5 seconds. Please update your links to use the new location at

Trey Smith's Publications

Sorted by Date   Sorted by Publication Type   Sorted by Topic   

Point-Based POMDP Algorithms: Improved Analysis and Implementation.

Trey Smith and Reid G. Simmons. In Proc. Int. Conf. on Uncertainty in Artificial Intelligence (UAI), 2005.


[PDF (corrected version)]    [Errata in original published version]   


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 effective use of sparsity. Empirical results show speedups of more than two orders of magnitude.

BibTeX Entry

  author = 	 {Trey Smith and Reid G. Simmons},
  title = 	 {Point-Based {POMDP} Algorithms: Improved Analysis and Implementation},
  booktitle =	 {Proc. Int. Conf. on Uncertainty in Artificial Intelligence (UAI)},
  year =	 2005,

Generated by (written by Patrick Riley ). About this theme. Last modified: Fri May 17, 2013 12:44:57