Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments
Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments
Decentralised optimisation is a key issue for multi-agent systems, and while many solution techniques have been developed, few provide support for dynamic environments, which change over time, such as disaster management. Given this, in this paper, we present Bounded Fast Max Sum (BFMS): a novel, dynamic, superstabilizing algorithm which provides a bounded approximate solution to certain classes of distributed constraint optimisation problems. We achieve this by eliminating dependencies in the constraint functions, according to how much impact they have on the overall solution value. In more detail, we propose iGHS, which computes a maximum spanning tree on subsections of the constraint graph, in order to reduce communication and computation overheads. Given this, we empirically evaluate BFMS, which shows that BFMS reduces communication and computation done by Bounded Max Sum by up to 99%, while obtaining 60-88% of the optimal utility.
25-32
Macarthur, Kathryn
4c7db797-1679-4fd1-9dac-26f84bd5debd
Farinelli, Alessandro
d2f26070-f403-4cae-b712-7097cb2e3fc6
Ramchurn, Sarvapali
1d62ae2a-a498-444e-912d-a6082d3aaea3
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
10 May 2010
Macarthur, Kathryn
4c7db797-1679-4fd1-9dac-26f84bd5debd
Farinelli, Alessandro
d2f26070-f403-4cae-b712-7097cb2e3fc6
Ramchurn, Sarvapali
1d62ae2a-a498-444e-912d-a6082d3aaea3
Jennings, Nick
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Macarthur, Kathryn, Farinelli, Alessandro, Ramchurn, Sarvapali and Jennings, Nick
(2010)
Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments.
Third International Workshop on: Optimisation in Multi-Agent Systems (OptMas) at the Ninth Joint Conference on Autonomous and Multi-Agent Systems, Toronto, Canada.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Decentralised optimisation is a key issue for multi-agent systems, and while many solution techniques have been developed, few provide support for dynamic environments, which change over time, such as disaster management. Given this, in this paper, we present Bounded Fast Max Sum (BFMS): a novel, dynamic, superstabilizing algorithm which provides a bounded approximate solution to certain classes of distributed constraint optimisation problems. We achieve this by eliminating dependencies in the constraint functions, according to how much impact they have on the overall solution value. In more detail, we propose iGHS, which computes a maximum spanning tree on subsections of the constraint graph, in order to reduce communication and computation overheads. Given this, we empirically evaluate BFMS, which shows that BFMS reduces communication and computation done by Bounded Max Sum by up to 99%, while obtaining 60-88% of the optimal utility.
Text
optmas2010final.pdf
- Other
More information
Published date: 10 May 2010
Additional Information:
Event Dates: 10 May 2010
Venue - Dates:
Third International Workshop on: Optimisation in Multi-Agent Systems (OptMas) at the Ninth Joint Conference on Autonomous and Multi-Agent Systems, Toronto, Canada, 2010-05-10
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 268588
URI: http://eprints.soton.ac.uk/id/eprint/268588
PURE UUID: 6fd25145-58d8-4579-b857-ed134433bcf8
Catalogue record
Date deposited: 11 Mar 2010 16:12
Last modified: 15 Mar 2024 03:22
Export record
Contributors
Author:
Kathryn Macarthur
Author:
Alessandro Farinelli
Author:
Sarvapali Ramchurn
Author:
Nick Jennings
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