Constraint reasoning with learning automata
Francesco Ricci⋆ · International Journal of Intelligent Systems · 1994
This article presents a decision-maker model, called learning automaton, exhibiting adaptive behavior in highly uncertain stochastic environments. This learning model is used in solving constraint satisfaction problems (CSPs) by a procedure that can be viewed as hill climbing in probability space. the use of a fast learning algorithm that relaxes previous common assumptions is investigated. It is proven that the algorithm converges with probability 1 to a solution of the CSP and a set of test problems show that good performance can be achieved. In particular, it is shown that this method achieves a higher level of performance than that presented in a previous similar approach. Finally, it is estimated the speedup of a parallel implementation and the proposed algorithm is compared with a backtracking algorithm enhanced with standard CSP techniques. © 1994 John Wiley & Sons, Inc.