Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking'' - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Constraints Year : 2012

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

Dates and versions

lirmm-00748174 , version 1 (05-11-2012)

Identifiers

Cite

Younes Mechqrane, Mohamed Wahbi, Christian Bessiere, El Houssine Bouyakhf, Amnon Meisels, et al.. Corrigendum to ''Min-domain retroactive ordering for Asynchronous Backtracking''. Constraints, 2012, 17, pp.348-355. ⟨10.1007/s10601-012-9122-2⟩. ⟨lirmm-00748174⟩
331 View
514 Download

Altmetric

Share

Gmail Facebook X LinkedIn More