Min-domain ordering for asynchronous backtracking

Roie Zivan, Moshe Zazone, Amnon Meisels

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

3 Scopus citations

Abstract

Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the min-domain property [10,4,20,6]. Ordering heuristics have been introduced recently to Asynchronous backtracking (ABT), for distributed constraints satisfaction (DisCSP) [27], However, the pioneering study of dynamically ordered ABT, ABT_DO, has shown that a straightforward implementation of the min-domain heuristic does not produce the expected improvement over a static ordering. The best ordering heuristic for asynchronous backtracking was found to be the Nogood-triggered heuristic. The present paper proposes an asynchronous dynamic ordering which does not follow the standard restrictions on the position of reordered agents in ABT_DO. Agents can be moved to a position that is higher than that of the target of the backtrack {culprit). Combining the Nogood-triggered heuristic and the min-domain property in this new class of heuristics results in the best performing version of ABT_DO. The new version of retroactively ordered ABT is faster by a large factor than the best form of ABT.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings
PublisherSpringer Verlag
Pages757-772
Number of pages16
ISBN (Print)3540749691, 9783540749691
DOIs
StatePublished - 1 Jan 2007
Event13th International Conference on Principles and Practice of Constraint Programming, CP 2007 - Providence, RI, United States
Duration: 23 Sep 200727 Sep 2007

Publication series

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

Conference

Conference13th International Conference on Principles and Practice of Constraint Programming, CP 2007
Country/TerritoryUnited States
CityProvidence, RI
Period23/09/0727/09/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Min-domain ordering for asynchronous backtracking'. Together they form a unique fingerprint.

Cite this