Point-based POMDP Algorithms: Improved Analysis and Implementation

Trey Smith and Reid Simmons
Conference Paper, Proc. of the Conference on Uncertainty in Artificial Intelligence, July, 2005

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


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.

author = {Trey Smith and Reid Simmons},
title = {Point-based POMDP Algorithms: Improved Analysis and Implementation},
booktitle = {Proc. of the Conference on Uncertainty in Artificial Intelligence},
year = {2005},
month = {July},
keywords = {probabilistic planning, POMDP},
} 2017-09-13T10:43:19-04:00