Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms

Given a linear dynamical system affected by noise, we study the problem of optimally placing sensors (at design-time) subject to a sensor placement budget constraint in order to minimize the trace of the steady-state error covariance of the corresponding Kalman filter. While this problem is NP-hard...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:arXiv.org
Hlavní autori: Ye, Lintao, Roy, Sandip, Sundaram, Shreyas
Médium: Paper
Jazyk:English
Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 24.06.2020
Predmet:
ISSN:2331-8422
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Given a linear dynamical system affected by noise, we study the problem of optimally placing sensors (at design-time) subject to a sensor placement budget constraint in order to minimize the trace of the steady-state error covariance of the corresponding Kalman filter. While this problem is NP-hard in general, we consider the underlying graph associated with the system dynamics matrix, and focus on the case when there is a single input at one of the nodes in the graph. We provide an optimal strategy (computed in polynomial-time) to place the sensors over the network. Next, we consider the problem of attacking (i.e., removing) the placed sensors under a sensor attack budget constraint in order to maximize the trace of the steady-state error covariance of the resulting Kalman filter. Using the insights obtained for the sensor placement problem, we provide an optimal strategy (computed in polynomial-time) to attack the placed sensors. Finally, we consider the scenario where a system designer places the sensors under a sensor placement budget constraint, and an adversary then attacks the placed sensors subject to a sensor attack budget constraint. The resilient sensor placement problem is to find a sensor placement strategy to minimize the trace of the steady-state error covariance of the Kalman filter corresponding to the sensors that survive the attack. We show that this problem is NP-hard, and provide a pseudo-polynomial-time algorithm to solve it.
AbstractList Given a linear dynamical system affected by noise, we study the problem of optimally placing sensors (at design-time) subject to a sensor placement budget constraint in order to minimize the trace of the steady-state error covariance of the corresponding Kalman filter. While this problem is NP-hard in general, we consider the underlying graph associated with the system dynamics matrix, and focus on the case when there is a single input at one of the nodes in the graph. We provide an optimal strategy (computed in polynomial-time) to place the sensors over the network. Next, we consider the problem of attacking (i.e., removing) the placed sensors under a sensor attack budget constraint in order to maximize the trace of the steady-state error covariance of the resulting Kalman filter. Using the insights obtained for the sensor placement problem, we provide an optimal strategy (computed in polynomial-time) to attack the placed sensors. Finally, we consider the scenario where a system designer places the sensors under a sensor placement budget constraint, and an adversary then attacks the placed sensors subject to a sensor attack budget constraint. The resilient sensor placement problem is to find a sensor placement strategy to minimize the trace of the steady-state error covariance of the Kalman filter corresponding to the sensors that survive the attack. We show that this problem is NP-hard, and provide a pseudo-polynomial-time algorithm to solve it.
Author Roy, Sandip
Sundaram, Shreyas
Ye, Lintao
Author_xml – sequence: 1
  givenname: Lintao
  surname: Ye
  fullname: Ye, Lintao
– sequence: 2
  givenname: Sandip
  surname: Roy
  fullname: Roy, Sandip
– sequence: 3
  givenname: Shreyas
  surname: Sundaram
  fullname: Sundaram, Shreyas
