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

Authors:
Muhammed Basharu;Ines Arana;Hatem Ahriz
Affiliations:
-;-;-
Venue:
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Year:
2007

Citing 0
Cited 3

A hybrid approach to solving coarse-grained DisCSPs

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Multi-Hyb: A Hybrid Algorithm for Solving DisCSPs with Complex Local Problems

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.