Sensor scheduling via compressed sensing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We present a novel approach for sensor scheduling which is, in general, a NP-hard problem involving the selection of S out of N sensors such that an optimal filtering performance is attained. Our approach utilizes a heuristic measure that quantifies the incoherence of the vector space defined by the sensors with respect to the system principal directions. This in turn facilitates the formulation of a convex relaxation that can be efficiently solved using a myriad of compressed sensing algorithms.

Original languageEnglish
Title of host publication13th Conference on Information Fusion, Fusion 2010
PublisherIEEE Computer Society
ISBN (Print)9780982443811
DOIs
StatePublished - 1 Jan 2010
Externally publishedYes

Publication series

Name13th Conference on Information Fusion, Fusion 2010

Keywords

  • Compressed sensing
  • Estimability
  • Sensor networks
  • Sensor selection

ASJC Scopus subject areas

  • Information Systems

Fingerprint

Dive into the research topics of 'Sensor scheduling via compressed sensing'. Together they form a unique fingerprint.

Cite this