BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm release_xehlovxxvffjphzlwi6i6qubsm

by W. Yeoh, A. Felner, S. Koenig

Published in The Journal of Artificial Intelligence Research by AI Access Foundation.

2010   Volume 38, p85-133

Abstract

Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. A DCOP problem is a problem where several agents coordinate their values such that the sum of the resulting constraint costs is minimal. It is often desirable to solve DCOP problems with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP search algorithm that uses the message-passing and communication framework of ADOPT (Modi, Shen, Tambe, & Yokoo, 2005), a well known memory-bounded asynchronous DCOP search algorithm, but changes the search strategy of ADOPT from best-first search to depth-first branch-and-bound search. Our experimental results show that BnB-ADOPT finds cost-minimal solutions up to one order of magnitude faster than ADOPT for a variety of large DCOP problems and is as fast as NCBB, a memory-bounded synchronous DCOP search algorithm, for most of these DCOP problems. Additionally, it is often desirable to find bounded-error solutions for DCOP problems within a reasonable amount of time since finding cost-minimal solutions is NP-hard. The existing bounded-error approximation mechanism allows users only to specify an absolute error bound on the solution cost but a relative error bound is often more intuitive. Thus, we present two new bounded-error approximation mechanisms that allow for relative error bounds and implement them on top of BnB-ADOPT.
In application/xml+jats format

Archived Files and Locations

application/pdf  1.1 MB
file_u5kxi5l72nfdzee7teqe6qyvzy
www.aaai.org (web)
web.archive.org (webarchive)
application/pdf  684.8 kB
file_4t7jed5b2fh7zbmozbhzvwkony
web.archive.org (webarchive)
www.ifaamas.org (web)
application/pdf  1.1 MB
file_j2nxlzsj7rbs7gis2vojy3irka
www.jair.org (web)
web.archive.org (webarchive)
application/pdf  1.1 MB
file_n24f3prdinawlky65o52vp3ohm
web.archive.org (webarchive)
scf.usc.edu (web)
application/pdf  317.3 kB
file_ufebcb4yhnh2riwnjmqjbrq5ca
web.archive.org (webarchive)
idm-lab.org (web)
application/pdf  1.1 MB
file_uudo45xg65anvab5xtxrnzmnre
web.archive.org (webarchive)
www.ise.bgu.ac.il (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2010-05-23
Journal Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
Not in Keepers Registry
ISSN-L:  1076-9757
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6fcd3a18-36df-494a-9ee9-eea6eb0bd7e8
API URL: JSON