Algorithms for Distributed Constraint Satisfaction: A Review

Makoto Yokoo, Katsutoshi Hirayama

研究成果: Contribution to journalReview article査読

266 被引用数 (Scopus)

抄録

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. Various application problems in multi-agent systems can be formalized as distributed CSPs. This paper gives an overview of the existing research on distributed CSPs. First, we briefly describe the problem formalization and algorithms of normal, centralized CSPs. Then, we show the problem formalization and several MAS application problems of distributed CSPs. Furthermore, we describe a series of algorithms for solving distributed CSPs, i.e., the asynchronous backtracking, the asynchronous weak-commitment search, the distributed breakout, and distributed consistency algorithms. Finally, we show two extensions of the basic problem formalization of distributed CSPs, i.e., handling multiple local variables, and dealing with over-constrained problems.

本文言語英語
ページ(範囲)185-207
ページ数23
ジャーナルAutonomous Agents and Multi-Agent Systems
3
2
DOI
出版ステータス出版済み - 2000
外部発表はい

All Science Journal Classification (ASJC) codes

  • 人工知能

フィンガープリント

「Algorithms for Distributed Constraint Satisfaction: A Review」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル