Abstract
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT-DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation of Nogoods. The dynamic ordered asynchronous backtracking algorithm uses polynomial space, similarly to standard ABT. The ABT_DO algorithm with three different ordering heuristics is compared to standard ABT on randomly generated DisCSPs. A Nogood-triggered heuristic, inspired by dynamic backtracking, is found to outperform static order ABT by a large factor in run-time and improve the network load. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Zivan, R., & Meisels, A. (2005). Dynamic ordering for asynchronous backtracking on DisCSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 32–46). https://doi.org/10.1007/11564751_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
