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.
Origin | Files produced by the author(s) |
---|
Loading...