Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

Active Classification for POMDPs: a Kalman-like State Estimator

The problem of state tracking with active observation control is considered for a system modeled by a discrete-time, finite-state Markov chain observed through conditionally Gaussian measurement vectors. The measurement model statistics are shaped by the underlying state and an exogenous control input, which influence the observations' quality. Exploiting an innovations approach, an approximate minimum mean-squared error (MMSE) filter is derived to estimate the Markov chain system state. To optimize the control strategy, the associated mean-squared error is used as an optimization criterion in a partially observable Markov decision process formulation. A stochastic dynamic programming algorithm is proposed to solve for the optimal solution. To enhance the quality of system state estimates, approximate MMSE smoothing estimators are also derived. Finally, the performance of the proposed framework is illustrated on the problem of physical activity detection in wireless body sensing networks. The power of the proposed framework lies within its ability to accommodate a broad spectrum of active classification applications including sensor management for object classification and tracking, estimation of sparse signals and radar scheduling.Comment: 38 pages, 6 figure

Distributing the Kalman Filter for Large-Scale Systems

This paper derives a \emph{distributed} Kalman filter to estimate a sparsely connected, large-scale, $n-$dimensional, dynamical system monitored by a network of $N$ sensors. Local Kalman filters are implemented on the ($n_l-$dimensional, where $n_l\ll n$) sub-systems that are obtained after spatially decomposing the large-scale system. The resulting sub-systems overlap, which along with an assimilation procedure on the local Kalman filters, preserve an $L$th order Gauss-Markovian structure of the centralized error processes. The information loss due to the $L$th order Gauss-Markovian approximation is controllable as it can be characterized by a divergence that decreases as $L\uparrow$. The order of the approximation, $L$, leads to a lower bound on the dimension of the sub-systems, hence, providing a criterion for sub-system selection. The assimilation procedure is carried out on the local error covariances with a distributed iterate collapse inversion (DICI) algorithm that we introduce. The DICI algorithm computes the (approximated) centralized Riccati and Lyapunov equations iteratively with only local communication and low-order computation. We fuse the observations that are common among the local Kalman filters using bipartite fusion graphs and consensus averaging algorithms. The proposed algorithm achieves full distribution of the Kalman filter that is coherent with the centralized Kalman filter with an $L$th order Gaussian-Markovian structure on the centralized error processes. Nowhere storage, communication, or computation of $n-$dimensional vectors and matrices is needed; only $n_l \ll n$ dimensional vectors and matrices are communicated or used in the computation at the sensors

Nonlinear Filtering of Weak Chaotic Signals

In recent years, the application of nonlinear filtering for processing chaotic signals has become relevant. A common factor in all nonlinear filtering algorithms is that they operate in an instantaneous fashion, that is, at each cycle, a one moment of time magnitude of the signal of interest is processed. This operation regime yields good performance metrics, in terms of mean squared error (MSE) when the signal-to-noise ratio (SNR) is greater than one and shows moderate degradation for SNR values no smaller than −3 dB. Many practical applications require detection for smaller SNR values (weak signals). This chapter presents the theoretical tools and developments that allow nonlinear filtering of weak chaotic signals, avoiding the degradation of the MSE when the SNR is rather small. The innovation introduced through this approach is that the nonlinear filtering becomes multimoment, that is, the influence of more than one moment of time magnitudes is involved in the processing. Some other approaches are also presented

Detection and Estimation Theory

Contains report on one research project.Joint Services Electronics Programs (U. S. Army, U. S. Navy, and U. S. Air Force) under Contract DA 28-043-AMC-02536(E

Plume Source Localization and Boundary Prediction

Plume location and prediction using mobile sensors is the main contribution of this thesis. Plume concentration values measured by chemical sensors at different locations are used to estimate the source of the plume. This is achieved by employing a stochastic approximation technique to localize the source and compare its performance to the nonlinear least squares method. The source location is then used as the initial estimate for the boundary tracking problem. Sensor measurements are used to estimate the parameters and the states of the state space model of the dynamics of the plume boundary. The predicted locations are the reference inputs for the LQR controller. Measurements at the new locations (after the correction of the prediction error) are added to the set of data to refine the next prediction process. Simulations are performed to demonstrate the viability of the methods developed. Finally, interpolation using the sensors locations is used to approximate the boundary shape

Kalman Filter Bibliography: Agriculture, Biology, and Medicine

27 pages, 1 article*Kalman Filter Bibliography: Agriculture, Biology, and Medicine* (Federer, Walter T.; Murty, B. R.) 27 page