A scalable method for multiagent constraint optimization

  • Authors:
  • Adrian Petcu;Boi Faltings

  • Affiliations:
  • Artificial Intelligence Laboratory, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Artificial Intelligence Laboratory, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

  • Venue:
  • IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.