103,032 research outputs found
Robust filtering with randomly varying sensor delay: The finite-horizon case
Copyright [2009] 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.In this paper, we consider the robust filtering problem for discrete time-varying systems with delayed sensor measurement subject to norm-bounded parameter uncertainties. The delayed sensor measurement is assumed to be a linear function of a stochastic variable that satisfies the Bernoulli random binary distribution law. An upper bound for the actual covariance of the uncertain stochastic parameter system is derived and used for estimation variance constraints. Such an upper bound is then minimized over the filter parameters for all stochastic sensor delays and admissible deterministic uncertainties. It is shown that the desired filter can be obtained in terms of solutions to two discrete Riccati difference equations of a form suitable for recursive computation in online applications. An illustrative example is presented to show the applicability of the proposed method
Revision of TR-09-25: A Hybrid Variational/Ensemble Filter Approach to Data Assimilation
Two families of methods are widely used in data assimilation: the
four dimensional variational (4D-Var) approach, and the ensemble Kalman filter
(EnKF) approach. The two families have been developed largely through parallel
research efforts. Each method has its advantages and disadvantages. It is of
interest to develop hybrid data assimilation
algorithms that can combine the relative strengths of the two approaches.
This paper proposes a subspace approach to investigate the theoretical equivalence between the suboptimal
4D-Var method (where only a small number of optimization iterations are
performed) and the practical EnKF method (where only a small number of ensemble
members are used) in a linear Gaussian setting. The analysis motivates a new
hybrid algorithm: the optimization directions obtained from a short window
4D-Var run are used to construct the EnKF initial ensemble.
The proposed hybrid method is computationally less expensive than a full
4D-Var, as only short assimilation windows are considered. The hybrid method has the potential to
perform better than the regular EnKF due to its look-ahead property.
Numerical results
show that the proposed hybrid ensemble filter method performs better than the
regular EnKF method for both linear and nonlinear test problems
Recent Advances in Graph Partitioning
We survey recent trends in practical algorithms for balanced graph
partitioning together with applications and future research directions
- …