The University of Southampton
University of Southampton Institutional Repository

Cooperative Control using the Max-Sum Algorithm

Cooperative Control using the Max-Sum Algorithm
Cooperative Control using the Max-Sum Algorithm
This paper presents research on enabling cooperative decision strategies in a distributed sensor network. The paper begins with an introduction to distributed sensor networks and outlines two levels of cooperation: implicit and explicit cooperation. Implicit cooperation is the process of building and maintaining a common distributed picture where explicit cooperation is the process of negotiating to agree a common distributed plan. This paper focuses on how explicit cooperation can be achieved across a distributed sensor network by exploiting factorisation in the utility function to form a factor graph. The paper describes an efficient approach to both building and solving this factor graph using the max-sum algorithm. Experimental results are presented in a simulated sensor-to-target assignment problem.
Waldock, Antony
cae54123-b67d-4fbc-81d9-d7ea6a86dfc0
Nicholson, David
c623c4fe-3db6-4760-8cd4-b4a0e564583d
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Waldock, Antony
cae54123-b67d-4fbc-81d9-d7ea6a86dfc0
Nicholson, David
c623c4fe-3db6-4760-8cd4-b4a0e564583d
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc

Waldock, Antony, Nicholson, David and Rogers, Alex (2008) Cooperative Control using the Max-Sum Algorithm. Second International Workshop on Agent Technology for Sensor Networks, Portugal.

Record type: Conference or Workshop Item (Paper)

Abstract

This paper presents research on enabling cooperative decision strategies in a distributed sensor network. The paper begins with an introduction to distributed sensor networks and outlines two levels of cooperation: implicit and explicit cooperation. Implicit cooperation is the process of building and maintaining a common distributed picture where explicit cooperation is the process of negotiating to agree a common distributed plan. This paper focuses on how explicit cooperation can be achieved across a distributed sensor network by exploiting factorisation in the utility function to form a factor graph. The paper describes an efficient approach to both building and solving this factor graph using the max-sum algorithm. Experimental results are presented in a simulated sensor-to-target assignment problem.

PDF
cooperative_contol.pdf - Version of Record
Download (420kB)

More information

Published date: 2008
Venue - Dates: Second International Workshop on Agent Technology for Sensor Networks, Portugal, 2008-01-01
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 265456
URI: https://eprints.soton.ac.uk/id/eprint/265456
PURE UUID: 38d8d3cb-bac3-457c-ad36-7e6ef95dd8f6

Catalogue record

Date deposited: 22 Apr 2008 19:20
Last modified: 18 Jul 2017 07:25

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.

×