.png){kind=icon}
.png){kind=icon}
Return
Space-Time Sampling for Network Observability
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2022.3223735.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Designing sparse sampling strategies is crucial in having resilient estimation and control in networked systems as they make sampling less expensive and networks more resilient w.r.t where and when samples are collected. It is shown under what conditions taking coarse samples from a network will contain the same amount of information as a finer set of samples. Our goal is to estimate the initial condition of linear time-invariant networks using a set of noisy measurements. The observability condition is reformulated as the frame condition, where one can easily trace the location and time stamps of each sample. We compare the estimation quality of various sampling strategies using estimation measures, which depend on the spectrum of the corresponding frame operators. Using properties of the minimal polynomial of the state matrix, deterministic and randomized methods are suggested to construct observability frames. Intrinsic tradeoffs assert that collecting samples from fewer subsystems dictates taking more samples (in average) per subsystem. Three scalable algorithms are developed to generate sparse space-time sampling strategies with explicit error bounds.
Keywords:
Observability
Estimation
Sensors
Network systems
Controllability
Sparse matrices
Random variables
Networked control systems
state estimation
signal sampling
sparse sampling
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K
