DMCA
Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving (1992)
| Citations: | 295 - 23 self |
BibTeX
@MISC{Yokoo92distributedconstraint,
author = {Makoto Yokoo and Toru Ishida and Edmund H. Durfee and Kazuhiro Kuwabara},
title = {Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving},
year = {1992}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques employed in constraint satisfaction problems. Our experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely-coupled. 1 Introduction Cooperative distributed problem solving (CDPS) is a subfield of AI that is concerned with how a set of artificially intelligent agents can work together to solve problems. Recently, [9] has presented the idea of viewing CDPS as a distributed state space search in order to develop...
Keyphrases
constraint satisfaction formalizing distributed problem constraint satisfaction problem introduction cooperative cdps technique distributed fashion traditional sequential backtracking technique problem solving compare algorithm experimental result intelligent agent individual agent distributed state space search asynchronous backtracking useful formalism
