Dynamic ordering for asynchronous backtracking on disCSPs

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT\_DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation of Nogoods. The dynamic ordered asynchronous backtracking algorithm uses polynomial space, similarly to standard ABT. The ABT\_DO algorithm with three different ordering heuristics is compared to standard ABT on randomly generated DisCSPs. A Nogood-triggered heuristic, inspired by dynamic backtracking, is found to outperform static order ABT by a large factor in run-time and improve the network load.

Original languageEnglish
Pages (from-to)179-197
Number of pages19
JournalConstraints
Volume11
Issue number2-3
DOIs
StatePublished - 1 Jul 2006

Keywords

  • Distributed AI
  • Distributed Constraint satisfaction
  • Search

Fingerprint

Dive into the research topics of 'Dynamic ordering for asynchronous backtracking on disCSPs'. Together they form a unique fingerprint.

Cite this