3,554 research outputs found
Secure Distributed Dynamic State Estimation in Wide-Area Smart Grids
Smart grid is a large complex network with a myriad of vulnerabilities,
usually operated in adversarial settings and regulated based on estimated
system states. In this study, we propose a novel highly secure distributed
dynamic state estimation mechanism for wide-area (multi-area) smart grids,
composed of geographically separated subregions, each supervised by a local
control center. We firstly propose a distributed state estimator assuming
regular system operation, that achieves near-optimal performance based on the
local Kalman filters and with the exchange of necessary information between
local centers. To enhance the security, we further propose to (i) protect the
network database and the network communication channels against attacks and
data manipulations via a blockchain (BC)-based system design, where the BC
operates on the peer-to-peer network of local centers, (ii) locally detect the
measurement anomalies in real-time to eliminate their effects on the state
estimation process, and (iii) detect misbehaving (hacked/faulty) local centers
in real-time via a distributed trust management scheme over the network. We
provide theoretical guarantees regarding the false alarm rates of the proposed
detection schemes, where the false alarms can be easily controlled. Numerical
studies illustrate that the proposed mechanism offers reliable state estimation
under regular system operation, timely and accurate detection of anomalies, and
good state recovery performance in case of anomalies
Multi-Target Tracking in Distributed Sensor Networks using Particle PHD Filters
Multi-target tracking is an important problem in civilian and military
applications. This paper investigates multi-target tracking in distributed
sensor networks. Data association, which arises particularly in multi-object
scenarios, can be tackled by various solutions. We consider sequential Monte
Carlo implementations of the Probability Hypothesis Density (PHD) filter based
on random finite sets. This approach circumvents the data association issue by
jointly estimating all targets in the region of interest. To this end, we
develop the Diffusion Particle PHD Filter (D-PPHDF) as well as a centralized
version, called the Multi-Sensor Particle PHD Filter (MS-PPHDF). Their
performance is evaluated in terms of the Optimal Subpattern Assignment (OSPA)
metric, benchmarked against a distributed extension of the Posterior
Cram\'er-Rao Lower Bound (PCRLB), and compared to the performance of an
existing distributed PHD Particle Filter. Furthermore, the robustness of the
proposed tracking algorithms against outliers and their performance with
respect to different amounts of clutter is investigated.Comment: 27 pages, 6 figure
Outlier-Detection Based Robust Information Fusion for Networked Systems
We consider state estimation for networked systems where measurements from
sensor nodes are contaminated by outliers. A new hierarchical measurement model
is formulated for outlier detection by integrating the outlier-free measurement
model with a binary indicator variable. The binary indicator variable, which is
assigned a beta-Bernoulli prior, is utilized to characterize if the sensor's
measurement is nominal or an outlier. Based on the proposed outlier-detection
measurement model, both centralized and decentralized information fusion
filters are developed. Specifically, in the centralized approach, all
measurements are sent to a fusion center where the state and outlier indicators
are jointly estimated by employing the mean-field variational Bayesian
inference in an iterative manner. In the decentralized approach, however, every
node shares its information, including the prior and likelihood, only with its
neighbors based on a hybrid consensus strategy. Then each node independently
performs the estimation task based on its own and shared information. In
addition, an approximation distributed solution is proposed to reduce the local
computational complexity and communication overhead. Simulation results reveal
that the proposed algorithms are effective in dealing with outliers compared
with several recent robust solutions
Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Age
Simultaneous Localization and Mapping (SLAM)consists in the concurrent
construction of a model of the environment (the map), and the estimation of the
state of the robot moving within it. The SLAM community has made astonishing
progress over the last 30 years, enabling large-scale real-world applications,
and witnessing a steady transition of this technology to industry. We survey
the current state of SLAM. We start by presenting what is now the de-facto
standard formulation for SLAM. We then review related work, covering a broad
set of topics including robustness and scalability in long-term mapping, metric
and semantic representations for mapping, theoretical performance guarantees,
active SLAM and exploration, and other new frontiers. This paper simultaneously
serves as a position paper and tutorial to those who are users of SLAM. By
looking at the published research with a critical eye, we delineate open
challenges and new research issues, that still deserve careful scientific
investigation. The paper also contains the authors' take on two questions that
often animate discussions during robotics conferences: Do robots need SLAM? and
Is SLAM solved
Robust Distributed Parameter Estimation in Wireless Sensor Networks
abstract: Fully distributed wireless sensor networks (WSNs) without fusion center have advantages such as scalability in network size and energy efficiency in communications. Each sensor shares its data only with neighbors and then achieves global consensus quantities by in-network processing. This dissertation considers robust distributed parameter estimation methods, seeking global consensus on parameters of adaptive learning algorithms and statistical quantities.
Diffusion adaptation strategy with nonlinear transmission is proposed. The nonlinearity was motivated by the necessity for bounded transmit power, as sensors need to iteratively communicate each other energy-efficiently. Despite the nonlinearity, it is shown that the algorithm performs close to the linear case with the added advantage of power savings. This dissertation also discusses convergence properties of the algorithm in the mean and the mean-square sense.
Often, average is used to measure central tendency of sensed data over a network. When there are outliers in the data, however, average can be highly biased. Alternative choices of robust metrics against outliers are median, mode, and trimmed mean. Quantiles generalize the median, and they also can be used for trimmed mean. Consensus-based distributed quantile estimation algorithm is proposed and applied for finding trimmed-mean, median, maximum or minimum values, and identification of outliers through simulation. It is shown that the estimated quantities are asymptotically unbiased and converges toward the sample quantile in the mean-square sense. Step-size sequences with proper decay rates are also discussed for convergence analysis.
Another measure of central tendency is a mode which represents the most probable value and also be robust to outliers and other contaminations in data. The proposed distributed mode estimation algorithm achieves a global mode by recursively shifting conditional mean of the measurement data until it converges to stationary points of estimated density function. It is also possible to estimate the mode by utilizing grid vector as well as kernel density estimator. The densities are estimated at each grid point, while the points are updated until they converge to a global mode.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201
Distributed multiple model joint probabilistic data association with Gibbs sampling-aided implementation
This paper proposes a new distributed multiple model multiple manoeuvring target tracking algorithm. The proposed tracker is derived by combining joint probabilistic data association (JPDA) with consensus-based distributed filtering. Exact implementation of the JPDA involves enumerating all possible joint association events and thus often becomes computationally intractable in practice. We propose a computationally tractable approximation of calculating the marginal association probabilities for measurement-target mappings based on stochastic Gibbs sampling. In order to achieve scalability for a large number of sensors and high tolerance to sensor failure, a simple average consensus algorithm-based information JPDA filter is proposed for distributed tracking of multiple manoeuvring targets. In the proposed framework, the state of each target is updated using consensus-based information fusion while the manoeuvre mode probability of each target is corrected with measurement probability fusion. Simulations clearly demonstrate the effectiveness and characteristics of the proposed algorithm. The results reveal that the proposed formulation is scalable and much more efficient than classical JPDA without sacrificing tracking accurac
Distributed fusion filter over lossy wireless sensor networks with the presence of non-Gaussian noise
The information transmission between nodes in a wireless sensor networks
(WSNs) often causes packet loss due to denial-of-service (DoS) attack, energy
limitations, and environmental factors, and the information that is
successfully transmitted can also be contaminated by non-Gaussian noise. The
presence of these two factors poses a challenge for distributed state
estimation (DSE) over WSNs. In this paper, a generalized packet drop model is
proposed to describe the packet loss phenomenon caused by DoS attacks and other
factors. Moreover, a modified maximum correntropy Kalman filter is given, and
it is extended to distributed form (DM-MCKF). In addition, a distributed
modified maximum correntropy Kalman filter incorporating the generalized data
packet drop (DM-MCKF-DPD) algorithm is provided to implement DSE with the
presence of both non-Gaussian noise pollution and packet drop. A sufficient
condition to ensure the convergence of the fixed-point iterative process of the
DM-MCKF-DPD algorithm is presented and the computational complexity of the
DM-MCKF-DPD algorithm is analyzed. Finally, the effectiveness and feasibility
of the proposed algorithms are verified by simulations
Bias estimation in sensor networks
This paper investigates the problem of estimating biases affecting relative
state measurements in a sensor network. Each sensor measures the relative
states of its neighbors and this measurement is corrupted by a constant bias.
We analyse under what conditions on the network topology and the maximum number
of biased sensors the biases can be correctly estimated. We show that for
non-bipartite graphs the biases can always be determined even when all the
sensors are corrupted, while for bipartite graphs more than half of the sensors
should be unbiased to ensure the correctness of the bias estimation. If the
biases are heterogeneous, then the number of unbiased sensors can be reduced to
two. Based on these conditions, we propose some algorithms to estimate the
biases.Comment: 12 pages, 8 figure
- …