Dynamic Distributed BackJumping

We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed version of the centralized BackJumping algorithm, called the Dynamic Distributed BackJumping - DDBJ algorithm. The advantage is twofold: DDBJ inherits the strength of synchronous algorithms that enables it to easily combine with a powerful dynamic ordering of variables and values, and still it maintains some level of autonomy for the agents. Experimental results show that DDBJ outperforms the DiDB and AFC algorithms by a factor of one to two orders of magnitude on hard instances of randomly generated DisCSPs.

• Type: Conference
• Year: 2004
• Where: CSCLP
• Authors: Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
• Keywords: Centralized Backjumping Algorithm, Constraint Satisfaction Problems, CSCLP 2004, Powerful Dynamic Ordering