Value iteration working with belief subset

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 307-312

  Zhang, Weixiong ^a   Zhang, Nevin L ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; INITIAL VALUE PROBLEMS; ITERATIVE METHODS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

VALUE ITERATION;

MARKOV PROCESSES;

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

References (13)

1. Aström, K. J. 1965. Optimal control of Markov decision processes with incomplete state estimation. Journal of Mathematical Analysis and Applications 10:403-406.
2. Boutilier, C.; Brafman, R. I.; and Geib, C. 1998. Structured reachability analysis for Markov decision processes. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI).
3. Cassandra, A. R. 1998. Exact and approximate algorithms for partially observable Markov decision processes. Ph.D. Dissertation, Department of Computer science, Brown university.
4. Dean, T., and Givan, R. 1997. Model minimization in Markov decision processes. In Proceedings of National Conference on Artificial Intelligence (AAAI), 106-111.
5. Dean, T. L., and Lin, S. H. 1995. Decomposition techniques for planning in stochastic domains. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), 1121-1127.
6. Dean, T. L.; Kaelbling, L. P.; Kirman, J.; and Nicholson, A. 1993. Planning with deadlines in stochastic domains. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI), 574-579.
7. Geffner, H., and Bonet, B. 1998. Solving large POMDPs using real time dynamic programming. In Working Notes Fall AAAI Symposium on POMDPs, 61-68.
8. Hansen, E., and Feng, Z. 2000. Dynamic programming for POMDPs using a factored state representation. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS). Breckenridge, Colorado.
9. Hauskrecht, M., and Fraser, H. 1998. Modeling treatment of ischemic heart disease with partially observable Markov decision processes. In American Medical Informatics Association annual symposium on Computer Applications in Health Care, 538-542. Orlando, Florida.
10. Lovejoy, W. S. 1991. Computationally feasible bounds for partially observed Markov decision processes. Operations Research 39(1): 162-175.
11. Sondik, E. J. 1971. The optimal control of partially observable decision processes. Ph.D. Dissertation, Stanford University, Stanford, California, USA.
12. Zhang, N. L., and Liu, W. 1997. A model approximation scheme for planning in partially observable stochastic domains. Journal of Artificial Intelligence Research 7:199-230.
13. Zhang, W. 2001. Algorithms for partially observable Markov decision processes. Ph.D. Dissertation, Department of Computer science, the Hong Kong University of Science and Technology.