Algorithms for Distributed Constraint Satisfaction

A Review

Makoto Yokoo, Katsutoshi Hirayama

Research output: Contribution to journalReview article

254 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. 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.

Original languageEnglish
Pages (from-to)185-207
Number of pages23
JournalAutonomous Agents and Multi-Agent Systems
Volume3
Issue number2
DOIs
Publication statusPublished - Jan 1 2000
Externally publishedYes

Fingerprint

Constraint satisfaction problems
Multi agent systems
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Algorithms for Distributed Constraint Satisfaction : A Review. / Yokoo, Makoto; Hirayama, Katsutoshi.

In: Autonomous Agents and Multi-Agent Systems, Vol. 3, No. 2, 01.01.2000, p. 185-207.

Research output: Contribution to journalReview article

@article{6941cfc91ad54482a0915200b61bc14d,
title = "Algorithms for Distributed Constraint Satisfaction: A Review",
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. 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.",
author = "Makoto Yokoo and Katsutoshi Hirayama",
year = "2000",
month = "1",
day = "1",
doi = "10.1023/A:1010078712316",
language = "English",
volume = "3",
pages = "185--207",
journal = "Autonomous Agents and Multi-Agent Systems",
issn = "1387-2532",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Algorithms for Distributed Constraint Satisfaction

T2 - A Review

AU - Yokoo, Makoto

AU - Hirayama, Katsutoshi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034411116&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034411116&partnerID=8YFLogxK

U2 - 10.1023/A:1010078712316

DO - 10.1023/A:1010078712316

M3 - Review article

VL - 3

SP - 185

EP - 207

JO - Autonomous Agents and Multi-Agent Systems

JF - Autonomous Agents and Multi-Agent Systems

SN - 1387-2532

IS - 2

ER -