Adopt: Asynchronous distributed constraint optimization with quality guarantees

Pragnesh Jay Modi, Wei Min Shen, Milind Tambe, Makoto Yokoo

Research output: Contribution to journalArticle

496 Citations (Scopus)

Abstract

The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisions based on conservative cost estimates rather than relying on global certainty as previous approaches have done. This novel approach results in a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel. Detailed experimental results show that on benchmark problems Adopt obtains speedups of several orders of magnitude over other approaches. Adopt can also perform bounded-error approximation - it has the ability to quickly find approximate solutions and, unlike heuristic search methods, still maintain a theoretical guarantee on solution quality.

Original languageEnglish
Pages (from-to)149-180
Number of pages32
JournalArtificial Intelligence
Volume161
Issue number1-2
DOIs
Publication statusPublished - Jan 1 2005

Fingerprint

guarantee
Multi agent systems
Polynomials
heuristics
Asynchronous
Costs
ability
costs

All Science Journal Classification (ASJC) codes

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Cite this

Adopt : Asynchronous distributed constraint optimization with quality guarantees. / Modi, Pragnesh Jay; Shen, Wei Min; Tambe, Milind; Yokoo, Makoto.

In: Artificial Intelligence, Vol. 161, No. 1-2, 01.01.2005, p. 149-180.

Research output: Contribution to journalArticle

Modi, Pragnesh Jay ; Shen, Wei Min ; Tambe, Milind ; Yokoo, Makoto. / Adopt : Asynchronous distributed constraint optimization with quality guarantees. In: Artificial Intelligence. 2005 ; Vol. 161, No. 1-2. pp. 149-180.
@article{961c01f6187049e1a345164e8cd12703,
title = "Adopt: Asynchronous distributed constraint optimization with quality guarantees",
abstract = "The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisions based on conservative cost estimates rather than relying on global certainty as previous approaches have done. This novel approach results in a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel. Detailed experimental results show that on benchmark problems Adopt obtains speedups of several orders of magnitude over other approaches. Adopt can also perform bounded-error approximation - it has the ability to quickly find approximate solutions and, unlike heuristic search methods, still maintain a theoretical guarantee on solution quality.",
author = "Modi, {Pragnesh Jay} and Shen, {Wei Min} and Milind Tambe and Makoto Yokoo",
year = "2005",
month = "1",
day = "1",
doi = "10.1016/j.artint.2004.09.003",
language = "English",
volume = "161",
pages = "149--180",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Adopt

T2 - Asynchronous distributed constraint optimization with quality guarantees

AU - Modi, Pragnesh Jay

AU - Shen, Wei Min

AU - Tambe, Milind

AU - Yokoo, Makoto

PY - 2005/1/1

Y1 - 2005/1/1

N2 - The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisions based on conservative cost estimates rather than relying on global certainty as previous approaches have done. This novel approach results in a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel. Detailed experimental results show that on benchmark problems Adopt obtains speedups of several orders of magnitude over other approaches. Adopt can also perform bounded-error approximation - it has the ability to quickly find approximate solutions and, unlike heuristic search methods, still maintain a theoretical guarantee on solution quality.

AB - The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisions based on conservative cost estimates rather than relying on global certainty as previous approaches have done. This novel approach results in a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel. Detailed experimental results show that on benchmark problems Adopt obtains speedups of several orders of magnitude over other approaches. Adopt can also perform bounded-error approximation - it has the ability to quickly find approximate solutions and, unlike heuristic search methods, still maintain a theoretical guarantee on solution quality.

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

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

U2 - 10.1016/j.artint.2004.09.003

DO - 10.1016/j.artint.2004.09.003

M3 - Article

AN - SCOPUS:10044277219

VL - 161

SP - 149

EP - 180

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 1-2

ER -