Efficient maximization in solving POMDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 975-980

  Feng, Zhengzhu ^a   Zilberstein, Shlomo ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF SPACE; LINEAR PROGRAMS; POMDPS; VECTOR PRUNING;

CONSTRAINT THEORY; DATA STRUCTURES; DYNAMIC PROGRAMMING; LEARNING ALGORITHMS; MARKOV PROCESSES; PROBLEM SOLVING; VECTORS;

MULTI AGENT SYSTEMS;

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

References (12)

1. Cassandra, A.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact method for partially observable markov decision processes. In Proc. of the 13th Conf. on Uncertainty in Artificial Intelligence, 54-61.
2. Cassandra, A. R. 1999. Tony's POMDP page. http://www.cs.brown.edu/ research/ai/pomdp/.
3. Feng, Z., and Hansen, E. 2001. Approximate planning for factored POMDPs. In Proc. of the 6th European Conf. on Planning.
4. Feng, Z., and Zilberstein, S. 2004. Region-based incremental pruning for pomdps. In Proc. of the 20th Conf. on Uncertainty in Artificial Intelligence, 146-153.
5. Hansen, E. A. 1998. An improved policy iteration algorithm for partially observable MDPs. In Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence (UA1-98).
6. Littman, M.; Cassandra, A.; and Kaelbling, L. 1996. Efficient dynamic-programming updates in partially observable markov decision processes. Technical Report CS-95-19, Brown University, Providence, RI.
7. Littman, M. 1994. The witness algorithm: Solving partially observable markov decision processes. Technical Report CS-94-40, Computer Science, Brown University.
8. Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21:1071-1088.
9. White, C. 1991. A survey of solution techniques for the partially observed markov decision process. Annals of Operations Research 32:215-230.
10. Zhang, N. L., and Liu, W. 1996. Planning in stochastic domains: Problem characteristics and approximation. Technical Report HKUST-CS96-31, Hong Kong University of Science and Technology.
11. Zhang, N., and Zhang, W. 2001. Speeding up the convergence of value iteration in partially observable markov decision processes. Journal of AI Research 14:29-51.
12. Zhang, W., and Zhang, N. 2002. Value iteration working with belief subset. In Proc. of the 18th National Conf. on Artificial Intelligence (AAAI-02).