Authors:
Toshihiro Matsui
and
Hiroshi Matsuo
Affiliation:
Nagoya Institute of Technology, Japan
Keyword(s):
Max-Sum, Factor-graph, Pseudo-tree, Distributed Constraint Optimization, Multi-agent, Cooperation.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Cooperation and Coordination
;
Distributed and Mobile Software Systems
;
Distributed Problem Solving
;
Enterprise Information Systems
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Software Engineering
;
Symbolic Systems
Abstract:
Distributed Constraint Optimization Problems (DCOPs) have been studied as fundamental problems in multiagent
systems. The Max-Sum algorithm has been proposed as a solution method for DCOPs. The algorithm
is based on factor graphs that consist of two types of nodes for variables and functions. While the Max-Sum
is an exact method for acyclic factor-graphs, in the case that the factor graph contains cycles, it is an inexact
method that may not converge. In this study, we propose a method that decomposes the cycles based on crossedged
pseudo-trees on factor-graphs. We also present a basic scheme of distributed search algorithms that
generalizes complete search algorithms on the constraint graphs and Max-Sum algorithm.