Fast and optimal sensor scheduling for networked sensor systems

Shogo Arai, Yasushi Iwatani, Koichi Hashimoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

This paper addresses a sensor scheduling problem for a class of networked sensor systems whose sensors are spatially distributed and measurements are influenced by state dependent noise. Sensor scheduling is required to achieve power saving since each sensor operates with a battery power source. The scheduling problem is formulated as a model predictive control problem with single sensor measurement per time. It is assumed that all sensors have state dependent noise and have the same characteristics, which follows from the properties of networked sensor systems. We propose a fast and optimal sensor scheduling algorithm for a class of networked sensor systems. Computation time of the proposed algorithm is proportional to the number of sensors and does not depend on the prediction horizon. In addition, we provide a fast sensor scheduling algorithm for a general class of systems by using a linear approximation of the sensor model.

Original languageEnglish
Title of host publicationProceedings of the 47th IEEE Conference on Decision and Control, CDC 2008
Pages459-464
Number of pages6
DOIs
Publication statusPublished - 2008 Dec 1
Event47th IEEE Conference on Decision and Control, CDC 2008 - Cancun, Mexico
Duration: 2008 Dec 92008 Dec 11

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other47th IEEE Conference on Decision and Control, CDC 2008
CountryMexico
CityCancun
Period08/12/908/12/11

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Fast and optimal sensor scheduling for networked sensor systems'. Together they form a unique fingerprint.

Cite this