An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems

Vishnu Vijayaraghavan, Kiavash Kianfar, Yu DIng, Hamid Parsaei

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

Abstract

Linear models have been successfully used to establish the connections between sensor measurements and system states in sensor networks. Finding the degree of redundancy for structured linear systems is proven to be NP-hard. Previously bound-and-decompose, 0-1 mixed integer programming and hybrid algorithms embedding 0-1 mixed integer feasibility checking within a bound-and-decompose framework have all been proposed and compared in the literature. In this paper, we exploit the computational efficiency of linear programs to present a novel heuristic algorithm which solves a series of l1-norm minimization problems in a specific framework to find extremely good solutions to this problem in remarkably small runtime.

Original languageEnglish
Title of host publication2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017
PublisherIEEE Computer Society
Pages424-428
Number of pages5
Volume2017-August
ISBN (Electronic)9781509067800
DOIs
Publication statusPublished - 12 Jan 2018
Event13th IEEE Conference on Automation Science and Engineering, CASE 2017 - Xi'an, China
Duration: 20 Aug 201723 Aug 2017

Other

Other13th IEEE Conference on Automation Science and Engineering, CASE 2017
CountryChina
CityXi'an
Period20/8/1723/8/17

Fingerprint

Integer programming
Heuristic algorithms
Computational efficiency
Sensor networks
Redundancy
Linear systems
Sensors

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Vijayaraghavan, V., Kianfar, K., DIng, Y., & Parsaei, H. (2018). An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. In 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017 (Vol. 2017-August, pp. 424-428). IEEE Computer Society. https://doi.org/10.1109/COASE.2017.8256141

An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. / Vijayaraghavan, Vishnu; Kianfar, Kiavash; DIng, Yu; Parsaei, Hamid.

2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August IEEE Computer Society, 2018. p. 424-428.

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

Vijayaraghavan, V, Kianfar, K, DIng, Y & Parsaei, H 2018, An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. in 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. vol. 2017-August, IEEE Computer Society, pp. 424-428, 13th IEEE Conference on Automation Science and Engineering, CASE 2017, Xi'an, China, 20/8/17. https://doi.org/10.1109/COASE.2017.8256141
Vijayaraghavan V, Kianfar K, DIng Y, Parsaei H. An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. In 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August. IEEE Computer Society. 2018. p. 424-428 https://doi.org/10.1109/COASE.2017.8256141
Vijayaraghavan, Vishnu ; Kianfar, Kiavash ; DIng, Yu ; Parsaei, Hamid. / An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems. 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August IEEE Computer Society, 2018. pp. 424-428
@inproceedings{5f734b94cd904b01bfb86341dfbeec12,
title = "An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems",
abstract = "Linear models have been successfully used to establish the connections between sensor measurements and system states in sensor networks. Finding the degree of redundancy for structured linear systems is proven to be NP-hard. Previously bound-and-decompose, 0-1 mixed integer programming and hybrid algorithms embedding 0-1 mixed integer feasibility checking within a bound-and-decompose framework have all been proposed and compared in the literature. In this paper, we exploit the computational efficiency of linear programs to present a novel heuristic algorithm which solves a series of l1-norm minimization problems in a specific framework to find extremely good solutions to this problem in remarkably small runtime.",
author = "Vishnu Vijayaraghavan and Kiavash Kianfar and Yu DIng and Hamid Parsaei",
year = "2018",
month = "1",
day = "12",
doi = "10.1109/COASE.2017.8256141",
language = "English",
volume = "2017-August",
pages = "424--428",
booktitle = "2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems

AU - Vijayaraghavan, Vishnu

AU - Kianfar, Kiavash

AU - DIng, Yu

AU - Parsaei, Hamid

PY - 2018/1/12

Y1 - 2018/1/12

N2 - Linear models have been successfully used to establish the connections between sensor measurements and system states in sensor networks. Finding the degree of redundancy for structured linear systems is proven to be NP-hard. Previously bound-and-decompose, 0-1 mixed integer programming and hybrid algorithms embedding 0-1 mixed integer feasibility checking within a bound-and-decompose framework have all been proposed and compared in the literature. In this paper, we exploit the computational efficiency of linear programs to present a novel heuristic algorithm which solves a series of l1-norm minimization problems in a specific framework to find extremely good solutions to this problem in remarkably small runtime.

AB - Linear models have been successfully used to establish the connections between sensor measurements and system states in sensor networks. Finding the degree of redundancy for structured linear systems is proven to be NP-hard. Previously bound-and-decompose, 0-1 mixed integer programming and hybrid algorithms embedding 0-1 mixed integer feasibility checking within a bound-and-decompose framework have all been proposed and compared in the literature. In this paper, we exploit the computational efficiency of linear programs to present a novel heuristic algorithm which solves a series of l1-norm minimization problems in a specific framework to find extremely good solutions to this problem in remarkably small runtime.

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

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

U2 - 10.1109/COASE.2017.8256141

DO - 10.1109/COASE.2017.8256141

M3 - Conference contribution

VL - 2017-August

SP - 424

EP - 428

BT - 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017

PB - IEEE Computer Society

ER -