Delle Fave, Francesco Maria, Stranders, Ruben, Rogers, Alex and Jennings, Nick
Bounded Decentralised Coordination over Multiple Objectives
At The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan, Province of China.
02 - 06 May 2011.
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.
Conference or Workshop Item
||Event Dates: 2-6 May 2011
|Venue - Dates:
||The Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taiwan, Province of China, 2011-05-02 - 2011-05-06
||Agents, Interactions & Complexity
|28 January 2011||Published|
||28 Jan 2011 12:00
||17 Apr 2017 18:03
|Further Information:||Google Scholar|
Actions (login required)