Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments

Macarthur, Kathryn, Farinelli, Alessandro, Ramchurn, Sarvapali and Jennings, Nick (2010) Efficient, Superstabilizing Decentralised Optimisation for Dynamic Task Allocation Environments. In, Third International Workshop on: Optimisation in Multi-Agent Systems (OptMas) at the Ninth Joint Conference on Autonomous and Multi-Agent Systems, Toronto, Canada, , 25-32.


[img] PDF
Download (420Kb)


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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 10 May 2010
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 268588
Accepted Date and Publication Date:
10 May 2010Published
Date Deposited: 11 Mar 2010 16:12
Last Modified: 31 Mar 2016 14:17
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/268588

Actions (login required)

View Item View Item

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