Self Organising Maps for Value Estimation to Solve Reinforcement Learning Tasks

Download: Paper (pdf).

“Self Organising Maps for Value Estimation to Solve Reinforcement Learning Tasks” by A. Kleiner, B. Sharp, and O. Bittel. In Proc. of the 2nd International Conference on Enterprise Information Systems (ICEIS 2000), 2000, pp. 74-83.

Abstract

Reinforcement learning has been applied recently more and more for the optimisation of agent behaviours. This approach became popular due to its adaptive and unsupervised learning process. One of the key ideas of this approach is to estimate the value of agent states. For huge state spaces however, it is difficult to implement this approach. As a result, various models were proposed which make use of function approximators, such as neural networks, to solve this problem. This paper focuses on an implementation of value estimation with a particular class of neural networks, known as self organizing maps. Experiments with an agent moving in a gridworld and the autonomous robot Khepera have been carried out to show the benefit of our approach. The results clearly show that the conventional approach, done by an implementation of a look-up table to represent the value function, can be out performed in terms of memory usage and convergence speed.

Download: Paper (pdf).

BibTeX entry:

@inproceedings{kleiner_et_al_iceis00,
   author = {A. Kleiner and B. Sharp and O. Bittel},
   title = {Self Organising Maps for Value Estimation to Solve
	Reinforcement Learning Tasks},
   booktitle = {Proc. of the 2nd International Conference on Enterprise
	Information Systems (ICEIS 2000)},
   pages = {74--83},
   year = {2000},
   language = {en}
}

(This webpage was created with bibtex2web.)

Back to Publications.