{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:23:54Z","timestamp":1742941434828,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030870485"},{"type":"electronic","value":"9783030870492"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-87049-2_2","type":"book-chapter","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T05:04:20Z","timestamp":1646283860000},"page":"33-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comprehensive Survey of\u00a0Estimator Learning Automata and\u00a0Their Recent Convergence Results"],"prefix":"10.1007","author":[{"given":"B.","family":"John\u00a0Oommen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"2_CR1","unstructured":"Agache, M.: Estimator Based Learning Algorithms. M.C.S. Thesis, School of Computer Science, Carleton University, Ottawa, Ontario, Canada (2000)"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1109\/TSMCB.2002.1049608","volume":"32","author":"M Agache","year":"2002","unstructured":"Agache, M., Oommen, B.J.: Generalized pursuit learning schemes: new families of continuous and discretized learning Automata. IEEE Trans. Syst. Man Cybern. Part B 32(6), 738\u2013749 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S1389-1286(00)00090-6","volume":"34","author":"AF Atlassis","year":"2000","unstructured":"Atlassis, A.F., Loukas, N.H., Vasilakos, A.V.: The use of learning algorithms in ATM networks call admission control problem: a methodology. Comput. Netw. 34, 341\u2013353 (2000)","journal-title":"Comput. Netw."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Atlassis, A.F., Vasilakos, A.V.: The use of reinforcement learning algorithms in traffic control of high speed networks. Advances in Computational Intelligence and Learning, pp. 353\u2013369 (2002)","DOI":"10.1007\/978-94-010-0324-7_25"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Beigy, H., Meybodi, M.R.: Adaptation of parameters of BP algorithm using learning automata. In: Proceedings of Sixth Brazilian Symposium on Neural Networks. JR, Brazil, pp. 24\u201331 (2000)","DOI":"10.1109\/SBRN.2000.889708"},{"key":"2_CR6","first-page":"81","volume":"18","author":"T Dean","year":"1995","unstructured":"Dean, T., Angluin, D., Basye, K., Engelson, S., Aelbling, L., Maron, O.: Inferring finite automata with stochastic output functions and an application to map learning. Mach. Learn. 18, 81\u2013108 (1995)","journal-title":"Mach. Learn."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10489-006-0034-y","volume":"27","author":"G Erus","year":"2007","unstructured":"Erus, G., Polat, F.: A layered approach to learning coordination knowledge in multiagent environments. Appl. Intell. 27, 249\u2013267 (2007)","journal-title":"Appl. Intell."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TC.2009.189","volume":"59","author":"OC Granmo","year":"2010","unstructured":"Granmo, O.C.: Solving stochastic nonlinear resource allocation problems using a hierarchy of twofold resource allocation automata. IEEE Trans. Comput. 59(4), 545\u2013560 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10489-012-0346-z","volume":"38","author":"OC Granmo","year":"2013","unstructured":"Granmo, O.C., Glimsdal, S.: Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore game. Appl. Intell. 38, 479\u2013488 (2013)","journal-title":"Appl. Intell."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Granmo, O.C., Oommen, B.J.: On allocating limited sampling resources using a learning automata-based solution to the fractional knapsack problem. In: Proceedings of the 2006 International Intelligent Information Processing and Web Mining Conference, Advances in Soft Computing, vol.\u00a035, Ustron, Poland, pp. 263\u2013272 (2006)","DOI":"10.1007\/3-540-33521-8_26"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10489-010-0228-1","volume":"33","author":"OC Granmo","year":"2010","unstructured":"Granmo, O.C., Oommen, B.J.: Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem. Appl. Intell. 33(1), 3\u201320 (2010)","journal-title":"Appl. Intell."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"OC Granmo","year":"2007","unstructured":"Granmo, O.C., Oommen, B.J., Myrer, S.A., Olsen, M.G.: Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation. IEEE Trans. Syst. Man Cybern. Part B 37(1), 166\u2013175 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58, 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/B:APIN.0000011143.95085.74","volume":"20","author":"J Hong","year":"2004","unstructured":"Hong, J., Prabhu, V.V.: Distributed reinforcement learning control for batch sequencing and sizing in just-in-time manufacturing systems. Appl. Intell. 20, 71\u201387 (2004)","journal-title":"Appl. Intell."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Kabudian, J., Meybodi, M.R., Homayounpour, M.M.: Applying continuous action reinforcement learning automata (CARLA) to global training of hidden markov models. In: Proceedings of ITCC\u201904, the International Conference on Information Technology: Coding and Computing, Las Vegas, Nevada, 2004, pp. 638\u2013642","DOI":"10.1109\/ITCC.2004.1286725"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Lakshmivarahan, S.: Learning Algorithms Theory and Applications. Springer (1981)","DOI":"10.1007\/978-1-4612-5975-6"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Lanctot, J.K., Oommen, B.J.: On discretizing estimator-based learning algorithms. IEEE Trans. on Systems, Man, and Cybernetics, Part B: Cybernetics 2, 1417\u20131422 (1991)","DOI":"10.1109\/ICSMC.1991.169887"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Lanctot, J.K., Oommen, B.J.: Discretized estimator learning automata. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 22(6), 1473\u20131483 (1992)","DOI":"10.1109\/21.199471"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10489-009-0191-x","volume":"34","author":"J Li","year":"2011","unstructured":"Li, J., Li, Z., Chen, J.: Microassembly path planning using reinforcement learning for improving positioning accuracy of a $$1~cm^3$$ omni-directional mobile microrobot. Appl. Intell. 34, 211\u2013225 (2011)","journal-title":"Appl. Intell."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S012906570200090X","volume":"12","author":"MR Meybodi","year":"2002","unstructured":"Meybodi, M.R., Beigy, H.: New learning automata based algorithms for adaptation of backpropagation algorithm parameters. Int. J. Neural Syst. 12, 45\u201367 (2002)","journal-title":"Int. J. Neural Syst."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1002\/dac.684","volume":"17","author":"S Misra","year":"2004","unstructured":"Misra, S., Oommen, B.J.: GPSPA?: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks. Int. J. Commun. Syst. 17, 963\u2013984 (2004)","journal-title":"Int. J. Commun. Syst."},{"key":"2_CR22","volume-title":"Learning Automata: Theory and Applications","author":"K Najim","year":"1994","unstructured":"Najim, K., Poznyak, A.S.: Learning Automata: Theory and Applications. Pergamon Press, Oxford (1994)"},{"key":"2_CR23","unstructured":"Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice Hall (1989)"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TSMCB.2002.1049615","volume":"32","author":"MS Obaidat","year":"2002","unstructured":"Obaidat, M.S., Papadimitriou, G.I., Pomportsis, A.S., Laskaridis, H.S.: Learning automata-based bus arbitration for shared-medium ATM switches. IEEE Trans. Syst. Man Cybern. Part B 32, 815\u2013820 (2002)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Oommen, B.J.: Stochastic searching on the line and its applications to parameter learning in nonlinear optimization. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 27(4), 733\u2013739 (1997)","DOI":"10.1109\/3477.604122"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Oommen, B.J., Granmo, O.C., Pedersen, A.: Using stochastic AI techniques to achieve unbounded resolution in finite player Goore Games and its applications. In: Proceedings of IEEE Symposium on Computational Intelligence and Games, Honolulu, HI, pp. 161\u2013167 (2007)","DOI":"10.1109\/CIG.2007.368093"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/21.105092","volume":"20","author":"BJ Oommen","year":"1990","unstructured":"Oommen, B.J., Lanctot, J.K.: Discretized pursuit learning automata. IEEE Trans. Syst. Man Cybern. 20, 931\u2013938 (1990)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TSMC.1986.289265","volume":"16","author":"BJ Oommen","year":"1986","unstructured":"Oommen, B.J.: Absorbing and ergodic discretized two-action learning automata. IEEE Trans. Syst. Man Cybern. 16, 282\u2013296 (1986)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/3477.931507","volume":"31","author":"BJ Oommen","year":"2001","unstructured":"Oommen, B.J., Agache, M.: Continuous and discretized pursuit learning schemes: various algorithms and their comparison. IEEE Trans. Syst. Man Cybern. 31(3), 277\u2013287 (2001)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/12.485372","volume":"45","author":"BJ Oommen","year":"1996","unstructured":"Oommen, B.J., Croix, T.D.S.: Graph partitioning using learning automata. IEEE Trans. Comput. 45, 195\u2013208 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/12.862220","volume":"49","author":"BJ Oommen","year":"2000","unstructured":"Oommen, B.J., Roberts, T.D.: Continuous learning automata solutions to the capacity assignment problem. IEEE Trans. Comput. 49, 608\u2013620 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Papadimitriou, G.I., Pomportsis, A.S.: Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic. IEEE Commun. Lett. 107\u2013109 (2000)","DOI":"10.1109\/4234.831040"},{"key":"2_CR33","volume-title":"Learning Automata and Stochastic Optimization","author":"AS Poznyak","year":"1997","unstructured":"Poznyak, A.S., Najim, K.: Learning Automata and Stochastic Optimization. Springer, Berlin (1997)"},{"key":"2_CR34","unstructured":"Sastry, P.S.: Systems of Learning Automata: Estimator Algorithms Applications. Ph.D. Thesis, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India (1985)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Rajaraman, K., Sastry, P.S.: Finite time analysis of the pursuit algorithm for learning automata. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 26, 590\u2013598 (1996)","DOI":"10.1109\/3477.517033"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0377-2217(97)00342-1","volume":"107","author":"F Seredynski","year":"1998","unstructured":"Seredynski, F.: Distributed scheduling using simple learning machines. Eur. J. Oper. Res. 107, 401\u2013413 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2_CR37","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1239\/jap\/1346955334","volume":"49","author":"M Ryan","year":"2012","unstructured":"Ryan, M., Omkar, T.: On $$\\upvarepsilon $$-optimality of the pursuit learning algorithm. J. Appl. Probab. 49(3), 795\u2013805 (2012)","journal-title":"J. Appl. Probab."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Thathachar, M.A.L., Sastry, P.S.: A class of rapidly converging algorithms for learning automata. IEEE Trans. Syst. Man Cybern. SMC-15, 168\u2013175 (1985)","DOI":"10.1109\/TSMC.1985.6313407"},{"key":"2_CR39","unstructured":"Thathachar, M.A.L., Sastry, P.S.: Estimator algorithms for learning automata. In: Proceedings of the Platinum Jubilee Conference on Systems and Signal Processing, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, Dec 1986, pp. 29\u201332"},{"key":"2_CR40","volume-title":"Networks of Learning Automata?: Techniques for Online Stochastic Optimization","author":"MALT Thathachar","year":"2003","unstructured":"Thathachar, M.A.L.T., Sastry, P.S.: Networks of Learning Automata?: Techniques for Online Stochastic Optimization. Kluwer Academic, Boston (2003)"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/s10489-012-0351-2","volume":"37","author":"JA Torkestani","year":"2012","unstructured":"Torkestani, J.A.: An adaptive focused web crawling algorithm based on learning automata. Appl. Intell. 37, 586\u2013601 (2012)","journal-title":"Appl. Intell."},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/3468.736368","volume":"29","author":"C Unsal","year":"1999","unstructured":"Unsal, C., Kachroo, P., Bay, J.S.: Multiple stochastic learning automata for vehicle path control in an automated highway system. IEEE Trans. Syst. Man Cybern. Part A 29, 120\u2013128 (1999)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10489-011-0292-1","volume":"36","author":"R Vafashoar","year":"2012","unstructured":"Vafashoar, R., Meybodi, M.R., Momeni, A.A.H.: CLA-DE: a hybrid model based on cellular learning automata for numerical optimization. Appl. Intell. 36, 735\u2013748 (2012)","journal-title":"Appl. Intell."},{"key":"2_CR44","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TSMCC.2003.817354","volume":"33","author":"A Vasilakos","year":"2003","unstructured":"Vasilakos, A., Saltouros, M.P., Atlassis, A.F., Pedrycz, W.: Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques. IEEE Trans. Syst. Sci. Cybern. Part C 33, 297\u2013312 (2003)","journal-title":"IEEE Trans. Syst. Sci. Cybern. Part C"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10489-011-0280-5","volume":"36","author":"A Yazidi","year":"2012","unstructured":"Yazidi, A., Granmo, O.C., Oommen, B.J.: Service selection in stochastic environments: a learning-automaton based solution. Appl. Intell. 36, 617\u2013637 (2012)","journal-title":"Appl. Intell."},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, X., Granmo, O.C., Oommen, B.J.: The Bayesian pursuit algorithm: A new family of estimator learning automata. In: Proceedings of IEAAIE2011. pp. 608\u2013620. Springer, New York, USA (2011)","DOI":"10.1007\/978-3-642-21827-9_53"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, X., Granmo, O.C., Oommen, B.J.: Discretized Bayesian pursuit\u2014a new scheme for reinforcement learning. In: Proceedings of IEAAIE2012. Dalian, China, pp. 784\u2013793 (2012)","DOI":"10.1007\/978-3-642-31087-4_79"},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/s10489-013-0424-x","volume":"39","author":"X Zhang","year":"2013","unstructured":"Zhang, X., Granmo, O.C., Oommen, B.J.: On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata. Appl. Intell. 39, 782\u2013792 (2013)","journal-title":"Appl. Intell."},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, X., Granmo, O.C., Oommen, B.J., Jiao, L.: On using the theory of regular functions to prove the $$\\epsilon $$-optimality of the continuous pursuit learning automaton. In: Proceedings of IEAAIE2013, pp. 262\u2013271. Springer, Amsterdan, Holland (2013)","DOI":"10.1007\/978-3-642-38577-3_27"},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1007\/s10489-014-0541-1","volume":"41","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Granmo, O.C., Oommen, B.J., Jiao, L.: A formal proof of the $$\\upvarepsilon $$-optimality of absorbing continuous pursuit algorithms using the theory of regular functions. Appl. Intell. 41, 974\u2013985 (2014)","journal-title":"Appl. Intell."},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, X., Oommen, B.J., Granmo, O.C., Jiao, L.: Using the theory of regular functions to formally prove the $$\\epsilon $$-optimality of discretized pursuit learning algorithms. In: Proceedings of IEAAIE2014, pp. 379\u2013388. Springer, Kaohsiung, Taiwan (2014)","DOI":"10.1007\/978-3-319-07455-9_40"},{"key":"2_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0670-1","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Oommen, B.J., Granmo, O.C., Jiao, L.: A formal proof of the $$\\upvarepsilon $$-optimality of discretized pursuit algorithms. Appl. Intell. (2015). https:\/\/doi.org\/10.1007\/s10489-015-0670-1","journal-title":"Appl. Intell."},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, X., Oommen, B.J., Granmo, O.C.: The design of absorbing bayesian pursuit algorithms and the formal analyses of their $$\\epsilon $$-Optimality. Pattern Anal. Appl. 20(3) (2015)","DOI":"10.1007\/s10044-016-0535-1"}],"container-title":["Lecture Notes in Networks and Systems","Advances in Computing, Informatics, Networking and Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87049-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:00:10Z","timestamp":1726768810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87049-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030870485","9783030870492"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87049-2_2","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}