Fast sensor scheduling for spatially distributed sensors

Shogo Arai; Yasushi Iwatani; Koichi Hashimoto

doi:10.1109/TAC.2011.2141450

Fast sensor scheduling for spatially distributed sensors

Shogo Arai, Yasushi Iwatani, Koichi Hashimoto

Department of Mechanical and Aerospace Engineering

Research output: Contribution to journal › Article › peer-review

12 Citations (Scopus)

Abstract

This technical note 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. A concept of sensor types is introduced without loss of generality to reduce combinatorial complexity. 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. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.

Original language	English
Article number	5746507
Pages (from-to)	1900-1905
Number of pages	6
Journal	IEEE Transactions on Automatic Control
Volume	56
Issue number	8
DOIs	https://doi.org/10.1109/TAC.2011.2141450
Publication status	Published - Aug 2011

Keywords

Communication networks
control over communications
sensor networks
Sensor scheduling

Access to Document

10.1109/TAC.2011.2141450

Cite this

@article{be0ebb5d54924947b4f5d88e7200bb73,

title = "Fast sensor scheduling for spatially distributed sensors",

abstract = "This technical note 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. A concept of sensor types is introduced without loss of generality to reduce combinatorial complexity. 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. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.",

keywords = "Communication networks, control over communications, sensor networks, Sensor scheduling",

author = "Shogo Arai and Yasushi Iwatani and Koichi Hashimoto",

note = "Funding Information: Manuscript received July 06, 2009; revised February 25, 2010, October 22, 2010, and January 16, 2011; accepted April 04, 2011. Date of publication April 07, 2011; date of current version August 03, 2011. This technical note was presented in part at the 47th IEEE Conference on Decision and Control, and American Control Conferences 2009 and 2010. This work was supported in part by KAKENHI 22760309. Recommended by Associate Editor K. H. Johansson.",

year = "2011",

month = aug,

doi = "10.1109/TAC.2011.2141450",

language = "English",

volume = "56",

pages = "1900--1905",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

T1 - Fast sensor scheduling for spatially distributed sensors

AU - Arai, Shogo

AU - Iwatani, Yasushi

AU - Hashimoto, Koichi

N1 - Funding Information: Manuscript received July 06, 2009; revised February 25, 2010, October 22, 2010, and January 16, 2011; accepted April 04, 2011. Date of publication April 07, 2011; date of current version August 03, 2011. This technical note was presented in part at the 47th IEEE Conference on Decision and Control, and American Control Conferences 2009 and 2010. This work was supported in part by KAKENHI 22760309. Recommended by Associate Editor K. H. Johansson.

PY - 2011/8

Y1 - 2011/8

N2 - This technical note 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. A concept of sensor types is introduced without loss of generality to reduce combinatorial complexity. 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. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.

AB - This technical note 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. A concept of sensor types is introduced without loss of generality to reduce combinatorial complexity. 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. This confirms high speed performance of the proposed algorithm, since the number of sensor types is usually far less than the number of sensors.

KW - Communication networks

KW - control over communications

KW - sensor networks

KW - Sensor scheduling

UR - https://www.scopus.com/pages/publications/80051494766

U2 - 10.1109/TAC.2011.2141450

DO - 10.1109/TAC.2011.2141450

M3 - Article

AN - SCOPUS:80051494766

SN - 0018-9286

VL - 56

SP - 1900

EP - 1905

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 8

M1 - 5746507

ER -

Fast sensor scheduling for spatially distributed sensors

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this