Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs

Authors:
M. Vinyals;J. A. Rodriguez-Aguilar;J. Cerquides
Affiliations:
Spanish National Research Council;Spanish National Research Council;Universitat de Barcelona
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 3
Cited 2

A robust architecture for distributed inference in sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A scalable method for multiagent constraint optimization

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The generalized distributive law

IEEE Transactions on Information Theory

Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we make three main contributions (fully detailed in [5]). Firstly, we formulate a new algorithm, the so-called Action-GDL, which extends GDL [1] to apply it to Distributed Constraint Optimization Problems (DCOPs). Secondly, we show that Action-GDL generalizes DPOP[4], a low-complexity, state-of-the-art algorithm to solve DCOPs. Finally, we provide empirical evidence showing that Action-GDL can outperform DPOP in terms of the amount of computation, communication and parallelism.