23,542 research outputs found
Distributed L1-state-and-fault estimation for Multi-agent systems
In this paper, we propose a distributed state-and-fault estimation scheme for
multi-agent systems. The proposed estimator is based on an -norm
optimization problem, which is inspired by sparse signal recovery in the field
of compressive sampling. Two theoretical results are given to analyze the
correctness of the proposed approach. First, we provide a necessary and
sufficient condition such that state and fault signals are correctly estimated.
The result presents a fundamental limitation of the algorithm, which shows how
many faulty nodes are allowed to ensure a correct estimation. Second, we
provide a sufficient condition for the estimation error of fault signals when
numerical errors of solving the optimization problem are present. An
illustrative example is given to validate the effectiveness of the proposed
approach
Modeling and performance evaluation of stealthy false data injection attacks on smart grid in the presence of corrupted measurements
The false data injection (FDI) attack cannot be detected by the traditional
anomaly detection techniques used in the energy system state estimators. In
this paper, we demonstrate how FDI attacks can be constructed blindly, i.e.,
without system knowledge, including topological connectivity and line reactance
information. Our analysis reveals that existing FDI attacks become detectable
(consequently unsuccessful) by the state estimator if the data contains grossly
corrupted measurements such as device malfunction and communication errors. The
proposed sparse optimization based stealthy attacks construction strategy
overcomes this limitation by separating the gross errors from the measurement
matrix. Extensive theoretical modeling and experimental evaluation show that
the proposed technique performs more stealthily (has less relative error) and
efficiently (fast enough to maintain time requirement) compared to other
methods on IEEE benchmark test systems.Comment: Keywords: Smart grid, False data injection, Blind attack, Principal
component analysis (PCA), Journal of Computer and System Sciences, Elsevier,
201
Adaptive sensing performance lower bounds for sparse signal detection and support estimation
This paper gives a precise characterization of the fundamental limits of
adaptive sensing for diverse estimation and testing problems concerning sparse
signals. We consider in particular the setting introduced in (IEEE Trans.
Inform. Theory 57 (2011) 6222-6235) and show necessary conditions on the
minimum signal magnitude for both detection and estimation: if is a sparse vector with non-zero components then it
can be reliably detected in noise provided the magnitude of the non-zero
components exceeds . Furthermore, the signal support can be exactly
identified provided the minimum magnitude exceeds . Notably
there is no dependence on , the extrinsic signal dimension. These results
show that the adaptive sensing methodologies proposed previously in the
literature are essentially optimal, and cannot be substantially improved. In
addition, these results provide further insights on the limits of adaptive
compressive sensing.Comment: Published in at http://dx.doi.org/10.3150/13-BEJ555 the Bernoulli
(http://isi.cbs.nl/bernoulli/) by the International Statistical
Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm
Data based identification and prediction of nonlinear and complex dynamical systems
We thank Dr. R. Yang (formerly at ASU), Dr. R.-Q. Su (formerly at ASU), and Mr. Zhesi Shen for their contributions to a number of original papers on which this Review is partly based. This work was supported by ARO under Grant No. W911NF-14-1-0504. W.-X. Wang was also supported by NSFC under Grants No. 61573064 and No. 61074116, as well as by the Fundamental Research Funds for the Central Universities, Beijing Nova Programme.Peer reviewedPostprin
Sparsity Order Estimation from a Single Compressed Observation Vector
We investigate the problem of estimating the unknown degree of sparsity from
compressive measurements without the need to carry out a sparse recovery step.
While the sparsity order can be directly inferred from the effective rank of
the observation matrix in the multiple snapshot case, this appears to be
impossible in the more challenging single snapshot case. We show that specially
designed measurement matrices allow to rearrange the measurement vector into a
matrix such that its effective rank coincides with the effective sparsity
order. In fact, we prove that matrices which are composed of a Khatri-Rao
product of smaller matrices generate measurements that allow to infer the
sparsity order. Moreover, if some samples are used more than once, one of the
matrices needs to be Vandermonde. These structural constraints reduce the
degrees of freedom in choosing the measurement matrix which may incur in a
degradation in the achievable coherence. We thus also address suitable choices
of the measurement matrices. In particular, we analyze Khatri-Rao and
Vandermonde matrices in terms of their coherence and provide a new design for
Vandermonde matrices that achieves a low coherence
- …