By Topic

A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Law, T.H.-W. ; Dept. of Comput. Sci. & Software Eng., Univ. of Melbourne, Melbourne, VIC ; Pearce, A.R.

In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication complexity. The key to performance advantages, in terms of both computation and communication, derives from the application of the repeatedly-half principle to manage complexity by a combination of problem distribution through graph decomposition and multi-stage solution quality propagation. Experimental result shows that our new algorithm is faster than a competitive distributed algorithm for solving MaxSAT graph colouring problems. It also indicates the potential for the decomposition approach over a centralised method based on the same search strategy, and is consistent with results on domain propagation and structural decomposition in the CSP literature.

Published in:

Intelligent Agent Technology, 2006. IAT '06. IEEE/WIC/ACM International Conference on

Date of Conference:

18-22 Dec. 2006