Interpolation Method for Update with Out-of-Sequence Measurements: The Augmented Fixed-Lag Smoother

In this study, the authors propose a novel method to handle OOSMs in Kalman filtering. The proposed method, called the augmented fixed-lag smoother (AFLS), is based on the fixed-lag smoother (FLS) formulation, which has been shown to be optimal [10]. We generate the OOSM node from the two adjacent nodes, plug the generated estimations into the state vector and the covariance matrix, and update the filter with OOSMs using the FLS update equation. This approach gives a generalized solution that can handle any number of OOSMs. We also extend the AFLS algorithm to nonlinear system, called the extended AFLS (EAFLS), and give an application example on a satellite-tracking problem

State estimator for multisensor systems with irregular sampling and time-varying delays

This article addresses the state estimation in linear time-varying systems with several sensors with different availability, randomly sampled in time and whose measurements have a time-varying delay. The approach is based on a modification of the Kalman filter with the negative-time measurement update strategy, avoiding running back the full standard Kalman filter, the use of full augmented order models or the use of reorganisation techniques, leading to a lower implementation cost algorithm. The update equations are run every time a new measurement is available, independently of the time when it was taken. The approach is useful for networked control systems, systems with long delays and scarce measurements and for out-of-sequence measurements

Best Linear Unbiased Estimation Fusion with Constraints

Estimation fusion, or data fusion for estimation, is the problem of how to best utilize useful information contained in multiple data sets for the purpose of estimating an unknown quantity — a parameter or a process. Estimation fusion with constraints gives rise to challenging theoretical problems given the observations from multiple geometrically dispersed sensors: Under dimensionality constraints, how to preprocess data at each local sensor to achieve the best estimation accuracy at the fusion center? Under communication bandwidth constraints, how to quantize local sensor data to minimize the estimation error at the fusion center? Under constraints on storage, how to optimally update state estimates at the fusion center with out-of-sequence measurements? Under constraints on storage, how to apply the out-of-sequence measurements (OOSM) update algorithm to multi-sensor multi-target tracking in clutter? The present work is devoted to the above topics by applying the best linear unbiased estimation (BLUE) fusion. We propose optimal data compression by reducing sensor data from a higher dimension to a lower dimension with minimal or no performance loss at the fusion center. For single-sensor and some particular multiple-sensor systems, we obtain the explicit optimal compression rule. For a multisensor system with a general dimensionality requirement, we propose the Gauss-Seidel iterative algorithm to search for the optimal compression rule. Another way to accomplish sensor data compression is to find an optimal sensor quantizer. Using BLUE fusion rules, we develop optimal sensor data quantization schemes according to the bit rate constraints in communication between each sensor and the fusion center. For a dynamic system, how to perform the state estimation and sensor quantization update simultaneously is also established, along with a closed form of a recursion for a linear system with additive white Gaussian noise. A globally optimal OOSM update algorithm and a constrained optimal update algorithm are derived to solve one-lag as well as multi-lag OOSM update problems. In order to extend the OOSM update algorithms to multisensor multitarget tracking in clutter, we also study the performance of OOSM update associated with the Probabilistic Data Association (PDA) algorithm

Rao-Blackwellized Particle Filters with Out-of-Sequence Measurement Processing

This paper addresses the out-of-sequence measurement (OOSM) problem for mixed linear/nonlinear state-space models, which is a class of nonlinear models with a tractable, conditionally linear substructure. We develop two novel algorithms that utilize the linear substructure. The first algorithm effectively employs the Rao-Blackwellized particle filtering framework for updating with the OOSMs, and is based on storing only a subset of the particles and their weights over an arbitrary, predefined interval. The second algorithm adapts a backward simulation approach to update with the delayed (out-of-sequence) measurements, resulting in superior tracking performance. Extensive simulation studies show the efficacy of our approaches in terms of computation time and tracking performance. Both algorithms yield estimation improvements when compared with recent particle filter algorithms for OOSM processing; in the considered examples they achieve up to 10% enhancements in estimation accuracy. In some cases the proposed algorithms even deliver accuracy that is similar to the lower performance bounds. Because the considered setup is common in various estimation scenarios, the developed algorithms enable improvements in different types of filtering applications

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

Efficient delay-tolerant particle filtering

This paper proposes a novel framework for delay-tolerant particle filtering that is computationally efficient and has limited memory requirements. Within this framework the informativeness of a delayed (out-of-sequence) measurement (OOSM) is estimated using a lightweight procedure and uninformative measurements are immediately discarded. The framework requires the identification of a threshold that separates informative from uninformative; this threshold selection task is formulated as a constrained optimization problem, where the goal is to minimize tracking error whilst controlling the computational requirements. We develop an algorithm that provides an approximate solution for the optimization problem. Simulation experiments provide an example where the proposed framework processes less than 40% of all OOSMs with only a small reduction in tracking accuracy

Adaptive tracking of a time-varying field with a quantum sensor

Sensors based on single spins can enable magnetic field detection with very high sensitivity and spatial resolution. Previous work has concentrated on sensing of a constant magnetic field or a periodic signal. Here, we instead investigate the problem of estimating a field with non-periodic variation described by a Wiener process. We propose and study, by numerical simulations, an adaptive tracking protocol based on Bayesian estimation. The tracking protocol updates the probability distribution for the magnetic field, based on measurement outcomes, and adapts the choice of sensing time and phase in real time. By taking the statistical properties of the signal into account, our protocol strongly reduces the required measurement time. This leads to a reduction of the error in the estimation of a time-varying signal by up to a factor 4 compared to protocols that do not take this information into account.Comment: 10 pages, 6 figure