Matrix Concentration Inequalities for Sensor Selection
In this work, we address the problem of sensor selection for state estimation via Kalman filtering. We consider a linear time-invariant (LTI) dynamical system subject to process and measurement noise, where the sensors we use to perform state estimation are randomly drawn according to a sampling with replacement policy. Since our selection of sensors is randomly chosen, the estimation error covariance of the Kalman filter is also a stochastic quantity. Fortunately, concentration inequalities (CIs) for the estimation error covariance allow us to gauge the estimation performance we intend to achieve when our sensors are randomly drawn with replacement. To obtain a non-trivial improvement on existing CIs for the estimation error covariance, we first present novel matrix CIs for a sum of independent and identically-distributed (i.i.d.) and positive semi-definite (p.s.d.) random matrices, whose support is finite. Next, we show that our guarantees generalize an existing matrix CI. Also, we show that our generalized guarantees require significantly fewer number of sampled sensors to be applicable. Lastly, we show through a numerical study that our guarantees significantly outperform existing ones in terms of their ability to bound (in the semi-definite sense) the steady-state estimation error covariance of the Kalman filter.
Code (0)
등록된 구현이 없습니다.
Tasks
State EstimationSimilar Papers 제목 키워드 기반
A Concentration-Based Approach for Optimizing the Estimation Performance in Stochastic Sensor Selection
In this work, we consider a sensor selection drawn at random by a sampling with replacement policy for a linear time-invariant dynamical system subject to process and measurement noise. We employ the Kalman filter to est…
Concentration inequalities for high-dimensional linear processes with dependent innovations
We develop concentration inequalities for the $l_\infty$ norm of vector linear processes with sub-Weibull, mixingale innovations. This inequality is used to obtain a concentration bound for the maximum entrywise norm of …
Time SeriesAn Introduction to Matrix Concentration Inequalities
In recent years, random matrices have come to play a major role in computational mathematics, but most of the classical areas of random matrix theory remain the province of experts. Over the last decade, with the advent …
Concentration Inequalities for Exchangeable Tensors and Matrix-valued Data
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for th…
High-gain observer for the nitrification process including sensor dynamics
Fertilization is commonly used to increase harvests. The lack of knowledge of soil properties and the excessive use of fertilizers can result in overfertilization. Current sensor technology is able to measure the concent…
Vocal Bursts Intensity Prediction