Parallel Distributed Constraint Satisfaction.
Marko Fabiunke · 1999
A parallel distributed framework to solve constraint satisfaction problems based on connectionist ideas of distributed information processing is presented. In this approach, each variable of a given problem is associated with a simple agent continuously applying a variable manipulation rule in the spirit of local conflict minimization to satisfy all constraints this variable is involved in. All agents are working simultaneously forming together a recurrent dynamical system which should selforganize after some iterations to a feasible problem solution. We investigate whether and how manipulation rules can be chosen such that the whole process converges without coordinating agent activities. Keywords: constraint satisfaction problems, local search, parallel distributed processing 1 Introduction Constraint satisfaction is a problem which appears in many real-life situations and has received a great deal of attention in recent years. Many AI problems of theoretical and practical interest...