BookMark eNotjUFPwyAYhonRxDn3A7yReO6kUCj1tjROjYsat3tD24_JpDCB6fbvndHTm-c5PO8FOnXeAUJXOZkWknNyo8LefE0pIWKaF4SJEzSijOWZLCg9R5MYN4QQKkrKORuh5g2isQZcwktw0Qf8alUHw6_QR3pSdlAOz41NEIxbY-PwM6RvHz6gx8tDTDDEW1z7YWthb9IBK9fjmV37YNL7EC_RmVY2wuR_x2g1v1vVD9ni5f6xni0yxSnPgDCgVQWd7AtFOtHrTrCWadl1qipBa9W2UufAcikqoYBq1VeVZJyIUsiiZGN0_ZfdBv-5g5iajd8Fd3xsaJGXJWGUcvYDOKxY4Q
ContentType Paper
Copyright 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2006.14036
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
ProQuest SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a525-e03e299ec8d4a0c6dfc63b3f8cca97effabb8f1e318696ae2fad9983506768473
IEDL.DBID BENPR
IngestDate Mon Jun 30 09:31:13 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a525-e03e299ec8d4a0c6dfc63b3f8cca97effabb8f1e318696ae2fad9983506768473
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2417703225?pq-origsite=%requestingapplication%
PQID 2417703225
PQPubID 2050157
ParticipantIDs proquest_journals_2417703225
PublicationCentury 2000
PublicationDate 20200624
PublicationDateYYYYMMDD 2020-06-24
PublicationDate_xml – month: 06
  year: 2020
  text: 20200624
  day: 24
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2020
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.726456
SecondaryResourceType preprint
Snippet Given a linear dynamical system affected by noise, we study the problem of optimally placing sensors (at design-time) subject to a sensor placement budget...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Budgets
Computation
Covariance
Kalman filters
Optimization
Placement
Polynomials
Sensors
Steady state
Strategy
System dynamics
Title Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
URI https://www.proquest.com/docview/2417703225
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagBYmJt3iUygOr1TzthAUBagUCoqjtUKbKr9BIbVqSUMG_55ymMCCxMEZeLJ9z39135-8QugxdzcHvJWABVxPP1zYRTDrEEpJL6VEtRaWu_8SiKBiNwrgm3Iq6rXLtEytHrebScOQdQBoGtxOu3_XijZipUaa6Wo_Q2ERNo1TmNVDzthvF_W-WxaEMYmZ3Vc6sxLs6PP9Il6sqhNGqo7-ccIUsvd3_7mkPNWO-0Pk-2tDZAdquOjplcYjGfV2kU_PaEQ8gVZ3nODaMuSEDMQSq-JFPZzzDvdSUywG_cJrhaNUTrhWuhcyvsPEXRjOz_MQ8U_hm-gobKCez4ggNe93h3T2ppykQ7js-0WALgB4tA-VxS1KVSOoKNwnAhCHTScKFCBLbUKI0pFw7CVeQirk-wBkFCHOPUSObZ_oEYRZyOwi1w20ReFKxwBIhZcJjyoSDzD9FrfVxjes_ohj_nNXZ38vnaMcxOa1FieO1UKPM3_UF2pLLMi3ydm3gtunRHMBX_PAcv3wBmd-1YA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60KnryjW_3oMfQdpPsJoKIqEVpDUV76C3sbjYaaFNN4qM_yv_obNLqQfDmwXMgZPLNfvPcGYAj39YCeS9GBGxtOa5uWpIrajWkEko5TCtZTtfv8CDw-n2_OwMf07swpq1yyoklUUcjZXLkdbQ0HLUT1e_s6dkyW6NMdXW6QqNSi7Yev2HIlp_eXCK-x5S2rnoX19Zkq4AlXOpaGr8JKVgrL3JEQ7EoVsyWduyhKD7XcSyk9OKmSQ0ynwlNYxFhSGK7SOsMqdzG187CnGPIv-wUvP9K6VDG0UG3q9ppOSmsLrL35LUqeZjBeOwH45dmrLX8z37ACsx1xZPOVmFGp2uwUHarqnwdwjudJwNzk5PcYxg-ykjXVANMopOgE07aYjAUKWklphUAbTNJUhJU_e46IpMh7SfEcKGZB1qMiUgjcj54QHmLx2G-Ab2_EGkTauko1VtAuC-anq-paErPURH3GtJnXDo8Mq4ud7dhb4pOODntefgNzc7vjw9h8bp32wk7N0F7F5aoid0bzKLOHtSK7EXvw7x6LZI8Oyg1i0D4x0B-Ag2ND1w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Resilient+Sensor+Placement+for+Kalman+Filtering+in+Networked+Systems%3A+Complexity+and+Algorithms&rft.jtitle=arXiv.org&rft.au=Ye%2C+Lintao&rft.au=Roy%2C+Sandip&rft.au=Sundaram%2C+Shreyas&rft.date=2020-06-24&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2006.14036