Tabu Search Exploration for on-Policy Reinforcement Learning

Proceedings of the International Joint Conference on Neural Networks

Volumn 4, Issue , 2003, Pages 2910-2915

  Abramson, Myriam ^a   Wechsler, Harry ^b  

^a GEORGE MASON UNIVERSITY   (United States)

^b George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; LEARNING ALGORITHMS; PROBLEM SOLVING; VECTOR QUANTIZATION;

TABU SEARCH (TS) EXPLORATION;

LEARNING SYSTEMS;

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

References (20)

1. M. Abramson and H. Wechsler, Competitive reinforcement learning for combinatorial problems. In International Joint Conference on Neural Networks, 2001.
2. F. A. Dahl. Honte, a go-playing program using neural nets. In Workshop on Machine learning in Game Playing, 1999.
3. P. Dayan. The convergence of td(lambda) for general lambda. Machine Learning, (8):341-362, 1992.
4. P. Dayan and T. J. Sejnowski. Td(lambda) converges with probability 1. Machine Learning, (14):295-301, 1994.
5. G. DeJong. Hidden strengths and limitations: an empirical investigation of reinforcement learning. In International Conference on Machine Learning. Morgan Kaufmann, 2000.
6. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
7. A. Hertz and D. de Werra. The tabu search metaheuristic: how we use it. Annals of Mathematics and Artificial Intelligence, 1:111-121, 1990.
8. J. H. Holland. Adaptation in Natural and Artificial Systems. MIT Press, 2nd edition, 1992.
9. S. Koenig and R. G. Simmons. The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithm. Machine Learning, 22:227-250, 1996.
10. T. Kohonen. Self-Organizing Maps. Springer, 2nd edition, 1997.
11. D. Lichtenstein and M. Sipser. Go is polynominal-space hard. Journal of the Association for Computing Machinery, 27(2):393-401, 1980.
12. G. A. Rummery and M. Niranjan. On-line q-learning using connectionist systems. Technical report, Cambridge University Engineering Dept., 1994.
13. S. Santini and R. Jain. Similarity measures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9), 1999.
14. S. Singh, T. Jaakkola, M. L. Littman, and Csaba Szepesvari. Convergence results for single-step on-policy reinforcement learning algorithms. Machine Learning, 38(3):287-308, 2000.
15. J. E. R. Staddon and R. H. Ettinger. An Introduction to the Principles of Adaptive Behavior. Harcourt Brace Jovanovich, 1989.
16. R. S. Sutton and A. Barto. Reinforcement Learning: an Introduction. MIT Press, Cambridge, MA, 1998.
17. S. B. Thrun. Efficient exploration in reinforcement learning. Technical Report TR CMU-CS-92-102, Carnegie Mellon University, 1992.
18. C. Watkins. Learning from Delayed Rewards. PhD thesis, King's College, 1989.
19. C. Watkins and P. Dayan. Q-learning. Machine Learning, (8):279-292, 1992.
20. L. Zobrist. Feature Extraction and Representation for Pattern Recognition and the Game of Go. PhD thesis, University of Wisconsin, 1970.