Constraint reasoning with learning automata

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.

[1]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[2]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[3]  Mark S. Boddy,et al.  Anytime Problem Solving Using Dynamic Programming , 1991, AAAI.

[4]  Janice M. Stone,et al.  Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..

[5]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. I. Problem representation , 1988, IEEE 1988 International Conference on Neural Networks.

[6]  Edward Tsang,et al.  Solving constraint satisfaction problems using neural networks , 1991 .

[7]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[8]  Mandayam A. L. Thathachar,et al.  Relaxation Labeling with Learning Automata , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .

[10]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[11]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[12]  Alan Borning,et al.  Constraint hierarchies , 1992 .

[13]  Bjørn N. Freeman-Benson,et al.  Constraint hierarchies , 1987, OOPSLA '87.

[14]  Hans W. Guesgen,et al.  Transforming Constraint Relaxation Networks into Boltzmann Machines , 1991, GWAI.

[15]  M. Norman.  Some convergence theorems for stochastic learning models with distance diminishing operators , 1968 .

[16]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[17]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[18]  Robert A. Hummel.  A Design Method for Relaxation Labeling Applications , 1983, AAAI.

[19]  J. March.  Decisions and Organizations , 1991 .

[20]  Steven Minton,et al.  Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method , 1990, AAAI.

[21]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[22]  Yoshiyasu Takefuji,et al.  Stochastic neural networks for solving job-shop scheduling. II. architecture and simulations , 1988, IEEE 1988 International Conference on Neural Networks.

[23]  James G. March,et al.  How Decisions Happen in Organizations , 1991, Hum. Comput. Interact..

[24]  B A Huberman,et al.  Cooperative Solution of Constraint Satisfaction Problems , 1991, Science.