On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering

Given a linear dynamical system affected by stochastic noise, we consider the problem of selecting an optimal set of sensors (at design time) to minimize the trace of the steady-state a priori or a posteriori error covariance of the Kalman filter, subject to certain selection budget constraints. We...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 66; číslo 5; s. 2146 - 2161
Hlavní autori:	Ye, Lintao, Woodford, Nathaniel, Roy, Sandip, Sundaram, Shreyas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Approximation Approximation algorithms Budgets Computational complexity Cost function Covariance Covariance matrices Estimation error Greedy algorithms Kalman filters Mathematical analysis Noise measurement optimization Polynomials sensor systems Sensors state estimation Steady state Time constant
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!