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

Author

Basharu, Muhammed ; Arana, Inés ; Ahriz, Hatem

Author_Institution

Univ. Coll. Cork, Cork

fYear

2007

fDate

2-5 Nov. 2007

Firstpage

335

Lastpage

341

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.

Keywords

constraint theory; distributed algorithms; graph colouring; problem solving; search problems; stochastic processes; DisBO-wd; distributed breakout; distributed constraint satisfaction problems; distributed graph colouring; local optima; multi-DisPeL; penalty-based local search distributed algorithm; problem solving; stochastic algorithm; weight decay mechanism; Computational efficiency; Costs; Distributed algorithms; Distributed computing; Educational institutions; Intelligent agent; Iterative algorithms; Problem-solving; Stochastic processes; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on

Conference_Location

Fremont, CA

Print_ISBN

978-0-7695-3027-7

Type

conf

DOI

10.1109/IAT.2007.68

Filename

4407307