Algorithms for Distributed Constraint Satisfaction: A Review

When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Various application problems in multi-agent systems can be formalized as distributed CSPs. This paper gives an overview of the existing research on distributed CSPs. First, we briefly describe the problem formalization and algorithms of normal, centralized CSPs. Then, we show the problem formalization and several MAS application problems of distributed CSPs. Furthermore, we describe a series of algorithms for solving distributed CSPs, i.e., the asynchronous backtracking, the asynchronous weak-commitment search, the distributed breakout, and distributed consistency algorithms. Finally, we show two extensions of the basic problem formalization of distributed CSPs, i.e., handling multiple local variables, and dealing with over-constrained problems.

[1]  M. Yokoo,et al.  Distributed Constraint Satisfaction for DAI Problems , 1990 .

[2]  Rowland R. Johnson,et al.  DATMS: A Framework for Distributed Assumption Based Reasoning , 1989, Distributed Artificial Intelligence.

[3]  Christophe Lecoutre.  Constraint Networks , 1992 .

[4]  Makoto Yokoo.  Constraint relaxation in distributed constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[5]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[6]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[7]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[8]  Edmund H. Durfee,et al.  Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems , 1997, AAAI/IAAI.

[9]  Khaled Ghédira,et al.  A Distributed Approach to Partial Constraint Satisfaction Problems , 1994, MAAMAW.

[10]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[11]  Norman M. Sadeh,et al.  Distributed constrained heuristic search , 1991, IEEE Trans. Syst. Man Cybern..

[12]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[13]  Katia Sycara,et al.  Multiagent coordination in tightly coupled task scheduling , 1997 .

[14]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[15]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[16]  Michael N. Huhns,et al.  Multiagent truth maintenance , 1991, IEEE Trans. Syst. Man Cybern..

[17]  Khaled Ghédira,et al.  A Multi-Agent Model for the Resource Allocation Problem: A Reactive Approach , 1992, ECAI.

[18]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[19]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[20]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[21]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[22]  Victor R. Lesser,et al.  Multistage negotiation for distributed constraint satisfaction , 1991, IEEE Trans. Syst. Man Cybern..

[23]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[24]  Ying Zhang,et al.  Parallel and distributed algorithms for finite constraint satisfaction problems , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[25]  Patrick Prosser,et al.  A constraint maintenance system for the distributed resource allocation problem , 1992 .

[26]  Ehud Gudes,et al.  Solving a Real-life Time Tabling and Transportation Problem Using Distributed CSP Techniques. , 1997 .

[27]  Makoto Yokoo,et al.  Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems , 1995, CP.

[28]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[29]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

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