Affordable Access

An Estimator Algorithm For Learning Automata With Changing Number Of Actions

Taylor and Francis Group
Publication Date
  • Electrical Engineering
  • Computer Science
  • Design


In many problems of decision making under uncertainty the system has to acquire knowledge of its environment and learn the optimal decision through its experience. Such problems may also involve the system having to arrive at the globally optimal decision, when at each instant only a subset of the entire set of possible alternatives is available. These problems can be successfully modelled and analysed by learning automata. In this paper an estimator learning algorithm, which maintains estimates of the reward characteristics of the random environment, is presented for an automaton with changing number of actions. A learning automaton using the new scheme is shown to be e-optimal. The simulation results demonstrate the fast convergence properties of the new algorithm. The results of this study can be extended to the design of other types of estimator algorithms with good convergence properties.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times