Learning policies for partially observable environments: Scaling up

Proceedings of the 12th International Conference on Machine Learning, ICML 1995

Volumn , Issue , 1995, Pages 362-370

  Littman, Michael L ^a   Cassandra, Anthony R ^a   Kaelbling, Leslie Pack ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

DECISION PROBLEMS; LEARNING POLICY; MARKOV DECISION PROCESS MODELS; MODELING DECISIONS; NOISY SENSORS; PARTIALLY OBSERVABLE ENVIRONMENTS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; SCALING-UP; SENSOR FEEDBACK; SIMPLE++;

MARKOV PROCESSES;

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

References (27)

1. Astrom, K. J. (1965). Optimal control of Markov decision processes with incomplete state estimation. J. Math. Anal. Appl., 10:174-205.
2. Bertsekas, D. P. (1987). Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall.
3. Boutilier, C , Dearden, R., and Goldszmidt, M. (1995). Exploiting structure in policy construction. In Proceedings of the International Joint Conference on Artificial Intelligence.
4. Cassandra, A. (1994). Optimal policies for partially observable Markov decision processes. Technical Report CS-94-14, Brown University, Department of Computer Science, Providence RI.
5. Cassandra, A. R., Kaelbling, L. P., and Littman, M. L. (1994). Acting optimally in partially observable stochastic domains. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, WA.
6. Cheng, H.-T. (1988). Algorithms for Partially Observable Markov Decision Processes. PhD thesis, University of British Columbia, British Columbia, Canada.
7. Chrisman, L. (1992). Reinforcement learning with perceptual aliasing: The perceptual distinctions approach. In Proc. Tenth National Conference on AI (AAAI).
8. Connell, J. and Mahadevan, S. (1993). Rapid task learning for real robots. In Robot Learning. Kluwer Academic Publishers.
9. Jaakkola, T., Jordan, M. I., and Singh, S. P. (1994). On the convergence of stochastic iterative dynamic programming algorithms. Neural Computation, 6(6).
10. Kushmerick, N., Hanks, S., and Weld, D. (1993). An Algorithm for Probabilistic Planning. Technical Report 93-06-03, University of Washington Department of Computer Science and Engineering. To appear in Artificial Intelligence.
11. Littman, M., Cassandra, A., and Kaelbling, L. (1995). Learning policies for partially observable environments: Scaling up. Technical Report CS-95-11, Brown University, Department of Computer Science, Providence RI.
12. Littman, M. L. (1994). The Witness algorithm: Solving partially observable Markov decision processes. Technical Report CS-94-40, Brown University, Department of Computer Science, Providence, RI.
13. Lovejoy, W. S. (1991). A survey of algorithmic methods for partially observable Markov decision processes. Annals of Operations Research, 28:47-66.
14. McCallum, R. A. (1992). First results with utile distinction memory for reinforcement learning. Technical Report 446, Dept. Comp. Sei., Univ. Rochester. See also Proceedings of Machine Learning Conference 1993.
15. Moore, A. W. (1994). The parti-game algorithm for variable resolution reinforcement learning in multidimensional state spaces. In Advances in Neural Information Processing Systems 6, San Mateo, CA. Morgan Kaufmann.
16. Nicholson, A. and Kaelbling, L. P. (1994). Toward approximate planning in very large stochastic domains. In Proceedings of the AAAI Spring Symposium on Decision Theoretic Planning, Stanford, California.
17. Papadimitriou, C. H. and Tsitsiklis, J. N. (1987). The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-450.
18. Parr, R. and Russell, S. (1995). Approximating optimal policies for partially observable stochastic domains. In Proceedings of the International Joint Conference on Artificial Intelligence.
19. Puterman, M. L. (1994). Markov Decision Processes- Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY.
20. Ross, S. M. (1983). Introduction to Stochastic Dynamic Programming. Academic Press, New York.
21. Rumelhart, D. E., Hinton, G. E., and Williams, R. J. (1986). Learning internal representations by error backpropagation. In Rumelhart, D. E. and McClelland, J. L., editors, Parallel Distributed Processing: Explorations in the microstructures of cognition. Volume 1: Foundations, chapter 8. The MIT Press, Cambridge, MA.
22. Russell, S. J. and Norvig, P. (1994). Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ.
23. Smallwood, R. D. and Sondik, E. J. (1973). The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088.
24. Sondik, E. J. (1978). The optimal control of partially observable Markov processes over the infinite horizon: Discounted costs. Operations Research, 26(2).
25. Tsitsikilis, J. N. (1994). Asynchronous stohcastic aproximation and Q-learning. Machine Learning, 16(3).
26. Watkins, C. J. (1989). Learning with Delayed Rewards. PhD thesis, Cambridge University.
27. Williams, R. J. and Baird, L. C. I. (1993). Tight performance bounds on greedy policies based on imperfect value functions. Technical Report NUCCS- 93-13, Northeastern University, College of Computer Science, Boston, MA.