The University of Southampton
University of Southampton Institutional Repository

Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks

Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an instance of coalition formation, with overlapping coalitions. We show that within this application area sub-additive coalition valuations are typical, and we thus use this structural property of the problem to we derive two novel algorithms (an approximate greedy one that operates in polynomial time and has a calculated bound to the optimum, and an optimal branch-and-bound one) to find the optimal coalition structure in this instance. We empirically evaluate the performance of these algorithms within a generic model of a multi-sensor network performing wide area surveillance. These results show that the polynomial algorithm typically generated solutions much closer the optimal than the theoretical bound, and prove the effectiveness of our pruning procedure.
coalition formation, multi-agent systems
635-640
Dang, Viet Dung
ba433cbf-f6ff-4386-a952-c6c8ce7624e5
Dash, Rajdeep K.
589f704a-00dd-4921-b4f4-e47362cc552f
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Dang, Viet Dung
ba433cbf-f6ff-4386-a952-c6c8ce7624e5
Dash, Rajdeep K.
589f704a-00dd-4921-b4f4-e47362cc552f
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Dang, Viet Dung, Dash, Rajdeep K., Rogers, Alex and Jennings, N. R. (2006) Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks. Twenty-First National Conference on Artificial Intelligence (AAAI-06), United States. pp. 635-640 .

Record type: Conference or Workshop Item (Paper)

Abstract

This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an instance of coalition formation, with overlapping coalitions. We show that within this application area sub-additive coalition valuations are typical, and we thus use this structural property of the problem to we derive two novel algorithms (an approximate greedy one that operates in polynomial time and has a calculated bound to the optimum, and an optimal branch-and-bound one) to find the optimal coalition structure in this instance. We empirically evaluate the performance of these algorithms within a generic model of a multi-sensor network performing wide area surveillance. These results show that the polynomial algorithm typically generated solutions much closer the optimal than the theoretical bound, and prove the effectiveness of our pruning procedure.

PDF
AAAI0613DangD.pdf - Other
Download (137kB)

More information

Published date: 2006
Additional Information: Event Dates: July 2006
Venue - Dates: Twenty-First National Conference on Artificial Intelligence (AAAI-06), United States, 2006-07-01
Keywords: coalition formation, multi-agent systems
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 262364
URI: https://eprints.soton.ac.uk/id/eprint/262364
PURE UUID: 72b4b26c-65b3-4f48-ac2c-fd8b80ba79a0

Catalogue record

Date deposited: 14 Apr 2006
Last modified: 18 Jul 2017 08:51

Export record

Contributors

Author: Viet Dung Dang
Author: Rajdeep K. Dash
Author: Alex Rogers
Author: N. R. Jennings

University divisions

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.

×