Abstract
Learning automaton (LA) as one of computational intelligence techniques is a stochastic model operating in the framework of the reinforcement learning. LA has been found to be a useful tool for solving many complex and real world problems where a large amount of uncertainty exists or there is no access to the whole information regarding the environment. In this chapter, learning automaton and its variant models will be introduced. Also, recent models for learning automata including distributed learning automata and extended distributed learning automata will be presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Rezvanian, A., Saghiri, A.M., Vahidipour, S.M., Esnaashari, M., Meybodi, M.R. (2018). Learning Automata Theory. In: Recent Advances in Learning Automata. Studies in Computational Intelligence, vol 754. Springer, Cham. https://doi.org/10.1007/978-3-319-72428-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-72428-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72427-0
Online ISBN: 978-3-319-72428-7
eBook Packages: EngineeringEngineering (R0)