By Topic

Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hamid Beigy ; Dept. of Comput. Eng., Sharif Univ. of Technol., Tehran, Iran ; Mohammad Reza Meybodi

The cellular learning automaton (CLA), which is a combination of cellular automaton (CA) and learning automaton (LA), is introduced recently. This model is superior to CA because of its ability to learn and is also superior to single LA because it is a collection of LAs which can interact with each other. The basic idea of CLA is to use LA to adjust the state transition probability of stochastic CA. Recently, various types of CLA such as synchronous, asynchronous, and open CLAs have been introduced. In some applications such as cellular networks, we need to have a model of CLA for which multiple LAs reside in each cell. In this paper, we study a CLA model for which each cell has several LAs. It is shown that, for a class of rules called commutative rules, the CLA model converges to a stable and compatible configuration. Two applications of this new model such as channel assignment in cellular mobile networks and function optimization are also given. For both applications, it has been shown through computer simulations that CLA-based solutions produce better results.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)  (Volume:40 ,  Issue: 1 )