Dynamic ordering for asynchronous backtracking on DisCSPs

Roie Zivan; Amnon Meisels

doi:10.1007/11564751_6

Dynamic ordering for asynchronous backtracking on DisCSPs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	32-46
Number of pages	15
DOIs	https://doi.org/10.1007/11564751_6
State	Published - 1 Dec 2005
Event	11th International Conference on Principles and Practice of Constraint Programming - CP 2005 - Sitges, Spain Duration: 1 Oct 2005 → 5 Oct 2005

Publication series

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

Conference

Conference	11th International Conference on Principles and Practice of Constraint Programming - CP 2005
Country/Territory	Spain
City	Sitges
Period	1/10/05 → 5/10/05

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11564751_6

Cite this

Zivan, R., & Meisels, A. (2005). Dynamic ordering for asynchronous backtracking on DisCSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 32-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3709 LNCS). https://doi.org/10.1007/11564751_6

Zivan, Roie ; Meisels, Amnon. / Dynamic ordering for asynchronous backtracking on DisCSPs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. pp. 32-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f09100a369a84492a49642e201aff928,

title = "Dynamic ordering for asynchronous backtracking on DisCSPs",

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.",

author = "Roie Zivan and Amnon Meisels",

year = "2005",

month = dec,

day = "1",

doi = "10.1007/11564751\_6",

language = "English",

isbn = "3540292381",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "32--46",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

note = "11th International Conference on Principles and Practice of Constraint Programming - CP 2005 ; Conference date: 01-10-2005 Through 05-10-2005",

}

Zivan, R & Meisels, A 2005, Dynamic ordering for asynchronous backtracking on DisCSPs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3709 LNCS, pp. 32-46, 11th International Conference on Principles and Practice of Constraint Programming - CP 2005, Sitges, Spain, 1/10/05. https://doi.org/10.1007/11564751_6

Dynamic ordering for asynchronous backtracking on DisCSPs. / Zivan, Roie ; Meisels, Amnon.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 32-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3709 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic ordering for asynchronous backtracking on DisCSPs

AU - Zivan, Roie

AU - Meisels, Amnon

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33646183942

U2 - 10.1007/11564751_6

DO - 10.1007/11564751_6

M3 - Conference contribution

AN - SCOPUS:33646183942

SN - 3540292381

SN - 9783540292388

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

SP - 32

EP - 46

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

T2 - 11th International Conference on Principles and Practice of Constraint Programming - CP 2005

Y2 - 1 October 2005 through 5 October 2005

ER -

Zivan R , Meisels A. Dynamic ordering for asynchronous backtracking on DisCSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 32-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11564751_6

Dynamic ordering for asynchronous backtracking on DisCSPs

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this