The University of Southampton
University of Southampton Institutional Repository

Bounded Approximate Decentralised Coordination via the Max-Sum Algorithm

Rogers, Alex, Farinelli, Alessandro, Stranders, Ruben and Jennings, Nicholas R (2011) Bounded Approximate Decentralised Coordination via the Max-Sum Algorithm Artificial Intelligence, 175, (2), pp. 730-759.

Record type: Article

Abstract

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 between the functions and variables within the factor graph that have the least impact on solution quality. It then uses the max-sum algorithm to optimally solve the resulting tree structured constraint network, and provides a bounded approximation specific to the particular problem instance. In addition, we present two generic pruning techniques to reduce the amount of computation that agents must perform when using the max-sum algorithm. When this is combined with the above mentioned approximation algorithm, the agents are able to solve decentralised coordination problems that have very large action spaces with a low computation and communication overhead. We empirically evaluate our approach in a mobile sensor domain, where mobile agents are used to monitor and predict the state of spatial phenomena (e.g., temperature or gas concentration). Such sensors need to coordinate their movements with their direct neighbours to maximise the collective information gain, while predicting measurements at unobserved locations. When applied in this domain, our approach is able to provide solutions which are guaranteed to be within 2% of the optimal solution. Moreover, the two pruning techniques are extremely effective in decreasing the computational effort of each agent by reducing the size of the search space by up to 92%.

PDF 4136.pdf - Accepted Manuscript
Download (529kB)

More information

Published date: February 2011
Keywords: max-sum, decentralised coordination, bounded approximation
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 271664
URI: http://eprints.soton.ac.uk/id/eprint/271664
PURE UUID: bd396b48-f2c1-4547-986f-5e9c185e4d43

Catalogue record

Date deposited: 30 Oct 2010 11:00
Last modified: 12 Oct 2017 07:57

Export record

Contributors

Author: Alex Rogers
Author: Alessandro Farinelli
Author: Ruben Stranders
Author: Nicholas R Jennings

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×