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

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

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

Design of discrete time controllers and estimators.

This thesis considers optimal linear least-squares filtering smoothing prediction and regulation for discrete-time processes. A finite interval smoothing filter is derived in the z domain giving a transfer function solution. The resulting time-invariant smoother can be applied to problems where, a time varying solution using matrix Riccati equations would diverge if the process is modelled inaccurately. A self-tuning algorithm is given for the filtering and fixed lag smoothing problems as applied to square multi-variable ARMA processes when only the order of the process is assumed known. The dynamics of the process can also be slowly time varying. If the dynamics remain constant and unknown, it is shown how the self-tuning filter or smoother algorithm converges asymptotically to the optimal Wiener solutions. LQG self-tuning regulation is considered. The LQG algorithms rely on input-output data rather than from the conventional state-space approach employing the Kalman filter. An explicit algorithm is given which is similar to certain pole placement self-tuning regulators, requiring the solution of a diophantine equation. Following this, an implicit algorithm is shown to overcome the problem of solving a diophantine equation by estimating the regulator parameters directly using recursive least squares. The LQG algorithms are shown to be able to cope with processes which are non-minimum phase, open loop unstable and with an unknown time delay