Bounded Approximate Decentralised Coordination using the Max-Sum Algorithm


Farinelli, Alessandro, Rogers, Alex and Jennings, Nick (2009) Bounded Approximate Decentralised Coordination using the Max-Sum Algorithm At IJCAI-09 Workshop on Distributed Constraint Reasoning (DCR), United States. , pp. 46-59.

Download

[img] PDF ijcai_bounded.pdf - Version of Record
Download (131kB)

Description/Abstract

In this paper we propose a novel algorithm that provides bounded approximate solutions for decentralised coordination problems. Our approach removes cycles in any general constraint network by eliminating dependencies between functions and variables which have the least impact on the solution quality. It uses the max-sum algorithm to optimally solve the resulting tree structured constraint network, providing a bounded approximation specific to the particular problem instance. We formally prove that our algorithm provides a bounded approximation of the original problem and we present an empirical evaluation in a synthetic scenario. This shows that the approximate solutions that our algorithm provides are typically within 95% of the optimum and the approximation ratio that our algorithm provides is typically 1.23.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 13th July 2009
Venue - Dates: IJCAI-09 Workshop on Distributed Constraint Reasoning (DCR), United States, 2009-07-13
Organisations: Agents, Interactions & Complexity
ePrint ID: 267417
Date :
Date Event
13 July 2009Published
Date Deposited: 29 May 2009 09:21
Last Modified: 17 Apr 2017 18:48
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267417

Actions (login required)

View Item View Item