A Scalable Method for Multiagent Constraint Optimization

We present in this paper a new, complete method for distributed constraint optimization, based on dynamic programming. It is a utility propagation method, inspired by the sum-product algorithm, which is correct only for tree-shaped constraint networks. In this paper, we show how to extend that algorithm to arbitrary topologies using a pseudotree arrangement of the problem graph. Our algorithm requires a linear number of messages, whose maximal size depends on the induced width along the particular pseudotree chosen. We compare our algorithm with backtracking algorithms, and present experimental results. For some problem types we report orders of magnitude fewer messages, and the ability to deal with arbitrarily large problems. Our algorithm is formulated for optimization problems, but can be easily applied to satisfaction problems as well.

[1]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[2]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[3]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[4]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[5]  Amnon Meisels,et al.  Asynchronous Forward-checking for DisCSPs , 2007, Constraints.

[6]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[7]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[8]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[9]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..

[10]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[11]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[12]  B. Faltings,et al.  A Distributed, Complete Method for Multi-Agent Constraint Optimization , 2004 .

[13]  Carmel Domshlak,et al.  Sensor networks and distributed CSP: communication, computation and complexity , 2005, Artif. Intell..

[14]  Simon Kasif,et al.  On the Parallel Complexity of Some Constraint Satisfaction Problems , 1986, AAAI.

[15]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

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

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

[18]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[19]  ArnborgStefan.  Efficient algorithms for combinatorial problems on graphs with bounded, decomposabilitya survey , 1985 .

[20]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[21]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[22]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[23]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[24]  T. Schiex.  A note on CSP graph parameters , 1999 .

[25]  Daniel P. Miranker,et al.  On the Space-Time Trade-off in Solving Constraint Satisfaction Problems , 1995, IJCAI.

[26]  Marius-Calin Silaghi,et al.  Asynchronous Search with Aggregations , 2000, AAAI/IAAI.