This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms. This volume also provides a fine guide for independent study and a reference for students and professionals in operations research, computer science, artificial intelligence, and robotics. The authors have provided a new preface for this edition.

This book collects recent theoretical advances and concrete applications of learning automata (LAs) in various areas of computer science, presenting a broad treatment of the computer science field in a survey style. Learning automata (LAs) have proven to be effective decision-making agents, especially within unknown stochastic environments. The book starts with a brief explanation of LAs and their baseline variations. It subsequently introduces readers to a number of recently developed, complex structures used to supplement LAs, and describes their steady-state behaviors. These complex structures have been developed because, by design, LAs are simple units used to perform simple tasks; their full potential can only be tapped when several interconnected LAs cooperate to produce a group synergy. In turn, the next part of the book highlights a range of LA-based applications in diverse computer science domains, from wireless sensor networks, to peer-to-peer networks, to complex social networks, and finally to Petri nets. The book accompanies the reader on a comprehensive journey, starting from basic concepts, continuing to recent theoretical findings, and ending in the applications of LAs in problems from numerous research domains. As such, the book offers a valuable resource for all computer engineers, scientists, and students, especially those whose work involves the reinforcement learning and artificial intelligence domains.

The problem of inducing, learning or inferring grammars has been studied for decades, but only in recent years has grammatical inference emerged as an independent field with connections to many scientific disciplines, including bio-informatics, computational linguistics and pattern recognition. This book meets the need for a comprehensive and unified summary of the basic techniques and results, suitable for researchers working in these various areas. In Part I, the objects of use for grammatical inference are studied in detail: strings and their topology, automata and grammars, whether probabilistic or not. Part II carefully explores the main questions in the field: What does learning mean? How can we associate complexity theory with learning? In Part III the author describes a number of techniques and algorithms that allow us to learn from text, from an informant, or through interaction with the environment. These concern automata, grammars, rewriting systems, pattern languages or transducers.

Networks of Learning Automata: Techniques for Online Stochastic Optimization is a comprehensive account of learning automata models with emphasis on multiautomata systems. It considers synthesis of complex learning structures from simple building blocks and uses stochastic algorithms for refining probabilities of selecting actions. Mathematical analysis of the behavior of games and feedforward networks is provided. Algorithms considered here can be used for online optimization of systems based on noisy measurements of performance index. Also, algorithms that assure convergence to the global optimum are presented. Parallel operation of automata systems for improving speed of convergence is described. The authors also include extensive discussion of how learning automata solutions can be constructed in a variety of applications.

This self-contained introductorytext on the behavior of learningautomata focuses on howa sequential decision-makerwith a finite number of choiceswould respond in a random environment. A must for all studentsof stochastic algorithms, this treatment is the workof two well-known scientists, one of whom provides a newIntroduction.Reprint of the Prentice-Hall, Inc, Englewood Cliffs, NewJersey, 1989 edition.

This book highlights both theoretical and applied advances in cellular learning automata (CLA), a type of hybrid computational model that has been successfully employed in various areas to solve complex problems and to model, learn, or simulate complicated patterns of behavior. Owing to CLA’s parallel and learning abilities, it has proven to be quite effective in uncertain, time-varying, decentralized, and distributed environments. The book begins with a brief introduction to various CLA models, before focusing on recently developed CLA variants. In turn, the research areas related to CLA are addressed as bibliometric network analysis perspectives. The next part of the book presents CLA-based solutions to several computer science problems in e.g. static optimization, dynamic optimization, wireless networks, mesh networks, and cloud computing. Given its scope, the book is well suited for all researchers in the fields of artificial intelligence and reinforcement learning.

This book is devoted to the leading research in applying learning automaton (LA) and heuristics for solving benchmark and real-world optimization problems. The ever-increasing application of the LA as a promising reinforcement learning technique in artificial intelligence makes it necessary to provide scholars, scientists, and engineers with a practical discussion on LA solutions for optimization. The book starts with a brief introduction to LA models for optimization. Afterward, the research areas related to LA and optimization are addressed as bibliometric network analysis. Then, LA's application in behavior control in evolutionary computation, and memetic models of object migration automata and cellular learning automata for solving NP hard problems are considered. Next, an overview of multi-population methods for DOPs, LA's application in dynamic optimization problems (DOPs), and the function evaluation management in evolutionary multi-population for DOPs are discussed. Highlighted benefits • Presents the latest advances in learning automata-based optimization approaches. • Addresses the memetic models of learning automata for solving NP-hard problems. • Discusses the application of learning automata for behavior control in evolutionary computation in detail. • Gives the fundamental principles and analyses of the different concepts associated with multi-population methods for dynamic optimization problems.