Using core beliefs for point-based value iteration

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1751-1753

  Izadi, Masoumeh T ^a   Rajwade, Ajit V ^b   Precup, Doina ^a  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POINT-BASED APPROXIMATION; POINT-BASED VALUE ITERATIONS; RECENT RESEARCHES; VALUE FUNCTIONS; WELL-COVERED; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE;

ITERATIVE METHODS;

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

References (9)

1. Michael James and Satinder Singh. Predictive State Representations: A New Theory for Modeling Dynamical Systems. ICML 21, pages 417-424, 2004.
2. Leslie P. Kaelbling, Michael L. Littman, and Anthony R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1998.
3. Michael Littman, Richard S. Sutton, and Satinder Singh. Predictive representations of state. In NIPS 14, pages 1555-1561, 2002.
4. Joelle Pineau, Geoff Gordon, and Sebastian Thrun. Point-based value iteration: An anytime algorithms for POMDPs. In Proceedings of IJCAI, pages 1025-1032, 2003.
5. Pascal Poupart and Craig Boutilier. VDCBPI: an approximate scalable algorithm for large scale POMDPs. In NIPS 17, 2004.
6. Nicholas Roy and Geoffrey Gordon. Exponential family PCA for belief compression in POMDPs. In NIPS 15, pages 1635-1642, 2003.
7. Tery Smith and Reid Simmons. Heuristic Search Value Iteration for POMDPs. In UAI 20, pages 520-527, 2004.
8. Edward J. Sondik. The optimal control of Partially Observable Markov Decision Processes. PhD Thesis, Stanford University, 1971.
9. Nikos Vlassis and Matthijs Spaan. A point-based POMDP algorithm for robot planning. In Proceedings of ICRA, 2004.