TY - GEN

T1 - Nogood based asynchronous distributed optimization (ADOPT ng)

AU - Silaghi, Marius C.

AU - Yokoo, Makoto

PY - 2006/12/1

Y1 - 2006/12/1

N2 - This work proposes an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs) using a new kind of nogoods, namely valued nogoods. The proposed technique is an extension of the asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning, leading to important speed-up. Valued nogoods are an extension of classic nogoods that associates each nogood with a threshold and optionally with a set of references to culprit constraints. DCOPs have been shown to have very elegant distributed solutions, such as ADOPT, distributed asynchronous overlay (DisAO), or DPOP. These algorithms are typically tuned to minimize the longest causal chain of messages, as a measure of how the algorithms will scale for systems with remote agents (with large latency in communication). Among the mentioned techniques, DPOP performs very well for the chosen metric (requiring a number of such sequential messages linear in the number of agents), but in general has exponential space requirements. DisAO and ADOPT have the advantage of needing only polynomial space. ADOPT has the property of maintaining the initial distribution of the problem. ADOPT needs a preprocessing step consisting of computing a depth first search (DFS) tree on the agent graph. We show that valued nogoods reduce the practical importance/need of this preprocessing since independent subproblems are now dynamically detected and exploited.

AB - This work proposes an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs) using a new kind of nogoods, namely valued nogoods. The proposed technique is an extension of the asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning, leading to important speed-up. Valued nogoods are an extension of classic nogoods that associates each nogood with a threshold and optionally with a set of references to culprit constraints. DCOPs have been shown to have very elegant distributed solutions, such as ADOPT, distributed asynchronous overlay (DisAO), or DPOP. These algorithms are typically tuned to minimize the longest causal chain of messages, as a measure of how the algorithms will scale for systems with remote agents (with large latency in communication). Among the mentioned techniques, DPOP performs very well for the chosen metric (requiring a number of such sequential messages linear in the number of agents), but in general has exponential space requirements. DisAO and ADOPT have the advantage of needing only polynomial space. ADOPT has the property of maintaining the initial distribution of the problem. ADOPT needs a preprocessing step consisting of computing a depth first search (DFS) tree on the agent graph. We show that valued nogoods reduce the practical importance/need of this preprocessing since independent subproblems are now dynamically detected and exploited.

UR - http://www.scopus.com/inward/record.url?scp=34247243249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247243249&partnerID=8YFLogxK

U2 - 10.1145/1160633.1160894

DO - 10.1145/1160633.1160894

M3 - Conference contribution

AN - SCOPUS:34247243249

SN - 1595933034

SN - 9781595933034

T3 - Proceedings of the International Conference on Autonomous Agents

SP - 1389

EP - 1396

BT - Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems

T2 - Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Y2 - 8 May 2006 through 12 May 2006

ER -