Maximizing utility of sensor-mission assignment with uncertain demands

Pizzocaro, Diego ORCID: https://orcid.org/0000-0003-1976-8805, Johnson, M., Rowaihy, H., Chalmers, S., Preece, Alun David ORCID: https://orcid.org/0000-0003-0349-9057, Bar-Noy, A. and La Porta, T. F. 2008. Maximizing utility of sensor-mission assignment with uncertain demands. Presented at: 2nd Annual Conference of the International Technology Alliance (ACITA) 2008, London, UK, 16-18 September 2008.

Full text not available from this repository.

Abstract

A sensor network is usually required to support multiple missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are characterized by an uncertain demand for sensing resource capabilities. We model this assignment problem by introducing the Sensor Utility Maximization (SUM) model. SUM is NP-Complete and is a special case of the well known Generalized Assignment Problem (GAP). We compare a pre-existing algorithm developed for GAP with a new greedy algorithm which offers the best trade-off between quality of solution and computation cost.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Related URLs:	https://www.usukitacs.com/acita2008 https://www.usukitacs.com/node/1483
Last Modified:	11 Jun 2023 01:18
URI:	https://orca.cardiff.ac.uk/id/eprint/20112

Citation Data

Actions (repository staff only)

Edit Item