Open AccessDistributed Problem Solving
Author(s) -
Yeoh William,
Yokoo Makoto
Publication year - 2012
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v33i3.2429
Subject(s) - computer science , constraint satisfaction problem , constraint (computer aided design) , distributed computing , mathematical optimization , constraint satisfaction dual problem , optimization problem , constraint satisfaction , distributed algorithm , artificial intelligence , local consistency , mathematics , algorithm , geometry , probabilistic logic
Distributed problem solving is a subfield within multiagent systems, where agents are assumed to be part of a team and collaborate with each other to reach a common goal. In this article, we illustrate the motivations for distributed problem solving and provide an overview of two distributed problem‐solving models, namely distributed constraint‐satisfaction problems (DCSPs) and distributed constraint‐optimization problems (DCOPs), and some of their algorithms.