The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results

For solving a distributed CSP by a distributed constraint satisfaction algorithm, since agents usually have intra-agent constraints (constraints which are defined over variables of one agent) and inter-agent constraints (constraints which are defined over variables of multiple agents), they have not only to perform local computation to satisfy their intra- and inter-agent constraints, but also to communicate with other agents to satisfy their inter-agent constraints. The efficiency of a distributed constraint satisfaction algorithm depends on its communication cost and computation cost, and both can vary with the numbers of intra- and inter-agents constraints. Therefore, it is important to know how the numbers of intra- and inter-agent constraints affect the communication and computation costs of a distributed constraint satisfaction algorithm because such an information may give us a hint to develop a more efficient distributed constraint satisfaction algorithm.

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

[2]  Barbara M. Smith.  The phase transition in constraint satisfaction problems: A closer look at the mushy region , 1994 .

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

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

[5]  Makoto Yokoo,et al.  The effect of nogood learning in distributed constraint satisfaction , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[6]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[7]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[8]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

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

[10]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

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

[12]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

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

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

[15]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

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

[17]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..