Distributed constraint satisfaction: Foundation and applications

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. The research on constraint satisfaction problems has a long and distinguished history in AI as a general framework that can formalize various application problems. Similarly, a distributed CSP is a fundamental problem for achieving coordination among agents and can formalize various application problems in multi-agent systems.

Original languageEnglish
Title of host publicationProceedings - International Conference on Multi Agent Systems, ICMAS 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages14-15
Number of pages2
ISBN (Print)081868500X, 9780818685002
DOIs
Publication statusPublished - Jan 1 1998
Externally publishedYes
Event1998 International Conference on Multi Agent Systems, ICMAS 1998 - Pans, France
Duration: Jul 3 1998Jul 7 1998

Publication series

NameProceedings - International Conference on Multi Agent Systems, ICMAS 1998

Other

Other1998 International Conference on Multi Agent Systems, ICMAS 1998
CountryFrance
CityPans
Period7/3/987/7/98

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Communication
  • Computer Networks and Communications
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Distributed constraint satisfaction: Foundation and applications'. Together they form a unique fingerprint.

Cite this