Prioritizing point-based POMDP solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4212 LNAI, Issue , 2006, Pages 389-400

  Shani, Guy ^a   Brafman, Ronen I ^a   Shimony, Solomon E ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ITERATIVE METHODS; LEARNING ALGORITHMS; MATHEMATICAL MODELS;

APPROXIMATE SOLUTION; POINT-BASED ALGORITHMS; PRIORITIZED VALUE ITERATION (PVI);

LEARNING SYSTEMS;

EID: 33750371924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_38     Document Type: Conference Paper

References (13)

1. R. I. Brafman. A heuristic variable grid solution method for pomdps. In AAAI'97, 1997.
2. A. R. Cassandra, M. L. Littman, and N.L. Zhang. Incremental pruning: A simple, fast, exact method for partially observable markov decision processes. In UAI'97, pages 54-61, 1997.
3. M. Izadi, D. Precup, and D. Azar. Belief selection in point-based planning algorithms for pomdps. In AI'06, 2006.
4. M. L. Littman, A. R. Cassandra, and L. P. Kaelbling. Learning policies for partially observable environments: Scaling up. In ICML'95.
5. W. S. Lovejoy. Computationally feasible bounds for partially observable markov decison processes. Operations Research, 39:175-192, 1991.
6. S. Paquet, L. Tobin, and B. Chaib-draa. Real-time decision making for large pomdps. In AI'2005, 2005.
7. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In IJCAI, August 2003.
8. P. Poupart and C. Boutilier. VDCBPI: an approximate scalable algorithm for large POMDPs. In NIPS 17, MIT Press, 2004.
9. R. Smallwood and E. Sondik. The optimal control of partially observable processes over a finite horizon. Operations Research, 21, 1973.
10. T. Smith and R. Simmons. Heuristic search value iteration for pomdps. In UAI 2004, 2004.
11. T. Smith and R. Simmons. Point-based pomdp algorithms: Improved analysis and implementation. In UAI 2005, 2005.
12. M. T. J. Spaan and N. Vlassis. Perseus: Randomized point-based value iteration for POMDPs. JAIR, 24:195-220, 2005.
13. D. Wingate and K. D. Seppi. Prioritization methods for accelerating mdp solvers. JMLR, 6:851-881, 2005.