TY - GEN

T1 - IDB-ADOPT

T2 - 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008

AU - Yeoh, William

AU - Felner, Ariel

AU - Koenig, Sven

N1 - Funding Information:
This research was done while Ariel Felner spent his sabbatical at the University of Southern California, visiting Sven Koenig. This research has been partly supported by an NSF award to Sven Koenig under contract IIS-0350584. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied of the sponsoring organizations, agencies, companies or the U.S. government.

PY - 2009/9/14

Y1 - 2009/9/14

N2 - Many agent coordination problems can be modeled as distributed constraint optimization (DCOP) problems. ADOPT is an asynchronous and distributed search algorithm that is able to solve DCOP problems optimally. In this paper, we introduce Iterative Decreasing Bound ADOPT (IDB-ADOPT), a modification of ADOPT that changes the search strategy of ADOPT from performing one best-first search to performing a series of depth-first searches. Each depth-first search is provided with a bound, initially a large integer, and returns the first solution whose cost is smaller than or equal to the bound. The bound is then reduced to the cost of this solution minus one and the process repeats. If there is no solution whose cost is smaller than or equal to the bound, it returns a cost-minimal solution. Thus, IDB-ADOPT is an anytime algorithm that solves DCOP problems with integer costs optimally. Our experimental results for graph coloring problems show that IDB-ADOPT runs faster (that is, needs fewer cycles) than ADOPT on large DCOP problems, with savings of up to one order of magnitude.

AB - Many agent coordination problems can be modeled as distributed constraint optimization (DCOP) problems. ADOPT is an asynchronous and distributed search algorithm that is able to solve DCOP problems optimally. In this paper, we introduce Iterative Decreasing Bound ADOPT (IDB-ADOPT), a modification of ADOPT that changes the search strategy of ADOPT from performing one best-first search to performing a series of depth-first searches. Each depth-first search is provided with a bound, initially a large integer, and returns the first solution whose cost is smaller than or equal to the bound. The bound is then reduced to the cost of this solution minus one and the process repeats. If there is no solution whose cost is smaller than or equal to the bound, it returns a cost-minimal solution. Thus, IDB-ADOPT is an anytime algorithm that solves DCOP problems with integer costs optimally. Our experimental results for graph coloring problems show that IDB-ADOPT runs faster (that is, needs fewer cycles) than ADOPT on large DCOP problems, with savings of up to one order of magnitude.

KW - ADOPT

KW - DCOP

KW - Distributed Constraint Optimization

KW - Distributed Search Algorithms

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

U2 - 10.1007/978-3-642-03251-6_9

DO - 10.1007/978-3-642-03251-6_9

M3 - Conference contribution

AN - SCOPUS:69949115583

SN - 3642032508

SN - 9783642032509

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 146

BT - Recent Advances in Constraints - 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Revised Selected Papers

Y2 - 18 June 2008 through 20 June 2008

ER -