Solving DisCSPs with penalty driven search

Authors:
Muhammed Basharu;Ines Arana;Hatem Ahriz
Affiliations:
School of Computing, The Robert Gordon University, Aberdeen, United Kingdom;School of Computing, The Robert Gordon University, Aberdeen, United Kingdom;School of Computing, The Robert Gordon University, Aberdeen, United Kingdom
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Year:
2005

Citing 8
Cited 3

Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem

Journal of Automated Reasoning
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

Artificial Intelligence
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
Distributed Dynamic Backtracking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks

Artificial Intelligence - Special issue: Distributed constraint satisfaction
The distributed breakout algorithms

Artificial Intelligence - Special issue: Distributed constraint satisfaction
The breakout method for escaping from local minima

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

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
Solving coarse-grained DisCSPs with local search

Web Intelligence and Agent Systems
Improving the privacy of the asynchronous partial overlay protocol

Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the Distributed, Penalty-driven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local optima by the use of both temporary and incremental penalties and a tabu-like no-good store. We justify the use of these features and provide empirical results which demonstrate the competitiveness of the algorithm.