Point-based policy iteration

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1243-1249

  Shihao, Ji ^a   Parr, Ronald ^b   Hui, Li ^a   Xuejun, Liao ^a   Carin, Lawrence ^a  

^a Duke University   (United States)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HANSEN'S POLICY; POINT-BASED VALUE ITERATION (PBVI); VALUE FUNCTIONS;

APPROXIMATION ALGORITHMS; PUBLIC POLICY; ROBUSTNESS (CONTROL SYSTEMS); SCALABILITY;

ITERATIVE METHODS;

EID: 36348942884     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Cassandra, A. R.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes. In UAI 13, 54-61.
2. Hansen, E. A. 1998. Solving POMDPs by searching in policy space. In UAI 14, 211-219.
3. Kaelbling, L. P.; Littman, M. L.; and Cassandra, A. R. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101:99-134.
4. Meuleau, N.; Kim, K. E.; Kaelbling, L. P.; and Cassandra, A. R. 1999. Solving POMDPs by searching the space of finite policies. In UAI 15, 417-426.
5. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In IJCAI, 1025-1032.
6. Poupart, P., and Boutilier, C. 2003. Bounded finite state controllers. In NIPS 16.
7. Poupart, P. 2005. Exploiting structure to efficiently solve large scale partially observable Markov decision processes. Ph.D. Dissertation, University of Toronto, Toronto.
8. Puterman, M. L., and Shin, M. C. 1978. Modified policy iteration algorithms for discounted Markov decision problems. Management Science 24(1).
9. Smallwood, R. D., and Sondik, E. J. 1973. The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21 (5): 1071-1088.
10. Smith, T., and Simmons, R. 2004. Heuristic search value iteration for POMDPs. In UAI20.
11. Smith, T., and Simmons, R. 2005. Point-based POMDP algorithms: Improved analysis and implementation. In UAI21.
12. Sondik, E. J. 1978. The optimal control of partially observable Markov processes over the infinite horizon: Discounted costs. Operations Research 26(2):282-304.
13. Spaan, M., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24:195-220.