Fast sensor scheduling for spatially distributed heterogeneous sensors

Shogo Arai, Yasushi Iwatani, Koichi Hashimoto

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

17 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. A networked sensor system usually consists of a large number of sensors, but the sensors can be classified into a few different types. We therefore introduce a concept of sensor types in the sensor model to provide a fast and optimal sensor scheduling algorithm for a class of networked sensor systems, where the sensor scheduling problem is formulated as a model predictive control problem. The computation time of the proposed algorithm increases exponentially with the number of the sensor types, while that of standard algorithms is exponential in the number of the sensors. In addition, we propose a fast sensor scheduling algorithm for a general class of networked sensor systems by using a linear approximation of the sensor model.

Original languageEnglish
Title of host publication2009 American Control Conference, ACC 2009
Pages2785-2790
Number of pages6
DOIs
Publication statusPublished - 2009 Nov 23
Event2009 American Control Conference, ACC 2009 - St. Louis, MO, United States
Duration: 2009 Jun 102009 Jun 12

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2009 American Control Conference, ACC 2009
CountryUnited States
CitySt. Louis, MO
Period09/6/1009/6/12

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast sensor scheduling for spatially distributed heterogeneous sensors'. Together they form a unique fingerprint.

Cite this