The distributed constraint satisfaction problem: Formalization and algorithms

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


研究成果: Article査読

491 被引用数 (Scopus)


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.

ジャーナルIEEE Transactions on Knowledge and Data Engineering
出版ステータスPublished - 1998

ASJC Scopus subject areas

  • 情報システム
  • コンピュータ サイエンスの応用
  • 計算理論と計算数学


「The distributed constraint satisfaction problem: Formalization and algorithms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。