Reinforcement learning of optimal controls

Artificial Intelligence Methods in the Environmental Sciences

Volumn , Issue , 2009, Pages 297-327

  Williams, John K ^a  

^a NATIONAL CENTER FOR ATMOSPHERIC RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84860531726     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4020-9119-3_15     Document Type: Chapter

References (37)

1. Atlas, D. (1982). Adaptively pointing spacebome radar for precipitation measurements. Journal of Applied Meteorology, 21, 429-443.
2. Baird, L. C. (1995). Residual algorithms: Reinforcement learning with function approximation. In A. Prieditis & S. J. Russell (Eds.), Proceedings of the Twelfth International Conference on Machine Learning (pp. 30-37). 9-12 July 1995. Tahoe City, CA/San Francisco: Morgan Kaufmann.
3. Baxter, J., & Bartlett, P. L. (2000). Reinforcement learning in POMDP via direct gradient ascent. Proceedings of the 17th International Conference on Machine Learning (pp. 41-48). 29 June-2 July 2000. Stanford, CA/San Francisco: Morgan Kaufmann.
4. Bellman, R. E. (1957). Dynamic programming (342 pp.). Princeton, NJ: Princeton University Press.
5. Bertsekas, D. P. (1995). Dynamic programming and optimal control (Vol. 1, Vol. 2, 387 pp., 292 pp.). Belmont, MA: Athena Scientific.
6. Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-dynamic programming (491 pp.). Belmont, MA: Athena Scientific.
7. Bertsimas, D., & Patterson, S. S. (1998). The air traffic flow management problem with enroute capacities. Operations Research, 46, 406-422. (Pubitemid 128655441)
8. Chrisman, L. (1992). Reinforcement learning with perceptual aliasing: The perceptual distinctions approach. Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 183-188). 12-16 July 1992. San Jose/Menlo Park, CA: AAAI Press. (Pubitemid 23633590)
9. Dayan, P., & Sejnowski, T. (1994). TD(0) converges with probability 1. Machine Learning, 14, 295-301.
10. Evans, J. E., Weber, M. E., & Moser, W. R. (2006). Integrating advanced weather forecast technologies into air traffic management decision support. Lincoln Laboratory Journal, 16, 81-96.
11. Hamilton, W. R. (1835). Second essay on a general method in dynamics. Philosophical Transactions of the Royal Society, Part I for 1835, 95-144.
12. Jaakkola, T., Jordan, M., & Singh, S. (1994). On the convergence of stochastic iterative dynamic programming algorithms. Neural Computation, 6, 1185-1201.
13. Jaakkola, T., Singh, S., & Jordan, M. (1995). Reinforcement learning algorithm for partially observable Markov decision problems. In G. Tesauro, D. S. Touretzky, & T. Leen (Eds.), Advances in neural information processing systems: Proceedings of the 1994 Conference (pp. 345-352). Cambridge, MA: MIT Press.
14. Joint Planning and Development Office (JPDO). (2006). Next generation air transportation system (NGATS)-weather concept of operations (30 pp.). Washington, DC: Weather Integration Product Team.
15. Krozel, J., Andre, A. D. & Smith, P. (2006). Future air traffic management requirements for dynamic weather avoidance routing. Preprints, 25th Digital Avionics Systems Conference (pp. 1-9). October 2006. Portland, OR: IEEE/AIAA.
16. Kushner, H. J., & Yin, G. G. (1997). Stochastic approximation algorithms and applications (417 pp.). New York: Springer.
17. Lovejoy, W. S. (1991). A survey of algorithmic methods for partially observable Markov decision processes. Annals of Operations Research, 28, 47-66.
18. McLaughlin, D. J., Chandrasekar, V., Droegemeier, K., Frasier, S., Kurose, J., Junyent, F., et al. (2005). Distributed Collaborative Adaptive Sensing (DCAS) for improved detection, understanding, and prediction of atmospheric hazards. Preprints-CD, AMS Ninth Symposium on Integrated Observing and Assimilation Systems for the Atmosphere, Oceans, and Land Surface. 10-13 January 2005. Paper 11.3. San Diego, CA.
19. Myers, W. L. (2000). Effects of visual representations of dynamic hazard worlds on human navigational performance. Ph.D. thesis, Department of Computer Science, University of Colorado, 64 pp.
20. Peng, J., & Williams, R. J. (1996). Incremental multi-step Qlearning. Machine Learning, 22, 283-290.
21. Precup, D., Sutton, R. S., & Dasgupta, S. (2001). Off-policy temporal-difference learning with function approximation. In C. E. Brodley and A. P. Danylok (Eds.), Proceedings of the 18th International Conference on Machine Learning (pp. 417-424). 28 June-1 July 2001.Williamstown, MA/San Francisco, CA: Morgan Kaufmann.
22. Puterman, M. L. (2005). Markov decision processes: Discrete stochastic dynamic programming (649 pp.). Hoboken, NJ: Wiley Interscience.
23. Robbins, H., & Monro, S. (1951). A stochastic approximation method. Annals of Mathematical Statistics, 22, 400-407.
24. Samuel, A. L. (1959). Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3, 211-229.
25. Si, J., Barto, A. G., Powell,W. B., &Wunsch, D. (Eds.). (2004). Handbook of learning and approximate dynamic programming (644 pp.). Piscataway, NJ: Wiley-Interscience.
26. Singh, S. P., & Sutton, R. S. (1996). Reinforcement learning with replacing eligibility traces. Machine Learning, 22, 123-158. (Pubitemid 126724365)
27. Singh, S. P., Jaakkola, T., Littman, M. L., & Szepasvari, C. (2000). Convergence results for single-step on-policy reinforcement-learning algorithms. Machine Learning, 38, 287-308. (Pubitemid 30572449)
28. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction (322 pp.). Cambridge, MA: MIT Press.
29. Tadic, V. (2001). On the convergence of temporal-difference learning with linear function approximation. Machine Learning, 42, 241-267. (Pubitemid 32188797)
30. Tsitsiklis, J. N. (2002). On the convergence of optimistic policy iteration. Journal of Machine Learning Research, 3, 59-72.
31. Tsitsiklis, J. N., & Van Roy, B. (1997). An analysis of temporal-difference learning with function approximation. IEEE Transactions on Automatic Control, 42, 674-690. (Pubitemid 127760263)
32. Turing, A. M. (1948). Intelligent machinery, National Physical Laboratory report. In D. C. Ince (Ed.). 1992, Collected works of A. M. Turing: Mechanical intelligence (227 pp.). New York: Elsevier Science.
33. Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433-460.
34. Watkins, C. J. C. H. (1989). Learning from delayed rewards. Ph.D. thesis, King's College, Cambridge University, Cambridge, 234 pp.
35. Watkins, C. J. C. H., & Dayan, P. (1992). Q-learning. Machine Learning, 8, 279-292.
36. Williams, J. K. (2000). On the convergence of model-free policy iteration algorithms for reinforcement learning: Stochastic approximation under discontinuous mean dynamics. Ph.D. thesis, Department of Mathematics, University of Colorado, Colorado, 173 pp.
37. Williams, J. K., & Singh, S. (1999). Experimental results on learning stochastic memoryless policies for partially observable Markov decision processes. In M. S. Kearns, S. A. Solla, and D. A. Cohn (Eds.), Advances in neural information processing systems 11. Proceedings of the 1998 Conference (pp. 1073-1079). Cambridge, MA: MIT Press.