IDB-ADOPT: A depth-first search DCOP algorithm

William Yeoh, Ariel Felner, Sven Koenig

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationRecent Advances in Constraints - 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Revised Selected Papers
Pages132-146
Number of pages15
DOIs
StatePublished - 14 Sep 2009
Event13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008 - Rome, Italy
Duration: 18 Jun 200820 Jun 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5655 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008
Country/TerritoryItaly
CityRome
Period18/06/0820/06/08

Keywords

  • ADOPT
  • DCOP
  • Distributed Constraint Optimization
  • Distributed Search Algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'IDB-ADOPT: A depth-first search DCOP algorithm'. Together they form a unique fingerprint.

Cite this