Title: | Algorithms for Distributed Constraint Satisfaction: A Review |

Author: | Makoto Yokoo and Katsutoshi Hirayama |

Journal: | Autonomous Agents and Multi-Agent Systems |

Volume: | 3 |

Number: | 2 |

Pages: | 185--207 |

Year: | 2000 |

DOI: | 10.1023/A:1010078712316 |

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 nd a consistent combination of actions that satis es 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. |

Cited by 98

@Article{yokoo00a, author = {Makoto Yokoo and Katsutoshi Hirayama}, title = {Algorithms for Distributed Constraint Satisfaction: A Review}, googleid = {J9cH5Kw-R4IJ:scholar.google.com/}, journal = {Autonomous Agents and Multi-Agent Systems}, year = 2000, volume = 3, number = 2, pages = {185--207}, 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 nd a consistent combination of actions that satis es 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.}, keywords = {multiagent dcsp survey}, doi = {10.1023/A:1010078712316}, url = {http://jmvidal.cse.sc.edu/library/yokoo00a.pdf}, cluster = {9387540860558104359} }Last modified: Wed Mar 9 10:14:57 EST 2011