A model approximation scheme for planning in partially observable stochastic domains

Journal of Artificial Intelligence Research

Volumn 7, Issue , 1997, Pages 199-230

  Zhang, Nevin L ^a   Liu, Wenju ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MARKOV PROCESSES; STOCHASTIC SYSTEMS;

APPROXIMATION QUALITY; APPROXIMATION SCHEME; COMPUTATIONAL TIME; MODEL APPROXIMATIONS; OPTIMAL POLICIES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING PROBLEM; STOCHASTIC DOMAINS;

STOCHASTIC MODELS;

EID: 85016628903     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.419     Document Type: Article

References (30)

1. Bellman, R. (1957). Dynamic Programming. Princeton University Press.
2. Bertsekas, D. P. (1987). Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall.
3. Bertsekas, D. P., & Castanon, D. C. (1989). Adaptive Aggregation for Infinite Horizon Dynamic Programming. IEEE trans. on auto. control, vol 34, No 6.
4. Boutilier, C, Dearden, R., & Goldszmidt, M. (1995). Exploiting structures in policy construction. In Proceedings of IJCAI-95, 1104-1111.
5. Boutilier, C, & Poole, D. (1996). Computing optimal policies for partially observable decision processes using compact representations. In Proceedings of AAAI-96, 1168-1175.
6. Brafman, R. I. (1997). A heuristic variable grid solution method for POMDPs. In Proceedings of AAAI-97, 727-733.
7. Cassandra, A. R. (1994). Optimal polices for partially observable Markov decision processes. TR CS-94-14, Department of Computer Science, Brown University, Providence, Rhode Island 02912, USA.
8. Cassandra, A. R., Kaelbling, L. P., & Littman, M. L. (1994). Acting optimally in partially observable stochastic domains. In Proceedings of AAAI-94, 1023-1028.
9. Cassandra, A. R., Kaelbling, L. P., & Kurien, J. (1996). Acting under uncertainty: Discrete Bayesian models for mobile-robot navigation. In Proceedings of IEEE/Robotics Society of Japan Conference on Intelligent Robotics and Systems (IROS-96).
10. Cassandra, A. R., Littman, M. L., & Zhang, N. L. (1997). Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes. In Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, 54-61.
11. Cheng, H. T. (1988). Algorithms for partially observable Markov decision processes. PhD thesis, University of British Columbia, Vancouver, BC, Canada.
12. Dean, T. L., Givan, R., & Leach, S. (1997). Model reduction techniques for computing approximately optimal solution for Markov decision processes. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 124-131.
13. Dean, T. L., Kaelbling, L. P., Kirman, J., & Nicholson A. (1993). Planning with deadlines in stochastic domains. In Proceedings of AAAI-93, 574-579.
14. Dean T. L., & Lin, S. H. (1995). Decomposition techniques for planning in stochastic domains. TR CS-95-10, Department of Computer Science, Brown University, Provi-dence, Rhode Island 02912, USA.
15. Dean, T. L., & Wellman, M. P. (1991). Planning and Control. Morgan Kaufmann.
16. Eagle, J. N. (1984). The optimal search for a moving target when the search path is constrained. Operations Research, 32(5), 1107-1115.
17. Hauskrecht, M. (1997). Incremental methods for computing bounds in partially observable Markov decision processes. In Proceedings of AAAI-97, 734-739.
18. Littman, M. L. (1994). The witness algorithm: Solving partially observable Markov decision processes. TR CS-94-40, Department of Computer Science, Brown University, Providence, Rhode Island 02912, USA.
19. Littman, M. L., Cassandra, A. R., & Kaelbling, L. P. (1995). Efficient dynamic-programming updates in partially observable Markov decision processes. TR CS-95-19, Department of Computer Science, Brown University, Providence, Rhode Island 02912, USA.
20. Lovejoy, W. S. (1991a). A survey of algorithmic methods for solving partially observable Markov decision processes. Annals of Operations Research, 28 (1), 47-65.
21. Lovejoy, W. S. (1991b). Computationally feasible bounds for partially observed Markov decision processes. Operations Research, 39 (1), 162-175.
22. Monahan, G. E. (1982). A survey of partially observable Markov decision processes: theory, models, and algorithms. Management Science, 28 (1), 1-16.
23. Parr, R., & Russell, S. (1995). Approximating optimal polices for partially observable stochastic domains. In Proceedings of IJCAI-95, 1088-1094.
24. Platzman, L. K. (1977). Finite-memory estimation and control of finite probabilistic systems. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology.
25. Puterman, M. L. (1990). Markov decision processes. In D. P. Heyman and M. J. Sobel (eds.), Handbooks in OR & MS., Elsevier Science Publishers, Vol. 2, 331-434.
26. Sondik, E. J. (1971). The optimal control of partially observable Markov processes. PhD thesis, Stanford University, Stanford, California, USA.
27. Sondik, E. J., & Mendelssohn, R. (1979). Information seeking in Markov decision processes, Southwest Fisheries Center Administrative Report H-79-13, National Marine Fisheries Service, Honolulu, Hawaii.
28. White III, C. C. (1991). Partially observed Markov decision processes: A survey. Annals of Operations Research, 32.
29. White, D. J. (1993). Markov Decision Processes. John Wiley & Sons.
30. White III, C. C, & Scherer, W. T., (1994). Finite-memory suboptimal design for partially observed Markov decision processes. Operations Research, 42(3), 440-455.