Risk-sensitive filtering for jump Markov linear systems

Date

2008-01-01

Author

Orguner, Umut

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

39
views

0
downloads

In this paper, a risk-sensitive multiple-model filtering algorithm is derived using the reference probability methods. First, the approximation of the interacting multiple-model (IMM) algorithm is identified in the reference probability domain. Then, the same type of approximation is used to derive the finite-dimensional risk-sensitive filtering algorithm. The derived algorithm reduces to the IMM filter when the risk-sensitive parameter goes to zero and reduces to the risk-sensitive filter for linear Gauss-Markov systems when the number of models is unity. The algorithm performs better in a simulated uncertain parameter scenario than the IMM filter.

Subject Keywords

Control and Systems Engineering, Electrical and Electronic Engineering

URI

https://hdl.handle.net/11511/45833

Journal

AUTOMATICA

DOI

https://doi.org/10.1016/j.automatica.2007.04.018

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

An online sequential algorithm for the estimation of transition probabilities forjump Markov linear systems Orguner, Umut (Elsevier BV, 2006-10-01) This paper describes a new method to estimate the transition probabilities associated with a jump Markov linear system. The new algorithm uses stochastic approximation type recursions to minimize the Kullback-Leibler divergence between the likelihood function of the transition probabilities and the true likelihood function. Since the calculation of the likelihood function of the transition probabilities is impossible, an incomplete data paradigm, which has been previously applied to a similar problem for hi...
Random Set Methods Estimation of Multiple Extended Objects Granstrom, Karl; Lundquist, Christian; Gustafsson, Fredrik; Orguner, Umut (Institute of Electrical and Electronics Engineers (IEEE), 2014-06-01) Random set-based methods have provided a rigorous Bayesian framework and have been used extensively in the last decade for point object estimation. In this article, we emphasize that the same methodology offers an equally powerful approach to estimation of so-called extended objects, i.e., objects that result in multiple detections on the sensor side. Building upon the analogy between Bayesian state estimation of a single object and random finite set (RFS) estimation for multiple objects, we give a tutorial...
Quantitative measure of observability for linear stochastic systems Subasi, Yuksel; Demirekler, Mübeccel (Elsevier BV, 2014-06-01) In this study we define a new observability measure for stochastic systems: the mutual information between the state sequence and the corresponding measurement sequence for a given time horizon. Although the definition is given for a general system representation, the paper focuses on the linear time invariant Gaussian case. Some basic analytical results are derived for this special case. The measure is extended to the observability of a subspace of the state space, specifically an individual state and/or t...
Observability Through a Matrix-Weighted Graph Tuna, Sezai Emre (Institute of Electrical and Electronics Engineers (IEEE), 2018-07-01) Observability of an array of identical linear time-invariant systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is shown that the observability of an array is equivalent to the connectivity of its interconnection graph, whose edges are assigned matrix weights. Moreover, to better understand the relative behavior of distant units, pairwise observability that concerns wi...
Language-Guided Controller Synthesis for Linear Systems Aydın Göl, Ebru; Belta, Calin (Institute of Electrical and Electronics Engineers (IEEE), 2014-05-01) This paper considers the problem of controlling discrete-time linear systems from specifications given as formulas of syntactically co-safe linear temporal logic over linear predicates in the state variables. A systematic procedure is developed for the automatic computation of sets of initial states and feedback controllers such that all the resulting trajectories of the closed-loop system satisfy the given specifications. The procedure is based on the iterative construction and refinement of an automaton t...

Citation Formats

U. Orguner, “Risk-sensitive filtering for jump Markov linear systems,” AUTOMATICA, pp. 109–118, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/45833.