DeQED: an efficient divide-and-coordinate algorithm for DCOP

Authors:
Daisuke Hatano;Katsutoshi Hirayama
Affiliations:
Kobe University, Kobe, Japan;Kobe University, Kobe, Japan
Venue:
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Year:
2013

Citing 3
Cited 0

Decentralised coordination of low-power embedded devices using the max-sum algorithm

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Divide-and-coordinate: DCOPs by agreement

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new DCOP algorithm called DeQED (Decomposition with Quadratic Encoding to Decentralize). DeQED is based on the Divide-and-Coordinate (DaC) framework, where the agents repeat solving their updated local sub-problems (the divide stage) and exchanging coordination information that causes to update their local sub-problems (the coordinate stage). Unlike other DaC-based DCOP algorithms, DeQED does not essentially increase the complexity of local sub-problems and allows agents to avoid exchanging variable values in the coordinate stage. Our experimental results show that DeQED significantly outperformed other incomplete DCOP algorithms for both random and structured instances.