Optimal periodic sensor scheduling in networks of dynamical systems

Sijia Liu, Makan Fardad, Pramod Kumar Varshney, Engin Masazade

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

We consider the problem of finding optimal time-periodic sensor schedules for estimating the state of discrete-time dynamical systems. We assume that multiple sensors have been deployed and that the sensors are subject to resource constraints, which limits the number of times each can be activated over one period of the periodic schedule. We seek an algorithm that strikes a balance between estimation accuracy and total sensor activations over one period. We make a correspondence between active sensors and the nonzero columns of the estimator gain. We formulate an optimization problem in which we minimize the trace of the error covariance with respect to the estimator gain while simultaneously penalizing the number of nonzero columns of the estimator gain. This optimization problem is combinatorial in nature, and we employ the alternating direction method of multipliers (ADMM) to find its locally optimal solutions. Numerical results and comparisons with other sensor scheduling algorithms in the literature are provided to illustrate the effectiveness of our proposed method.

Original languageEnglish (US)
Article number6805223
Pages (from-to)3055-3068
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume62
Issue number12
DOIs
StatePublished - Jun 15 2014

Fingerprint

Dynamical systems
Scheduling
Sensors
Scheduling algorithms
Chemical activation

Keywords

  • Alternating direction method of multipliers
  • dynamical systems
  • optimization
  • sensor networks
  • sensor scheduling
  • sparsity
  • state estimation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Optimal periodic sensor scheduling in networks of dynamical systems. / Liu, Sijia; Fardad, Makan; Varshney, Pramod Kumar; Masazade, Engin.

In: IEEE Transactions on Signal Processing, Vol. 62, No. 12, 6805223, 15.06.2014, p. 3055-3068.

Research output: Contribution to journalArticle

@article{d3d7f0de0b8c45a78d874fac7b2c85be,
title = "Optimal periodic sensor scheduling in networks of dynamical systems",
abstract = "We consider the problem of finding optimal time-periodic sensor schedules for estimating the state of discrete-time dynamical systems. We assume that multiple sensors have been deployed and that the sensors are subject to resource constraints, which limits the number of times each can be activated over one period of the periodic schedule. We seek an algorithm that strikes a balance between estimation accuracy and total sensor activations over one period. We make a correspondence between active sensors and the nonzero columns of the estimator gain. We formulate an optimization problem in which we minimize the trace of the error covariance with respect to the estimator gain while simultaneously penalizing the number of nonzero columns of the estimator gain. This optimization problem is combinatorial in nature, and we employ the alternating direction method of multipliers (ADMM) to find its locally optimal solutions. Numerical results and comparisons with other sensor scheduling algorithms in the literature are provided to illustrate the effectiveness of our proposed method.",
keywords = "Alternating direction method of multipliers, dynamical systems, optimization, sensor networks, sensor scheduling, sparsity, state estimation",
author = "Sijia Liu and Makan Fardad and Varshney, {Pramod Kumar} and Engin Masazade",
year = "2014",
month = "6",
day = "15",
doi = "10.1109/TSP.2014.2320455",
language = "English (US)",
volume = "62",
pages = "3055--3068",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Optimal periodic sensor scheduling in networks of dynamical systems

AU - Liu, Sijia

AU - Fardad, Makan

AU - Varshney, Pramod Kumar

AU - Masazade, Engin

PY - 2014/6/15

Y1 - 2014/6/15

N2 - We consider the problem of finding optimal time-periodic sensor schedules for estimating the state of discrete-time dynamical systems. We assume that multiple sensors have been deployed and that the sensors are subject to resource constraints, which limits the number of times each can be activated over one period of the periodic schedule. We seek an algorithm that strikes a balance between estimation accuracy and total sensor activations over one period. We make a correspondence between active sensors and the nonzero columns of the estimator gain. We formulate an optimization problem in which we minimize the trace of the error covariance with respect to the estimator gain while simultaneously penalizing the number of nonzero columns of the estimator gain. This optimization problem is combinatorial in nature, and we employ the alternating direction method of multipliers (ADMM) to find its locally optimal solutions. Numerical results and comparisons with other sensor scheduling algorithms in the literature are provided to illustrate the effectiveness of our proposed method.

AB - We consider the problem of finding optimal time-periodic sensor schedules for estimating the state of discrete-time dynamical systems. We assume that multiple sensors have been deployed and that the sensors are subject to resource constraints, which limits the number of times each can be activated over one period of the periodic schedule. We seek an algorithm that strikes a balance between estimation accuracy and total sensor activations over one period. We make a correspondence between active sensors and the nonzero columns of the estimator gain. We formulate an optimization problem in which we minimize the trace of the error covariance with respect to the estimator gain while simultaneously penalizing the number of nonzero columns of the estimator gain. This optimization problem is combinatorial in nature, and we employ the alternating direction method of multipliers (ADMM) to find its locally optimal solutions. Numerical results and comparisons with other sensor scheduling algorithms in the literature are provided to illustrate the effectiveness of our proposed method.

KW - Alternating direction method of multipliers

KW - dynamical systems

KW - optimization

KW - sensor networks

KW - sensor scheduling

KW - sparsity

KW - state estimation

UR - http://www.scopus.com/inward/record.url?scp=84901348060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901348060&partnerID=8YFLogxK

U2 - 10.1109/TSP.2014.2320455

DO - 10.1109/TSP.2014.2320455

M3 - Article

VL - 62

SP - 3055

EP - 3068

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 12

M1 - 6805223

ER -