Compilation Formulation for Asynchronous Backtracking with Complex Local Problems

The Asynchronous BackTracklng (ABT) algorithm is a well known algorithm for solving distributed constraint satisfaction problems. However, several work which interest to ABT suppose that each agent owns one single variable. In this paper, we present the compilation formulation for Asynchronous Backtracking with complex local problems, resulting in the ABT-cf algorithm. The ABT-cf algorithm is described in detail and its correctness proof. An extensive experimental evaluation of the proposed algorithm is carried on random binary DisCSP. The performances of ABT-cf is compared to the standard ABT in which the distributed problem is reformulated by decomposition. Experimental evaluation shows that ABT-cf increases the performance of the distributed search and outperforms standard ABT by a large scale.

[1]  Kenneth N. Brown,et al.  Applying Interchangeability to Complex Local Problems in Distributed Constraint Reasoning , 2006 .

[2]  Amnon Meisels,et al.  Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

[3]  Christian Bessiere,et al.  Improving Asynchronous Backtracking for Dealing with Complex Local Problems , 2004, ECAI.

[4]  C. Bessiere,et al.  DisChoco : A platform for distributed constraint programming , 2006 .

[5]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[6]  Edmund H. Durfee,et al.  Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems , 1997, AAAI/IAAI.

[7]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[8]  Makoto Yokoo,et al.  Local search for distributed SAT with complex local problems , 2002, AAMAS '02.

[9]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[10]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[11]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).