The University of Southampton
University of Southampton Institutional Repository

A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination

Voice, Thomas, Stranders, Ruben, Rogers, Alex and Jennings, Nick (2010) A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination At ECAI 2010, 19th European Conference on Artificial Intelligence, Portugal. 16 - 20 Aug 2010. , pp. 61-66.

Record type: Conference or Workshop Item (Other)


Recent advances in decentralised coordination of multiple agents have led to the proposal of the max-sum algorithm for solving distributed constraint optimisation problems (DCOPs). The max-sum algorithm is fully decentralised, converges to optimality for problems with acyclic constraint graphs and otherwise performs well in empirical studies. However, it requires agents to have discrete state spaces, which are of practical size to conduct repeated searches over. In contrast, there are decentralised non-linear optimisation methods that are capable of accurately finding local optima over multi-dimensional continuous state spaces, however these methods are not designed to navigate complex interactions between local constraints in order to find globally optimal solutions. Given this background, in this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combines the max-sum algorithm with continuous non-linear optimisation methods. We show that, for problems with acyclic factor graph representations, for suitable parameter choices, our proposed algorithm converges to a state with utility close to the global optimum. We empirically evaluate our approach for cyclic constraint graphs in a multi-sensor target classification problem, and compare its performance to the discrete max-sum algorithm, as well as a non-coordinated approach and the distributed stochastic algorithm (DSA). We show that our hybrid max-sum algorithm outperforms the non-coordinated algorithm, DSA and discrete max-sum considerably. Furthermore, the improvements in outcome over discrete max-sum come without significant increases in running time nor communication cost.

PDF ECAI-383.pdf - Version of Record
Download (139kB)

More information

Submitted date: 27 May 2010
Published date: 2010
Additional Information: Event Dates: August 16-20, 2010
Venue - Dates: ECAI 2010, 19th European Conference on Artificial Intelligence, Portugal, 2010-08-16 - 2010-08-20
Organisations: Agents, Interactions & Complexity


Local EPrints ID: 271239
PURE UUID: 3d1dff16-ba00-4e44-b731-16d0e9536e10

Catalogue record

Date deposited: 09 Jun 2010 10:32
Last modified: 18 Jul 2017 06:45

Export record


Author: Thomas Voice
Author: Ruben Stranders
Author: Alex Rogers
Author: Nick 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 supports OAI 2.0 with a base URL of

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.