10 research outputs found
Distributed Kalman Estimation with Decoupled Local Filters
We study a distributed Kalman filtering problem in which a number of nodes
cooperate without central coordination to estimate a common state based on
local measurements and data received from neighbors. This is typically done by
running a local filter at each node using information obtained through some
procedure for fusing data across the network. A common problem with existing
methods is that the outcome of local filters at each time step depends on the
data fused at the previous step. We propose an alternative approach to
eliminate this error propagation. The proposed local filters are guaranteed to
be stable under some mild conditions on certain global structural data, and
their fusion yields the centralized Kalman estimate. The main feature of the
new approach is that fusion errors introduced at a given time step do not carry
over to subsequent steps. This offers advantages in many situations including
when a global estimate in only needed at a rate slower than that of
measurements or when there are network interruptions. If the global structural
data can be fused correctly asymptotically, the stability of local filters is
equivalent to that of the centralized Kalman filter. Otherwise, we provide
conditions to guarantee stability and bound the resulting estimation error.
Numerical experiments are given to show the advantage of our method over other
existing alternatives
Statistical Approach to Detection of Attacks for Stochastic Cyber-Physical Systems
We study the problem of detecting an attack on a stochastic cyber-physical
system. We aim to treat the problem in its most general form. We start by
introducing the notion of asymptotically detectable attacks, as those attacks
introducing changes to the system's output statistics which persist
asymptotically. We then provide a necessary and sufficient condition for
asymptotic detectability. This condition preserves generality as it holds under
no restrictive assumption on the system and attacking scheme. To show the
importance of this condition, we apply it to detect certain attacking schemes
which are undetectable using simple statistics. Our necessary and sufficient
condition naturally leads to an algorithm which gives a confidence level for
attack detection. We present simulation results to illustrate the performance
of this algorithm
Distributed Kalman estimation with decoupled local filters
We study a distributed Kalman filtering problem in which a number of nodes cooperate without central coordination to estimate a common state based on local measurements and data received from neighbors. This is typically done by running a local filter at each node using information obtained through some procedure for fusing data across the network. A common problem with existing methods is that the outcome of local filters at each time step depends on the data fused at the previous step. We propose an alternative approach to eliminate this error propagation. The proposed local filters are guaranteed to be stable under some mild conditions on certain global structural data, and their fusion yields the centralized Kalman estimate. The main feature of the new approach is that fusion errors introduced at a given time step do not carry over to subsequent steps. This offers advantages in many situations including when a global estimate is only needed at a rate slower than that of measurements or when there are network interruptions. If the global structural data can be fused correctly asymptotically, the stability of local filters is equivalent to that of the centralized Kalman filter. Otherwise, we provide conditions to guarantee stability and bound the resulting estimation error. Numerical experiments are given to show the advantage of our method over other existing alternatives.Fil: Marelli, Damian Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Guangdong University Of Technology; ChinaFil: Sui, Tianju. Dalian University Of Technology; ChinaFil: Fu, Minyue. Universidad de Newcastle; Australi
The Vulnerability of Cyber-Physical System Under Stealthy Attacks
In this article, we study the impact of stealthy attacks on the cyber-physical system (CPS) modeled as a stochastic linear system. An attack is characterised by a malicious injection into the system through input, output or both, and it is called stealthy (resp. strictly stealthy) if it produces bounded changes (resp. no changes) in the detection residue. Correspondingly, a CPS is called vulnerable (resp. strictly vulnerable) if it can be destabilized by a stealthy attack (resp. strictly stealthy attack). We provide necessary and sufficient conditions for the vulnerability and strictly vulnerability. For the invulnerable case, we also provide a performance bound for the difference between healthy and attacked system. Numerical examples are provided to illustrate the theoretical results.Fil: Sui, Tianju. Dalian University of Technology; ChinaFil: Mo, Yilin. Tsinghua University; ChinaFil: Marelli, Damian Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; ArgentinaFil: Sun, Ximing. Dalian University of Technology; Chin
Accuracy analysis for distributed weighted least-squares estimation in finite steps and loopy networks
Distributed parameter estimation for large-scale systems is an active research problem. The goal is to derive a distributed algorithm in which each agent obtains a local estimate of its own subset of the global parameter vector, based on local measurements as well as information received from its neighbors. A recent algorithm has been proposed, which yields the optimal solution (i.e., the one that would be obtained using a centralized method) in finite time, provided the communication network forms an acyclic graph. If instead, the graph is cyclic, the only available alternative algorithm, which is based on iterative matrix inversion, achieving the optimal solution, does so asymptotically. However, it is also known that, in the cyclic case, the algorithm designed for acyclic graphs produces a solution which, although non optimal, is highly accurate. In this paper we do a theoretical study of the accuracy of this algorithm, in communication networks forming cyclic graphs. To this end, we provide bounds for the sub-optimality of the estimation error and the estimation error covariance, for a class of systems whose topological sparsity and signal-to-noise ratio satisfy certain condition. Our results show that, at each node, the accuracy improves exponentially with the so-called loop-free depth. Also, although the algorithm no longer converges in finite time in the case of cyclic graphs, simulation results show that the convergence is significantly faster than that of methods based on iterative matrix inversion. Our results suggest that, depending on the loop-free depth, the studied algorithm may be the preferred option even in applications with cyclic communication graphs.Fil: Sui, Tianju. Dalian University of Technology; ChinaFil: Marelli, Damian Edgardo. Guandong University of Technology; China. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; ArgentinaFil: Fu, Minyue. Guandong University of Technology; China. Universidad de Newcastle; AustraliaFil: Lu, Renquan. Guandong University of Technology; Chin
Multi-sensor state estimation over lossy channels using coded measurements
This paper focuses on a networked state estimation problem for a spatially large linear system with a distributed array of sensors, each of which offers partial state measurements, and the transmission is lossy. We propose a measurement coding scheme with two goals. Firstly, it permits adjusting the communication requirements by controlling the dimension of the vector transmitted by each sensor to the central estimator. Secondly, for a given communication requirement, the scheme is optimal, within the family of linear causal coders, in the sense that the weakest channel condition is required to guarantee the stability of the estimator. For this coding scheme, we derive the minimum mean-square error (MMSE) state estimator, and state a necessary and sufficient condition with a trivial gap, for its stability. We also derive a sufficient but easily verifiable stability condition, and quantify the advantage offered by the proposed coding scheme. Finally, simulations results are presented to confirm our claims.Fil: Sui, Tianju. Dalian University of Technology; República de ChinaFil: Marelli, Damian Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; Argentina. Guangdong University of Technology; República de ChinaFil: Sun, Ximing. Dalian University of Technology; República de ChinaFil: Fu, Minyue. Universidad de Newcastle; Australi
Convergence and Accuracy Analysis for a Distributed Static State Estimator based on Gaussian Belief Propagation
This paper focuses on the distributed static estimation problem and a Belief Propagation (BP) based estimation algorithm is proposed. We provide a complete analysis for convergence and accuracy of it. More precisely, we offer conditions under which the proposed distributed estimator is guaranteed to converge and we give concrete characterizations of its accuracy. Our results not only give a new algorithm with good performance but also provide a useful analysis framework to learn the properties of a distributed algorithm. It yields better theoretical understanding of the static distributed state estimator and may generate more applications in the future.Fil: Marelli, Damian Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; ArgentinaFil: Sui, Tianju. Dalian University of Technology; ChinaFil: Fu, Minyue. Universidad de Newcastle; AustraliaFil: Sun, Ximing. Dalian University of Technology; Chin