Dynamic ordering for asynchronous backtracking on DisCSPs

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

8 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
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages32-46
Number of pages15
DOIs
StatePublished - 1 Dec 2005
Event11th International Conference on Principles and Practice of Constraint Programming - CP 2005 - Sitges, Spain
Duration: 1 Oct 20055 Oct 2005

Publication series

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

Conference

Conference11th International Conference on Principles and Practice of Constraint Programming - CP 2005
Country/TerritorySpain
CitySitges
Period1/10/055/10/05

Fingerprint

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

Cite this