The University of Southampton
University of Southampton Institutional Repository

Bounded Decentralised Coordination over Multiple Objectives

Bounded Decentralised Coordination over Multiple Objectives
Bounded Decentralised Coordination over Multiple Objectives
We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality of B-MOMS in acyclic constraint graphs, and derive problem dependent bounds on its approximation ratio when these graphs contain cycles. Furthermore, we empirically evaluate its performance on a multi-objective extension of the canonical graph colouring problem. In so doing, we demonstrate that, for the settings we consider, the approximation ratio never exceeds 2, and is typically less than 1.5 for less-constrained graphs. Moreover, the runtime required by B-MOMS on the problem instances we considered never exceeds 30 minutes, even for maximally constrained graphs with $100$ agents. Thus, B-MOMS brings the problem of multi-objective optimisation well within the boundaries of the limited capabilities of embedded agents.
0-9826571-5-3
371-378
Delle Fave, Francesco Maria
1a71a79a-fb96-4bfc-9158-36f8dcb5d96f
Stranders, Ruben
cca79d07-0668-4231-a80f-5fae6617644c
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Delle Fave, Francesco Maria
1a71a79a-fb96-4bfc-9158-36f8dcb5d96f
Stranders, Ruben
cca79d07-0668-4231-a80f-5fae6617644c
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Delle Fave, Francesco Maria, Stranders, Ruben, Rogers, Alex and Jennings, Nick (2011) Bounded Decentralised Coordination over Multiple Objectives. The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan. 02 - 06 May 2011. pp. 371-378 .

Record type: Conference or Workshop Item (Paper)

Abstract

We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality of B-MOMS in acyclic constraint graphs, and derive problem dependent bounds on its approximation ratio when these graphs contain cycles. Furthermore, we empirically evaluate its performance on a multi-objective extension of the canonical graph colouring problem. In so doing, we demonstrate that, for the settings we consider, the approximation ratio never exceeds 2, and is typically less than 1.5 for less-constrained graphs. Moreover, the runtime required by B-MOMS on the problem instances we considered never exceeds 30 minutes, even for maximally constrained graphs with $100$ agents. Thus, B-MOMS brings the problem of multi-objective optimisation well within the boundaries of the limited capabilities of embedded agents.

Text
updated_copy.pdf - Version of Record
Download (169kB)

More information

Published date: 28 January 2011
Additional Information: Event Dates: 2-6 May 2011
Venue - Dates: The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan, 2011-05-02 - 2011-05-06
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 271958
URI: https://eprints.soton.ac.uk/id/eprint/271958
ISBN: 0-9826571-5-3
PURE UUID: 1a21baf6-d19a-4c95-b94c-5e6653fbddcc

Catalogue record

Date deposited: 28 Jan 2011 12:00
Last modified: 09 Sep 2019 18:53

Export record

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 https://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.

×