Generalized relaxation techniques for robust H∞ filtering of nonhomogeneous Markovian jump systems

Sung Hyun Kim

Applied Mathematics and Computation, 2019, vol. 347, issue C, 542-556

Abstract: This paper is concerned with the robust H∞ filtering problem for continuous-time nonhomogeneous Markovian jump systems via generalized relaxation techniques. To provide more general description on transition rates, this paper first presents four (or five) specific cases that can be classified according to the property of transition rates. And then, two generalized relaxation methods are proposed so that they can embrace all possible cases identified from our classification, even the excluded case from other results. Especially, to develop a less conservative relaxation process with reduced computational complexity, this paper proposes an improved approach that imposes the summation constraint of transition rates without resorting to extra slack variables, and takes advantage of their component-summation-based constraints.

Keywords: Nonhomogeneous Markov process; Time-varying transition rates; Relaxation process; Computational complexity; Less conservative design (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318309494
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:347:y:2019:i:c:p:542-556

DOI: 10.1016/j.amc.2018.10.075

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().