291 research outputs found
A Survey on Multisensor Fusion and Consensus Filtering for Sensor Networks
Multisensor fusion and consensus filtering are two fascinating subjects in the research of sensor networks. In this survey, we will cover both classic results and recent advances developed in these two topics. First, we recall some important results in the development ofmultisensor fusion technology. Particularly, we pay great attention to the fusion with unknown correlations, which ubiquitously exist in most of distributed filtering problems. Next, we give a systematic review on several widely used consensus filtering approaches. Furthermore, some latest progress on multisensor fusion and consensus filtering is also presented. Finally,
conclusions are drawn and several potential future research directions are outlined.the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61329301, 61374039, 61304010, 11301118, and 61573246, the Hujiang Foundation of China under Grants C14002
and D15009, the Alexander von Humboldt Foundation of Germany, and the Innovation Fund Project for Graduate Student of Shanghai under Grant JWCXSL140
Networked distributed fusion estimation under uncertain outputs with random transmission delays, packet losses and multi-packet processing
This paper investigates the distributed fusion estimation problem for networked systems whose mul- tisensor measured outputs involve uncertainties modelled by random parameter matrices. Each sensor transmits its measured outputs to a local processor over different communication channels and random failures âone-step delays and packet dropoutsâare assumed to occur during the transmission. White sequences of Bernoulli random variables with different probabilities are introduced to describe the ob- servations that are used to update the estimators at each sampling time. Due to the transmission failures, each local processor may receive either one or two data packets, or even nothing and, when the current measurement does not arrive on time, its predictor is used in the design of the estimators to compensate the lack of updated information. By using an innovation approach, local least-squares linear estimators (filter and fixed-point smoother) are obtained at the individual local processors, without requiring the signal evolution model. From these local estimators, distributed fusion filtering and smoothing estimators weighted by matrices are obtained in a unified way, by applying the least-squares criterion. A simula- tion study is presented to examine the performance of the estimators and the influence that both sensor uncertainties and transmission failures have on the estimation accuracy.This research is supported by Ministerio de EconomĂa, Industria y Competitividad, Agencia Estatal de InvestigaciĂłn and Fondo Europeo de Desarrollo Regional FEDER (grant no. MTM2017-84199-P)
Two Compensation Strategies for Optimal Estimation in Sensor Networks with Random Matrices, Time-Correlated Noises, Deception Attacks and Packet Losses
Due to its great importance in several applied and theoretical fields, the signal estimation
problem in multisensor systems has grown into a significant research area. Networked systems are
known to suffer random flaws, which, if not appropriately addressed, can deteriorate the performance
of the estimators substantially. Thus, the development of estimation algorithms accounting for these
random phenomena has received a lot of research attention. In this paper, the centralized fusion linear
estimation problem is discussed under the assumption that the sensor measurements are affected
by random parameter matrices, perturbed by time-correlated additive noises, exposed to random
deception attacks and subject to random packet dropouts during transmission. A covariance-based
methodology and two compensation strategies based on measurement prediction are used to design
recursive filtering and fixed-point smoothing algorithms. The measurement differencing methodâ
typically used to deal with the measurement noise time-correlationâis unsuccessful for these kinds of
systems with packet losses because some sensor measurements are randomly lost and, consequently,
cannot be processed. Therefore, we adopt an alternative approach based on the direct estimation of
the measurement noises and the innovation technique. The two proposed compensation scenarios
are contrasted through a simulation example, in which the effect of the different uncertainties on the
estimation accuracy is also evaluated.Ministerio de Ciencia e Innovacion, Agencia Estatal de InvestigacionEuropean Commission PID2021-124486NB-I0
State Estimation with Unconventional and Networked Measurements
This dissertation consists of two main parts. One is about state estimation with two types of unconventional measurements and the other is about two types of network-induced state estimation problems. The two types of unconventional measurements considered are noise-free measurements and set measurements. State estimation with them has numerous real supports. For state estimation with noisy and noise-free measurements, two sequential forms of the batch linear minimum mean-squared error (LMMSE) estimator are obtained to reduce the computational complexity. Inspired by the estimation with quantized measurements developed by Curry [28], under a Gaussian assumption, the minimum mean-squared error (MMSE) state estimator with point measurements and set measurements of any shape is proposed by discretizing continuous set measurements. State estimation under constraints, which are special cases of the more general framework, has some interesting properties. It is found that under certain conditions, although constraints are indispensable in the evolution of the state, update by treating them as measurements is redundant in filtering. The two types of network-induced estimation problems considered are optimal state estimation in the presence of multiple packet dropouts and optimal distributed estimation fusion with transformed data. An alternative form of LMMSE estimation in the presence of multiple packet dropouts, which can overcome the shortcomings of two existing ones, is proposed first. Then under a Gaussian assumption, the MMSE estimation is also obtained based on a hard decision by comparing the measurements at two consecutive time instants. It is pointed out that if this comparison is legitimate, our simple MMSE solution largely nullifies existing work on this problem. By taking linear transformation of the raw measurements received by each sensor, two optimal distributed fusion algorithms are proposed. In terms of optimality, communication and computational requirements, three nice properties make them attractive
State Estimation with Unconventional and Networked Measurements
This dissertation consists of two main parts. One is about state estimation with two types of unconventional measurements and the other is about two types of network-induced state estimation problems. The two types of unconventional measurements considered are noise-free measurements and set measurements. State estimation with them has numerous real supports. For state estimation with noisy and noise-free measurements, two sequential forms of the batch linear minimum mean-squared error (LMMSE) estimator are obtained to reduce the computational complexity. Inspired by the estimation with quantized measurements developed by Curry [28], under a Gaussian assumption, the minimum mean-squared error (MMSE) state estimator with point measurements and set measurements of any shape is proposed by discretizing continuous set measurements. State estimation under constraints, which are special cases of the more general framework, has some interesting properties. It is found that under certain conditions, although constraints are indispensable in the evolution of the state, update by treating them as measurements is redundant in filtering. The two types of network-induced estimation problems considered are optimal state estimation in the presence of multiple packet dropouts and optimal distributed estimation fusion with transformed data. An alternative form of LMMSE estimation in the presence of multiple packet dropouts, which can overcome the shortcomings of two existing ones, is proposed first. Then under a Gaussian assumption, the MMSE estimation is also obtained based on a hard decision by comparing the measurements at two consecutive time instants. It is pointed out that if this comparison is legitimate, our simple MMSE solution largely nullifies existing work on this problem. By taking linear transformation of the raw measurements received by each sensor, two optimal distributed fusion algorithms are proposed. In terms of optimality, communication and computational requirements, three nice properties make them attractive
Remote State Estimation with Smart Sensors over Markov Fading Channels
We consider a fundamental remote state estimation problem of discrete-time
linear time-invariant (LTI) systems. A smart sensor forwards its local state
estimate to a remote estimator over a time-correlated -state Markov fading
channel, where the packet drop probability is time-varying and depends on the
current fading channel state. We establish a necessary and sufficient condition
for mean-square stability of the remote estimation error covariance as
, where denotes the
spectral radius, is the state transition matrix of the LTI system,
is a diagonal matrix containing the packet drop probabilities in
different channel states, and is the transition probability matrix
of the Markov channel states. To derive this result, we propose a novel
estimation-cycle based approach, and provide new element-wise bounds of matrix
powers. The stability condition is verified by numerical results, and is shown
more effective than existing sufficient conditions in the literature. We
observe that the stability region in terms of the packet drop probabilities in
different channel states can either be convex or concave depending on the
transition probability matrix . Our numerical results suggest that
the stability conditions for remote estimation may coincide for setups with a
smart sensor and with a conventional one (which sends raw measurements to the
remote estimator), though the smart sensor setup achieves a better estimation
performance.Comment: The paper has been accepted by IEEE Transactions on Automatic
Control. Copyright may be transferred without notice, after which this
version may no longer be accessibl
Compressive Privacy for a Linear Dynamical System
We consider a linear dynamical system in which the state vector consists of
both public and private states. One or more sensors make measurements of the
state vector and sends information to a fusion center, which performs the final
state estimation. To achieve an optimal tradeoff between the utility of
estimating the public states and protection of the private states, the
measurements at each time step are linearly compressed into a lower dimensional
space. Under the centralized setting where all measurements are collected by a
single sensor, we propose an optimization problem and an algorithm to find the
best compression matrix. Under the decentralized setting where measurements are
made separately at multiple sensors, each sensor optimizes its own local
compression matrix. We propose methods to separate the overall optimization
problem into multiple sub-problems that can be solved locally at each sensor.
We consider the cases where there is no message exchange between the sensors;
and where each sensor takes turns to transmit messages to the other sensors.
Simulations and empirical experiments demonstrate the efficiency of our
proposed approach in allowing the fusion center to estimate the public states
with good accuracy while preventing it from estimating the private states
accurately
State Estimation Fusion for Linear Microgrids over an Unreliable Network
Microgrids should be continuously monitored in order to maintain suitable voltages over
time. Microgrids are mainly monitored remotely, and their measurement data transmitted through
lossy communication networks are vulnerable to cyberattacks and packet loss. The current study
leverages the idea of data fusion to address this problem. Hence, this paper investigates the effects of
estimation fusion using various machine-learning (ML) regression methods as data fusion methods
by aggregating the distributed Kalman filter (KF)-based state estimates of a linear smart microgrid
in order to achieve more accurate and reliable state estimates. This unreliability in measurements
is because they are received through a lossy communication network that incorporates packet loss
and cyberattacks. In addition to ML regression methods, multi-layer perceptron (MLP) and dependent
ordered weighted averaging (DOWA) operators are also employed for further comparisons.
The results of simulation on the IEEE 4-bus model validate the effectiveness of the employed ML
regression methods through the RMSE, MAE and R-squared indices under the condition of missing
and manipulated measurements. In general, the results obtained by the Random Forest regression
method were more accurate than those of other methods.This research was partially funded by public research projects of Spanish Ministry of
Science and Innovation, references PID2020-118249RB-C22 and PDC2021-121567-C22 - AEI/10.13039/
501100011033, and by the Madrid Government (Comunidad de Madrid-Spain) under the Multiannual
Agreement with UC3M in the line of Excellence of University Professors, reference EPUC3M17
Networked fusion estimation with multiple uncertainties and time-correlated channel noise
This paper is concerned with the fusion filtering and fixed-point smoothing problems for a class of networked
systems with multiple random uncertainties in both the sensor outputs and the transmission connections. To deal
with this kind of systems, random parameter matrices are considered in the mathematical models of both the
sensor measurements and the data available after transmission. The additive noise in the transmission channel
from each sensor is assumed to be sequentially time-correlated. By using the time-differencing approach, the
available measurements are transformed into an equivalent set of observations that do not depend on the timecorrelated
noise. The innovation approach is then applied to obtain recursive distributed and centralized fusion
estimation algorithms for the filtering and fixed-point smoothing estimators of the signal based on the transformed
measurements, which are equal to the estimators based on the original ones. The derivation of the algorithms
does not require the knowledge of the signal evolution model, but only the mean and covariance functions of
the processes involved (covariance information). A simulation example illustrates the utility and effectiveness of
the proposed fusion estimation algorithms, as well as the applicability of the current model to deal with different
network-induced random phenomena.This research is supported by Ministerio de EconomĂa, Industria y Competitividad, Agencia Estatal de InvestigaciĂłn and Fondo Europeo de Desarrollo Regional FEDER (grant no. MTM2017-84199-P)
Estimation over Communication Networks: Performance Bounds and Achievability Results
This paper considers the problem of estimation over communication networks. Suppose a sensor is taking measurements of a dynamic process. However the process needs to be estimated at a remote location connected to the sensor through a network of communication links that drop packets stochastically. We provide a framework for computing the optimal performance in the sense of expected error covariance. Using this framework we characterize the dependency of the performance on the topology of the network and the packet dropping process. For independent and memoryless packet dropping processes we find the steady-state error for some classes of networks and obtain lower and upper bounds for the performance of a general network. Finally we find a necessary and sufficient condition for the stability of the estimate error covariance for general networks with spatially correlated and Markov type dropping process. This interesting condition has a max-cut interpretation
- âŠ