.png){kind=icon}
.png){kind=icon}
Return
DOC-BRelax: A new multi-agent system to solve Distributed Constraint Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2016.04.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (DCSPs), where the goal is to find a set of assignments to variables that satisfies all constraints among agents. However, when real-life application problems are formalized as DCSPs, they are often over constrained and have no solution that satisfies all constraints. Moreover, the globalization of the economy and democratization of the Internet, boosted by the huge growth in information and communication technologies, have largely contributed to the expansion of numerous distributed architectures. Thus this paper provides a new distributed management and decision support system suitable to these interdependencies and these complex environments. We present a Distributed Optimization under Constraints Basic Relax (DOC-BRelax) as a new framework for dealing with over-constrained situations. We also present a version of this framework called DOC-MaxRelax and a new algorithm for solving Distributed Maximal Constraint Satisfaction Problems (DMCSPs). (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
DCSP
DCOP
DMCSP
DOC-MaxRelax
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W