1,704 research outputs found
Distributed Receding Horizon Kalman Filter
In this paper a distributed version of the Kalman filter is proposed. In particular, the estimation problem is reduced to the optimization of a cost function that depends on the system dynamics and the latest output measurements and state estimates which is distributed among the agents by means of dual decomposition. The techniques presented in the paper are applied to estimate the position of mobile agents
Receding horizon filtering for a class of discrete time-varying nonlinear systems with multiple missing measurements
This paper is concerned with the receding horizon filtering problem for a class of discrete time-varying nonlinear systems with multiple missing measurements. The phenomenon of missing measurements occurs in a random way and the missing probability is governed by a set of stochastic variables obeying the given Bernoulli distribution. By exploiting the projection theory combined with stochastic analysis techniques, a Kalman-type receding horizon filter is put forward to facilitate the online applications. Furthermore, by utilizing the conditional expectation, a novel estimation scheme of state covariance matrices is proposed to guarantee the implementation of the filtering algorithm. Finally, a simulation example is provided to illustrate the effectiveness of the established filtering scheme.This work was supported in part by the Deanship of Scientific Research (DSR) at King Abdulaziz University in Saudi Arabia [grant number 16-135-35-HiCi], the National Natural Science Foundation of China [grant number 61329301], [grant number 61203139], [grant number 61134009], and [grant number 61104125], Royal
Society of the U.K., the Shanghai Rising-Star Program of China [grant number 13QA1400100], the Shu Guang project of Shanghai Municipal Education Commission and Shanghai Education Development Foundation [grant number 13SG34], the Fundamental Research Funds for the Central Universities, DHU Distinguished
Young Professor Program, and the Alexander von Humboldt Foundation of Germany
A mixed integer linear programming model for optimal sovereign debt issuance
Copyright @ 2011, Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in the European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version is available at the link below.Governments borrow funds to finance the excess of cash payments or interest payments over receipts, usually by issuing fixed income debt and index-linked debt. The goal of this work is to propose a stochastic optimization-based approach to determine the composition of the portfolio issued over a series of government auctions for the fixed income debt, to minimize the cost of servicing debt while controlling risk and maintaining market liquidity. We show that this debt issuance problem can be modeled as a mixed integer linear programming problem with a receding horizon. The stochastic model for the interest rates is calibrated using a Kalman filter and the future interest rates are represented using a recombining trinomial lattice for the purpose of scenario-based optimization. The use of a latent factor interest rate model and a recombining lattice provides us with a realistic, yet very tractable scenario generator and allows us to do a multi-stage stochastic optimization involving integer variables on an ordinary desktop in a matter of seconds. This, in turn, facilitates frequent re-calibration of the interest rate model and re-optimization of the issuance throughout the budgetary year allows us to respond to the changes in the interest rate environment. We successfully demonstrate the utility of our approach by out-of-sample back-testing on the UK debt issuance data
Output feedback stable stochastic predictive control with hard control constraints
We present a stochastic predictive controller for discrete time linear time
invariant systems under incomplete state information. Our approach is based on
a suitable choice of control policies, stability constraints, and employment of
a Kalman filter to estimate the states of the system from incomplete and
corrupt observations. We demonstrate that this approach yields a
computationally tractable problem that should be solved online periodically,
and that the resulting closed loop system is mean-square bounded for any
positive bound on the control actions. Our results allow one to tackle the
largest class of linear time invariant systems known to be amenable to
stochastic stabilization under bounded control actions via output feedback
stochastic predictive control
On general systems with network-enhanced complexities
In recent years, the study of networked control systems (NCSs) has gradually become an active research area due to the advantages of using networked media in many aspects such as the ease of maintenance and installation, the large flexibility and the low cost. It is well known that the devices in networks are mutually connected via communication cables that are of limited capacity. Therefore, some network-induced phenomena have inevitably emerged in the areas of signal processing and control engineering. These phenomena include, but are not limited to, network-induced communication delays, missing data, signal quantization, saturations, and channel fading. It is of great importance to understand how these phenomena influence the closed-loop stability and performance properties
Recommended from our members
Review of Unbiased FIR Filters, Smoothers, and Predictors for Polynomial Signals
Extracting an estimate of a slowly varying signal corrupted by noise is a common task. Examples can be found in industrial, scientific and biomedical instrumentation. Depending on the nature of the application the signal estimate is allowed to be a delayed estimate of the original signal or, in the other extreme, no delay is tolerated. These cases are commonly referred to as filtering, prediction, and smoothing depending on the amount of advance or lag between the input data set and the output data set. In this review paper we provide a comprehensive set of design and analysis tools for designing unbiased FIR filters, predictors, and smoothers for slowly varying signals, i.e. signals that can be modeled by low order polynomials. Explicit expressions of parameters needed in practical implementations are given. Real life examples are provided including cases where the method is extended to signals that are piecewise slowly varying. A critical view on recursive implementations of the algorithms is provided
- …