OpenAIR @ RGU >
Design and Technology >
Computing >
Conference publications (Computing) >

Please use this identifier to cite or link to this item:
This item has been viewed 6 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Arana AAMAS 09 paper.pdf108.94 kBAdobe PDFView/Open
Title: A hybrid approach to solving coarse-grained DisCSPs.
Authors: Lee, David
Arana, Ines
Ahriz, Hatem
Hui, Kit-Ying
Keywords: Artificial Intelligence
Constraint satisfaction
Agent co-operation
Distributed problem solving
Issue Date: May-2009
Publisher: International Foundation for Autonomous Agents & Multi-Agent Systems
Citation: LEE, D., ARANA, I., AHRIZ, H. and HUI, K-Y., 2009. A hybrid approach to solving coarse-grained DisCSPs. In: Proceedings of the Eighth International Conference on Autonomous Agents and Multi Agent Systems (AAMAS 09), 10-15 May 2009. Budapest: IFAAMAS. Pp. 1235-1236.
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.
Appears in Collections:Conference publications (Computing)

All items in OpenAIR are protected by copyright, with all rights reserved.


   Disclaimer | Freedom of Information | Privacy Statement |Copyright ©2012 Robert Gordon University, Garthdee House, Garthdee Road, Aberdeen, AB10 7QB, Scotland, UK: a Scottish charity, registration No. SC013781