Skip to Main content Skip to Navigation
Reports

Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems

Abstract : Asynchronous Backtracking is the standard search procedure for distributed constraint reasoning. It requires a total ordering on the agents. All polynomial space algorithms proposed so far to improve Asynchronous Backtracking by reordering agents during search only allow a limited amount of reordering. In this paper, we propose Agile-ABT, a search procedure that is able to change the ordering of agents more than previous approaches. This is done via the original notion of termination value, a vector of stamps labelling the new orders exchanged by agents during search. In Agile-ABT, agents can reorder themselves as much as they want as long as the termination value decreases as the search progresses. Our experiments show the good performance of Agile-ABT when compared to other dynamic reordering techniques.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00595688
Contributor : Mohamed Wahbi <>
Submitted on : Wednesday, May 25, 2011 - 11:04:57 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Document(s) archivé(s) le : Thursday, March 30, 2017 - 10:38:14 AM

File

TechnicalReport_RR-11017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00595688, version 2

Collections

Citation

Christian Bessière, El Houssine Bouyakhf, Younes Mechqrane, Mohamed Wahbi. Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems. RR-11017, 2011, pp.01-20. ⟨lirmm-00595688v2⟩

Share

Metrics

Record views

470

Files downloads

318