Continuous and discretized pursuit learning schemes: Various algorithms and their comparison

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 31, Issue 3, 2001, Pages 277-287

  John Oommen, B ^a,b   Agache, Mariana ^c  

^a IEEE   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c NORTEL NETWORKS   (Canada)

Author keywords

Adaptive learning; Estimator based algorithm; Learning automata

Indexed keywords

STOCHASTIC LEARNING PROBLEMS;

BENCHMARKING; COMPUTATIONAL METHODS; COMPUTER SIMULATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PHILOSOPHICAL ASPECTS; PROBLEM SOLVING;

AUTOMATA THEORY;

EID: 0035359274     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.931507     Document Type: Article

References (26)

1. An application of stochastic automata to the investment game
2. Two person decentralized team with incomplete information
3. Absolutely expedient algorithms for stochastic automata
4. Discretized estimator learning automata
5. Learning automata: A critique
6. Learning automata - A survey
7. On the behavior of a learning automata in a changing environment with routing applications
8. Applications of learning automata to telephone traffic routing
9. Absorbing and ergodic discretized two-action learning automata
10. Epsilon-optimal discretized reward-penalty learning automata
11. The asymptotic optimality of discretized linear reward-inaction learning automata
12. Discretized pursuit learning automata
13. Deterministic learning automata solutions to the equipartitioning problem
14. Fast object partitioning using stochastic learning automata
15. Multiaction learning automata possessing ergodicity of the mean
16. Discretized reward-inaction learning automata
17. A class of rapidly converging algorithms for learning automata
18. Estimator algorithms for learning automata
19. On the behavior of finite automata in random media
20. On the behavior of stochastic automata with variable structure