Distributed search by constrained agents

Amnon Meisels

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

Abstract

The investigation of Distributed Constraints Satisfaction Problems (DCSPs) has started a little more than a decade ago. It focuses on constraints satisfaction problems (CSPs) that are distributed among multiple agents. Imagine a large University that includes many departments. The weekly schedule of classes is generated by each department, scheduling its classes and teachers for the whole semester. A weekly schedule is a typical constraint satisfaction problem. Class meetings are variables and the time-slots of the week are the domain of values that have to be assigned to classes in order to generate a schedule. The fundamental constraints of timetabling require that two classes taught by the same teacher have to be assigned different time-slots. Another common constraint is to require that two meetings of the same class will be assigned to different days of the week. In the University as a whole, the departments can be thought of as agents that generate their departmental weekly schedules. The weekly schedules of different departments are constrained by the fact that there are students that select classes from these departments. This generates constraints between departments and the generic scenario of a distributed CSP. Agents own parts of the global problem (e.g. departmental schedules) and cooperate in search for a global solution in which the constraints between departments are satisfied. In order to solve such a distributed problem, all agents must cooperate in a global search process. Search algorithms for a distributed problem operate by agents performing assignments to their variables and exchanging messages in order to check their assignments against those of constraining agents.

Original languageEnglish
Title of host publicationIntelligent Distributed Computing V
Subtitle of host publicationProceedings of the 5th International Symposium on Intelligent Distributed Computing - IDC 2011, Delft, The Netherlands - October 2011
EditorsFrances M.T. Brazier, Kees Nieuwenhuis, Gregor Pavlin, Martijn Warnier, Costin Badica
Pages5-9
Number of pages5
DOIs
StatePublished - 2011
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume382
ISSN (Print)1860-949X

Fingerprint

Dive into the research topics of 'Distributed search by constrained agents'. Together they form a unique fingerprint.

Cite this