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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on control of network systems Jg. 7; H. 4; S. 1870 - 1881
Hauptverfasser:	Ye, Lintao, Roy, Sandip, Sundaram, Shreyas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.12.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Budgets Computation Control systems Covariance Directed graphs Heuristic algorithms Kalman filters networked control systems Optimization Placement Polynomials sensor systems Sensors state estimation Steady state Stochastic processes Strategy System dynamics
ISSN:	2325-5870, 2372-2533
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!