The distributed constraint satisfaction problem: Formalization and algorithms

Makoto Yokoo, Edmund H. Durfee, Toru Ishida, Kazuhiro Kuwabara

Research output: Contribution to journalArticle

462 Citations (Scopus)

Abstract

In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.

Original languageEnglish
Pages (from-to)673-685
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume10
Issue number5
DOIs
Publication statusPublished - Dec 1 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'The distributed constraint satisfaction problem: Formalization and algorithms'. Together they form a unique fingerprint.

  • Cite this