Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd

We present Multi-DisPel, a penalty-based local search distributed algorithm which is able to solve coarse-grained Distributed Constraint Satisfaction Problems (DisCSPs) efficiently. Multi-DisPeL uses penalties on values in order to escape local optima during problem solving rather than the popular weights on constraints. We also introduce DisBO-wd, a stochastic algorithm based on DisBO (Distributed Breakout) which includes a weight decay mechanism. We compare Multi-DisPeL and DisBO-wd with other algorithms and show, empirically, that they are more efficient and at least as effective as state of the art algorithms in some problem classes.

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

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

[3]  Amnon Meisels,et al.  Using additional information in DisCSPs search , 2004 .

[4]  C. Eisenberg.  DISTRIBUTED CONSTRAINT SATISFACTION FOR COORDINATING AND INTEGRATING A LARGE-SCALE, HETEROGENEOUS ENTERPRISE , 2003 .

[5]  Weixiong Zhang,et al.  Distributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance , 2002 .

[6]  Muhammed Basharu,et al.  Solving DisCSPs with Penalty Driven Search , 2005, AAAI.

[7]  Jeremy Frank.  Learning Short-Term Weights for GSAT , 1997, IJCAI.

[8]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[9]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[10]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

[11]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[12]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..

[13]  Muhammed Basharu,et al.  Stoch-DisPeL: exploiting randomisation in DisPeL. , 2006 .

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

[15]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.