Bounded approximate decentralised coordination via the max-sum algorithm

In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network. It builds a tree structure by eliminating dependencies betwe...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 175; no. 2; pp. 730 - 759
Main Authors:	Rogers, A., Farinelli, A., Stranders, R., Jennings, N.R.
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 01.02.2011 Elsevier
Subjects:	Agents (artificial intelligence) Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computation Computer science; control theory; systems Computer systems and distributed systems. User interface DCOP Decentralised coordination Exact sciences and technology Mathematical analysis Mathematical models Max-sum algorithm Networks Pruning Software Theoretical computing Decentralised coordination Max-sum algorithm DCOP Action Tree structured method Constraint satisfaction Tree structure Graph theory Approximation algorithm Middleware Information measure Multiagent system Decentralized control Optimal solution Pruning(tree) Software agents Localization Sensor array Gas detector Mobile computing
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!