A hybrid approach to solving coarse-grained DisCSPs

Authors:
David Lee;Inés Arana;Hatem Ahriz;Kit-Ying Hui
Affiliations:
School of Computing, RGU, Scotland, UK;School of Computing, RGU, Scotland, UK;School of Computing, RGU, Scotland, UK;School of Computing, RGU, Scotland, UK
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 4
Cited 1

Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
Distributed Constraint Satisfaction Algorithm for Complex Local Problems

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd

IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology

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

A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) consists of several loosely connected constraint satisfaction subproblems, each assigned to an individual agent. We present Multi-Hyb, a two-phase concurrent hybrid approach for solving DisCSPs. In the first phase, each agent's subproblem is solved using systematic search which generates the key partial solutions to the global problem. Concurrently, a penalty-based local search algorithm attempts to find a global solution from these partial solutions. If phase 1 fails to find a solution, a phase 2 systematic search algorithm solves the problem using the knowledge gained from phase 1. We show that our approach is highly competitive in comparison with other coarse-grained DisCSP algorithms.