Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2011

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.
Fichier principal
Vignette du fichier
TechnicalReport_RR-11017.pdf (248.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00595688 , version 1 (25-05-2011)
lirmm-00595688 , version 2 (25-05-2011)

Identifiers

  • HAL Id : lirmm-00595688 , version 2

Cite

Christian Bessiere, El Houssine Bouyakhf, Younes Mechqrane, Mohamed Wahbi. Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems. RR-11017, 2011, pp.01-20. ⟨lirmm-00595688v2⟩
281 View
368 Download

Share

Gmail Facebook X LinkedIn More