Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking''

Abstract : The asynchronous backtracking algorithm with dynamic ordering (ABT DO), proposed in a 2006 paper, allows changing the order of agents during distributed asynchronous complete search. In a later 2009 study, retroactive heuristics which allowed more flexibility in the selection of new orders were introduced, resulting in the ABT DO-Retro algorithm, and a relation between the success of heuristics and the min-domain property was identified. Unfortunately, the description of the time-stampping protocol used to compare orders in ABT DO-Retro is confusing and may lead to an implementation in which ABT DO-Retro may not terminate. In this corrigen- dum, we demonstrate the possible undesired outcome and give a detailed and formal description of the correct method for comparing time-stamps in ABT DO-Retro.
Liste complète des métadonnées

Cited literature [4 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00748174
Contributor : Joël Quinqueton <>
Submitted on : Monday, November 5, 2012 - 9:15:52 AM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM
Document(s) archivé(s) le : Wednesday, February 6, 2013 - 3:53:39 AM

File

constraints12-corrigendum.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00748174, version 1

Collections

Citation

Younes Mechqrane, Mohamed Wahbi, Christian Bessière, El Houssine Bouyakhf, Amnon Meisels, et al.. Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking''. Constraints, Springer Verlag, 2012, 17, pp.348-355. ⟨lirmm-00748174⟩

Share

Metrics

Record views

523

Files downloads

352