7,395 research outputs found
Initialization of the Kalman Filter without Assumptions on the Initial State
In absence of covariance data, Kalman filters are usually initialized by guessing the initial state. Making the variance of the initial state estimate large makes sure that the estimate converges quickly and that the influence of the initial guess soon will be negligible. If, however, only very few measurements are available during the estimation process and an estimate is wanted as soon as possible, this might not be enough. This paper presents a method to initialize the Kalman filter without any knowledge about the distribution of the initial state and without making any guesses
LQG Online Learning
Optimal control theory and machine learning techniques are combined to
formulate and solve in closed form an optimal control formulation of online
learning from supervised examples with regularization of the updates. The
connections with the classical Linear Quadratic Gaussian (LQG) optimal control
problem, of which the proposed learning paradigm is a non-trivial variation as
it involves random matrices, are investigated. The obtained optimal solutions
are compared with the Kalman-filter estimate of the parameter vector to be
learned. It is shown that the proposed algorithm is less sensitive to outliers
with respect to the Kalman estimate (thanks to the presence of the
regularization term), thus providing smoother estimates with respect to time.
The basic formulation of the proposed online-learning framework refers to a
discrete-time setting with a finite learning horizon and a linear model.
Various extensions are investigated, including the infinite learning horizon
and, via the so-called "kernel trick", the case of nonlinear models
A mollified Ensemble Kalman filter
It is well recognized that discontinuous analysis increments of sequential
data assimilation systems, such as ensemble Kalman filters, might lead to
spurious high frequency adjustment processes in the model dynamics. Various
methods have been devised to continuously spread out the analysis increments
over a fixed time interval centered about analysis time. Among these techniques
are nudging and incremental analysis updates (IAU). Here we propose another
alternative, which may be viewed as a hybrid of nudging and IAU and which
arises naturally from a recently proposed continuous formulation of the
ensemble Kalman analysis step. A new slow-fast extension of the popular
Lorenz-96 model is introduced to demonstrate the properties of the proposed
mollified ensemble Kalman filter.Comment: 16 pages, 6 figures. Minor revisions, added algorithmic summary and
extended appendi
Robust Kalman tracking and smoothing with propagating and non-propagating outliers
A common situation in filtering where classical Kalman filtering does not
perform particularly well is tracking in the presence of propagating outliers.
This calls for robustness understood in a distributional sense, i.e.; we
enlarge the distribution assumptions made in the ideal model by suitable
neighborhoods. Based on optimality results for distributional-robust Kalman
filtering from Ruckdeschel[01,10], we propose new robust recursive filters and
smoothers designed for this purpose as well as specialized versions for
non-propagating outliers. We apply these procedures in the context of a GPS
problem arising in the car industry. To better understand these filters, we
study their behavior at stylized outlier patterns (for which they are not
designed) and compare them to other approaches for the tracking problem.
Finally, in a simulation study we discuss efficiency of our procedures in
comparison to competitors.Comment: 27 pages, 12 figures, 2 table
Change Sensor Topology When Needed: How to Efficiently Use System Resources in Control and Estimation Over Wireless Networks
New control paradigms are needed for large networks
of wireless sensors and actuators in order to efficiently
utilize system resources. In this paper we consider when
feedback control loops are formed locally to detect, monitor, and counteract disturbances that hit a plant at random instances in time and space. A sensor node that detects a disturbance dynamically forms a local multi-hop tree of sensors and fuse the data into a state estimate. It is shown that the optimal estimator over a sensor tree is given by a Kalman filter of certain structure. The tree is optimized such that the overall transmission energy is minimized but guarantees a specified level of estimation accuracy. A sensor network reconfiguration algorithm is presented that leads to a suboptimal solution and has low computational complexity. A linear control law based
on the state estimate is applied and it is argued that it leads to a closed-loop control system that minimizes a quadratic cost function. The sensor network reconfiguration and the feedback control law are illustrated on an example
Online Natural Gradient as a Kalman Filter
We cast Amari's natural gradient in statistical learning as a specific case
of Kalman filtering. Namely, applying an extended Kalman filter to estimate a
fixed unknown parameter of a probabilistic model from a series of observations,
is rigorously equivalent to estimating this parameter via an online stochastic
natural gradient descent on the log-likelihood of the observations.
In the i.i.d. case, this relation is a consequence of the "information
filter" phrasing of the extended Kalman filter. In the recurrent (state space,
non-i.i.d.) case, we prove that the joint Kalman filter over states and
parameters is a natural gradient on top of real-time recurrent learning (RTRL),
a classical algorithm to train recurrent models.
This exact algebraic correspondence provides relevant interpretations for
natural gradient hyperparameters such as learning rates or initialization and
regularization of the Fisher information matrix.Comment: 3rd version: expanded intr
Contact-Aided Invariant Extended Kalman Filtering for Legged Robot State Estimation
This paper derives a contact-aided inertial navigation observer for a 3D
bipedal robot using the theory of invariant observer design. Aided inertial
navigation is fundamentally a nonlinear observer design problem; thus, current
solutions are based on approximations of the system dynamics, such as an
Extended Kalman Filter (EKF), which uses a system's Jacobian linearization
along the current best estimate of its trajectory. On the basis of the theory
of invariant observer design by Barrau and Bonnabel, and in particular, the
Invariant EKF (InEKF), we show that the error dynamics of the point
contact-inertial system follows a log-linear autonomous differential equation;
hence, the observable state variables can be rendered convergent with a domain
of attraction that is independent of the system's trajectory. Due to the
log-linear form of the error dynamics, it is not necessary to perform a
nonlinear observability analysis to show that when using an Inertial
Measurement Unit (IMU) and contact sensors, the absolute position of the robot
and a rotation about the gravity vector (yaw) are unobservable. We further
augment the state of the developed InEKF with IMU biases, as the online
estimation of these parameters has a crucial impact on system performance. We
evaluate the convergence of the proposed system with the commonly used
quaternion-based EKF observer using a Monte-Carlo simulation. In addition, our
experimental evaluation using a Cassie-series bipedal robot shows that the
contact-aided InEKF provides better performance in comparison with the
quaternion-based EKF as a result of exploiting symmetries present in the system
dynamics.Comment: Published in the proceedings of Robotics: Science and Systems 201
- …