Generalized pursuit learning schemes: new families of continuous and discretized learning automata
- 10 December 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Vol. 32 (6), 738-749
- https://doi.org/10.1109/tsmcb.2002.1049608
Abstract
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry (1986). The pioneering work of these authors was the pursuit algorithm, which pursues only the current estimated optimal action. If this action is not the one with the minimum penalty probability, this algorithm pursues a wrong action. In this paper, we argue that a pursuit scheme that generalizes the traditional pursuit algorithm by pursuing all the actions with higher reward estimates than the chosen action, minimizes the probability of pursuing a wrong action, and is a faster converging scheme. To attest this, we present two new generalized pursuit algorithms (GPAs) and also present a quantitative comparison of their performance against the existing pursuit algorithms. Empirically, the algorithms proposed here are among the fastest reported LA to date.Keywords
This publication has 39 references indexed in Scilit:
- Adaptation of parameters of BP algorithm using learning automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Continuous learning automata solutions to the capacity assignment problemIEEE Transactions on Computers, 2000
- On-line PID tuning for engine idle-speed control using continuous action reinforcement learning automataControl Engineering Practice, 2000
- Self-adaptive TDMA protocols for WDM star networks: a learning-automata-based approachIEEE Photonics Technology Letters, 1999
- Distributed scheduling using simple learning machinesEuropean Journal of Operational Research, 1998
- Multiple response learning automataIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Hierarchical discretized pursuit nonlinear learning automata with rapid convergence and high accuracyIEEE Transactions on Knowledge and Data Engineering, 1994
- A new approach to the design of reinforcement schemes for learning automata: stochastic estimator learning algorithmsIEEE Transactions on Knowledge and Data Engineering, 1994
- Learning Algorithms Theory and ApplicationsPublished by Springer Science and Business Media LLC ,1981
- An application of the stochastic automaton to the investment gameInternational Journal of Systems Science, 1980