On Communication in Solving Distributed Constraint Satisfaction Problems

Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent communication is restricted to only exchanging values of variables, since any additional information-exchange is assumed to lead to significant communication overheads and to a breach of privacy. This paper provides a detailed experimental investigation of the impact of inter-agent exchange of additional legal values among agents, within a collaborative setting. We provide a new run-time model that takes into account the overhead of the additional communication in various computing and networking environments. Our investigation of more than 300 problem settings with the new run-time model (i) shows that DCSP strategies with additional information-exchange can lead to big speedups in a significant range of settings; and (ii) provides categorization of problem settings with big speedups by the DCSP strategies based on extra communication, enabling us to selectively apply the strategies to a given domain. This paper not only provides a useful method for performance measurement to the DCSP community, but also shows the utility of additional communication in DCSP.

[1]  Marius-Calin Silaghi,et al.  Consistency Maintenance for ABT , 2001, CP.

[2]  Milind Tambe,et al.  Distributed Sensor Networks: A Multiagent Perspective , 2003 .

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

[4]  Bhaskar Krishnamachari,et al.  Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[5]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[6]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[7]  Eric Monfroy,et al.  Chaotic iteration for distributed constraint propagation , 1999, SAC '99.

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

[9]  相場亮 Distributed Constraint Satisfaction: Foundations of Cooperation in Multi - Agent Systems , 2001 .

[10]  Wei-Min Shen,et al.  A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation , 2001, CP.

[11]  John Davin,et al.  Impact of problem centralization in distributed constraint optimization algorithms , 2005, AAMAS '05.

[12]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems , 2000 .

[13]  Milind Tambe,et al.  Performance models for large scale multiagent systems: using distributed POMDP building blocks , 2003, AAMAS '03.

[14]  S. Sitharama Iyengar,et al.  Distributed Sensor Networks , 2004 .