TítuloDistributed Dynamic Backtracking
Publication TypeConference Paper
Year of Publication2001
AuthorsBessière C, Maestre A, Meseguer P
EditorSilaghi M-C
Conference NameProceedings of the IJCAI´01. Workshop on Distributed Constraint Reasoning
Paginación9-16
Resumen

In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backtracking. It ensures the completeness of search, and allows a high level of asynchronism by sidestepping the unnecessary addition of links.