By Topic

Discretized pursuit learning automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. J. Oommen ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; J. K. Lanctot

The problem of a stochastic learning automaton interacting with an unknown random environment is considered. The fundamental problem is that of learning, through interaction, the best action allowed by the environment (i.e. the action that is rewarded optimally). By using running estimates of reward probabilities to learn the optimal action, an extremely efficient pursuit algorithm (PA), which is presently among the fastest algorithms known, was reported in earlier works. The improvements gained by rendering the PA discrete are investigated. This is done by restricting the probability of selecting an action to a finite and, hence, discrete subset of [0, 1]. This improved scheme is proven to be ε-optimal in all stationary environments. Furthermore, the experimental results seem to indicate that the algorithm presented is faster than the fastest nonestimator learning automata reported to date, and also faster than the continuous pursuit automaton

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:20 ,  Issue: 4 )