Bounded-parameter partially observable Markov decision processes

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 240-247

  Ni, Yaodong ^a   Liu, Zhi Qiang ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SCHEDULING; STOCHASTIC CONTROL SYSTEMS;

EMPIRICAL STUDIES; LIMITED DATUM; MARKOV DECISION PROCESSES; PLANNING UNDER UNCERTAINTIES; VALUE ITERATION ALGORITHMS; VALUE ITERATIONS;

SCHEDULING ALGORITHMS;

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

References (10)

1. Cassandra, A.; Littman, M. L.; and Zhang, N. L. 1997. Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes. In UA1-97, 54-61.
2. Cassandra, A. R. 1998. Exact and approximate algorithms for partially observable Markov decision problems. Ph.D. Dissertation, Department of Computer Science, Brown University.
3. Cozman, F. G., and Krotkov, E. 1996. Quasi-Bayesian strategies for efficient plan generation: application to the planning to observe problem. In UAI-96, 186-193.
4. Givan, R.; Leach, S.; and Dean, T. 2000. Boundedparameter Markov decision processes. Artificial Intelligence 122(1-2):71-109.
5. Harmanec, D. 2002. Generalizing markov decision processes to imprecise probabilities. Journal of Statistical Planning and Inference 105:199-213.
6. Itoh, H., and Nakamura, K. 2007. Partially observable markov decision processes with imprecise parameters. Artificial Intelligence 171(8-9):453-490.
7. Kaelbling, L. P.; Littman, M. L.; and Cassandra, A. R. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101(1-2):99-134.
8. Ni, Y., and Liu, Z.-Q. 2008. Bounded-parameter partially observable markov decision processes. Technical Report CityU-SCM-MCG-0501, City University of Hong Kong. Pineau, J.; Gordon, G.; and Thrun, S. 2006. Anytime point-based approximations for large pomdps. Journal of Artificial Intelligence Research 27:335-380.
9. Spaan, M. T. J., and Vlassis, N. A. 2005. Perseus: Randomized point-based value iteration for POMDPs. Journal of Artificial Intelligence Research 24:195-220.
10. White, C., and Eldeib, H. 1994. Markov decision processes with imprecise transition probabilities. Operations Research 43:739-749.