5,808 research outputs found
Kalman filtering in the presence of State Space Equality Constraints
We discuss two separate techniques for Kalman Filtering in the presence of state space equality constraints. We then prove that despite the lack of similarity in their formulations, under certain conditions, the two methods result in mathematically equivalent constrained estimate structures. We conclude that the potential benefits of using equality constraints in Kalman Filtering often outweigh the computational costs, and as such, equality constraints, when present, should be enforced by way of one of these two methods
Robust Singular Smoothers For Tracking Using Low-Fidelity Data
Tracking underwater autonomous platforms is often difficult because of noisy,
biased, and discretized input data. Classic filters and smoothers based on
standard assumptions of Gaussian white noise break down when presented with any
of these challenges. Robust models (such as the Huber loss) and constraints
(e.g. maximum velocity) are used to attenuate these issues. Here, we consider
robust smoothing with singular covariance, which covers bias and correlated
noise, as well as many specific model types, such as those used in navigation.
In particular, we show how to combine singular covariance models with robust
losses and state-space constraints in a unified framework that can handle very
low-fidelity data. A noisy, biased, and discretized navigation dataset from a
submerged, low-cost inertial measurement unit (IMU) package, with ultra short
baseline (USBL) data for ground truth, provides an opportunity to stress-test
the proposed framework with promising results. We show how robust modeling
elements improve our ability to analyze the data, and present batch processing
results for 10 minutes of data with three different frequencies of available
USBL position fixes (gaps of 30 seconds, 1 minute, and 2 minutes). The results
suggest that the framework can be extended to real-time tracking using robust
windowed estimation.Comment: 9 pages, 9 figures, to be included in Robotics: Science and Systems
201
Gain-constrained recursive filtering with stochastic nonlinearities and probabilistic sensor delays
This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2013 IEEE.This paper is concerned with the gain-constrained recursive filtering problem for a class of time-varying nonlinear stochastic systems with probabilistic sensor delays and correlated noises. The stochastic nonlinearities are described by statistical means that cover the multiplicative stochastic disturbances as a special case. The phenomenon of probabilistic sensor delays is modeled by introducing a diagonal matrix composed of Bernoulli distributed random variables taking values of 1 or 0, which means that the sensors may experience randomly occurring delays with individual delay characteristics. The process noise is finite-step autocorrelated. The purpose of the addressed gain-constrained filtering problem is to design a filter such that, for all probabilistic sensor delays, stochastic nonlinearities, gain constraint as well as correlated noises, the cost function concerning the filtering error is minimized at each sampling instant, where the filter gain satisfies a certain equality constraint. A new recursive filtering algorithm is developed that ensures both the local optimality and the unbiasedness of the designed filter at each sampling instant which achieving the pre-specified filter gain constraint. A simulation example is provided to illustrate the effectiveness of the proposed filter design approach.This work was supported in part by the National Natural Science Foundation of China by Grants 61273156, 61028008, 60825303, 61104125, and 11271103, National 973 Project by Grant 2009CB320600, the Fok Ying Tung Education Fund by Grant 111064, the Special Fund for the Author of National Excellent Doctoral Dissertation of China by Grant 2007B4, the State Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. by Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany
Deducing the Multi-Trader Population Driving a Financial Market
We previously laid out a framework for predicting financial movements and pockets of predictability by deducing the heterogeneity in the multi-agent population in temrs of trader types playing in an artificial financial market model [7]. This work explores extensions to this basic framework. We allow for more intelligent agents with a richer strategy set, and we no longer constrain the estimate for the heterogeneity over the agents to a probability space. We then introduce a scheme which accounts for models with a wide variety of agent types. We also discuss a mechanism for bias removal on the estimates of the relevant parameters
Ensemble updating of binary state vectors by maximising the expected number of unchanged components
In recent years, several ensemble-based filtering methods have been proposed
and studied. The main challenge in such procedures is the updating of a prior
ensemble to a posterior ensemble at every step of the filtering recursions. In
the famous ensemble Kalman filter, the assumption of a linear-Gaussian state
space model is introduced in order to overcome this issue, and the prior
ensemble is updated with a linear shift closely related to the traditional
Kalman filter equations. In the current article, we consider how the ideas
underlying the ensemble Kalman filter can be applied when the components of the
state vectors are binary variables. While the ensemble Kalman filter relies on
Gaussian approximations of the forecast and filtering distributions, we instead
use first order Markov chains. To update the prior ensemble, we simulate
samples from a distribution constructed such that the expected number of equal
components in a prior and posterior state vector is maximised. We demonstrate
the performance of our approach in a simulation example inspired by the
movement of oil and water in a petroleum reservoir, where also a more na\"{i}ve
updating approach is applied for comparison. Here, we observe that the
Frobenius norm of the difference between the estimated and the true marginal
filtering probabilities is reduced to the half with our method compared to the
na\"{i}ve approach, indicating that our method is superior. Finally, we discuss
how our methodology can be generalised from the binary setting to more
complicated situations
Optimization viewpoint on Kalman smoothing, with applications to robust and sparse estimation
In this paper, we present the optimization formulation of the Kalman
filtering and smoothing problems, and use this perspective to develop a variety
of extensions and applications. We first formulate classic Kalman smoothing as
a least squares problem, highlight special structure, and show that the classic
filtering and smoothing algorithms are equivalent to a particular algorithm for
solving this problem. Once this equivalence is established, we present
extensions of Kalman smoothing to systems with nonlinear process and
measurement models, systems with linear and nonlinear inequality constraints,
systems with outliers in the measurements or sudden changes in the state, and
systems where the sparsity of the state sequence must be accounted for. All
extensions preserve the computational efficiency of the classic algorithms, and
most of the extensions are illustrated with numerical examples, which are part
of an open source Kalman smoothing Matlab/Octave package.Comment: 46 pages, 11 figure
Robust filtering for a class of stochastic uncertain nonlinear time-delay systems via exponential state estimation
Copyright [2001] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.We investigate the robust filter design problem for a class of nonlinear time-delay stochastic systems. The system under study involves stochastics, unknown state time-delay, parameter uncertainties, and unknown nonlinear disturbances, which are all often encountered in practice and the sources of instability. The aim of this problem is to design a linear, delayless, uncertainty-independent state estimator such that for all admissible uncertainties as well as nonlinear disturbances, the dynamics of the estimation error is stochastically exponentially stable in the mean square, independent of the time delay. Sufficient conditions are proposed to guarantee the existence of desired robust exponential filters, which are derived in terms of the solutions to algebraic Riccati inequalities. The developed theory is illustrated by numerical simulatio
- …