Approximating Optimal Policies for Partially Observable Stochastic Domains

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1995, Pages 1088-1094

  Parr, Ronald ^a   Russell, Stuart ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MARKOV PROCESSES; REINFORCEMENT LEARNING; STOCHASTIC SYSTEMS;

APPROXIMATION METHODS; COURSE OF ACTION; EXACT ALGORITHMS; MARKOV DECISION; OPTIMAL POLICIES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; STATE INFORMATION; STOCHASTIC DOMAINS; UNCERTAIN CONDITION; VALUE APPROXIMATION;

LIME;

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

References (15)

1. [Bellman 1957] Richard Ernest Bellman Dynamic Pro gramming Princeton University Press Princeton, New Jersey, 1957
2. [Cassandra et al 1994] A R Cassandra, L P Kaelbling andM L Littman Acting optimally in partially observable stochastic domains In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 94), pages 1023-1028 Seattle, Washington, August 1994 AAAI Press
3. [Chnsman 1992] LonnieChnsman Reinforcement learning with perceptual aliasing The perceptual distinctions approach In Proceedings of the Tenth Notional Conference on Artificial Intelligence (AAAI 92) pages 183-188 San Jose California, July 1992 AAAI Press
4. [Jaakolaefa/ in press] Tommi Jaakola, Satinder P Singh, and Michael I Jordan Reinforcement learning algorithm for partially observable Markov decision problems In Neural Information Processing Systems 7 to appear in press
5. ILin and Mitchell 19921 Long-Ji Lin and Tom M Mitchell Memory approaches lo reinforcement learning in nonMarkovian domains Technical report Computer Science Department Carnegie-Mellon University Pittsburgh Pennsylvania, 1992
6. [Littman et al , in press] Michael L Littman Anthony R Cassandra, and Leslie P Kaelbling Learning policies for partially observable environments Scaling up In Proceed ings of the Twelfth International Conference on Machine Learning to appear, in press
7. [Littman 1994] Michael L Littman The witness algorithm Solving partially observable Markov decision processes Technical report Computer Science Department Brown University Providence Rhode Island, 1994
8. [Lovejoy, 1991] W S Lovejoy A survey of algonthmic methods for partially observed Markov decision processes Annals of Operations Research 28(1-4)47-.66 Apnl 1991
9. [Martinetz et al 1993] Thomas. M Martinetz, Sta.nislav G Berkovich and Klaus J Schullen neural gas' network for vector quantization and its application Lo lime series prediction IEEE Transactions on Neural Networks SSC 4 558-569 1993
10. [McCallum 1993] Andrew R McCallum Overcoming incomplete perception with utile distinction memory In Proceedings of the Tenth International Conference on Ma chine Learning pages 190-196 Amherst Massachusetts, July 1993 Morgan Kaufmann
11. [Russell and Norvig 1994] Stuart J Russell and Peter Norvig Artificial Intelligence A Modern Approach Prentice-Hall Englewood Chffs, New Jersey, 1994
12. [Russell et al 1994] Sluart J Russell, John Binder and Daphne Koller Adaptive probabilistic networks Technical Report UCB/CSD-94-824 Computer Science Division, University of California al Berkeley, July 24 1994
13. [Sondik, 1971] E J Sondik The Optimal Control of Partially Observable Markov Decision Processes PhD thesis Stanford University, Stanford California, 1971
14. [Sutton, 1988] R S Sutton Learning to predict by the methods of temporal differences Machine Learning, 3 9-44, August 1988
15. [Watkins 1989] C J Watkins Models of Delayed Reinforcement Learning PhD thesis, Psychology Department, Cambndge University, Cambridge, United Kingdom 1989