Algorithms for Solving Distributed Constraint Satisfaction Problems (DCSPs)

Gadi Solotorevsky, Ehud Gudes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper investigates Constraint Satisfaction Problems (CSPs) that are distributed by nature, i.e., there is a division of the CSF into sub components (agents) that are connected via constraints, where each subcomponent includes several of the CSF variables with the constraints between them. We call such a problem a Distributed CSF (DCSF). In this paper we give a formal deñnition of DCSFs and present four algorithms for solving them. Two of the algorithms are based on the difference between the difficulty of solving the internal constraints in the CSF components (we call them the peripheral components) of the DCSF and the difficulty of solving the constraints between the different CSPs (the central component). The two other algorithms use local and global views of the DCSF respectively. All the algorithms permit the use of different techniques (CSF, knowledge based, and operation research algorithms) in solving each of the problem components. We probe that as long as all the selected techniques are sound and complete, our algorithms are sound and complete. The algorithms were tested in a real distributed environment; the results show that when there is a difference between the difficulty of solving the peripheral components and the central one, taking advantage of it may reduce significantly the amount of work (constraint checks and message passing) needed for solving the DCSF.

Original languageEnglish
Title of host publicationProceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996
PublisherAAAI press
Pages191-198
Number of pages8
ISBN (Electronic)0929280970, 9780929280974
StatePublished - 1 Jan 1996
Event3rd International Conference on Artificial Intelligence Planning Systems, AIPS 1996 - Edinburgh, United Kingdom
Duration: 29 May 199631 May 1996

Publication series

NameProceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Conference

Conference3rd International Conference on Artificial Intelligence Planning Systems, AIPS 1996
Country/TerritoryUnited Kingdom
CityEdinburgh
Period29/05/9631/05/96

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Algorithms for Solving Distributed Constraint Satisfaction Problems (DCSPs)'. Together they form a unique fingerprint.

Cite this