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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Artificial intelligence Ročník 175; číslo 2; s. 730 - 759
Hlavní autori:	Rogers, A., Farinelli, A., Stranders, R., Jennings, N.R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier B.V 01.02.2011 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!