pith. sign in

arxiv: 1307.0445 · v1 · pith:N67KVK6Xnew · submitted 2013-07-01 · 💻 cs.SY · math.OC

Networked Estimation using Sparsifying Basis Prediction

classification 💻 cs.SY math.OC
keywords statebasisestimationvectorscomponentsestimatornetworkednon-zero
0
0 comments X
read the original abstract

We present a framework for networked state estimation, where systems encode their (possibly high dimensional) state vectors using a mutually agreed basis between the system and the estimator (in a remote monitoring unit). The basis sparsifies the state vectors, i.e., it represents them using vectors with few non-zero components, and as a result, the systems might need to transmit only a fraction of the original information to be able to recover the non-zero components of the transformed state vector. Hence, the estimator can recover the state vector of the system from an under-determined linear set of equations. We use a greedy search algorithm to calculate the sparsifying basis. Then, we present an upper bound for the estimation error. Finally, we demonstrate the results on a numerical example.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.