×

On stability and stabilizability of singular stochastic systems with delays. (English) Zbl 1101.93077

The paper deal with the problems of stability analysis and stabilization for singular Markovian jump system with time delays. Based on a set of linear matrix inequalities, the sufficient conditions which guarantee the regularity, absence of impulses, and stochastic stability of such systems are presented. Based on this, the sufficient conditions for the existence of a state feedback controller are derived. A memoryless controller is used in the paper and a design algorithm in terms of the solutions to linear matrix inequalities is proposed to synthesize the controller gains. A numerical example is provided to demonstrate the effectiveness of the proposed method.

MSC:

93E15 Stochastic stability in control theory
93D15 Stabilization of systems by feedback
PDFBibTeX XMLCite
Full Text: DOI

References:

[3] Lewis, F. L., A Survey of Linear Singular Systems, Circuits, Systems, and Signal Processing, Vol. 5, pp. 3–36, 1986. · Zbl 0613.93029
[5] Fridman, E., A Lyapunov-Based Approach to Stability of Descriptor Systems with Delay, Proceedings of the 40th IEEE Conference on Decision and Control, Orlando, Florida, pp. 2850–2855, 2001.
[22] De Souza, C. E., and Fragoso, M. D., Robust HFiltering for Markovian Jump Linear Systems, Proceedings of the 35th IEEE Conference on Decision and Control, Kobe, Japan, pp. 4808–4813, 1996.
[27] June, F., Shuqian, Z., and Zhaolin, C., Guaranteed Cost Control of Linear Uncertain Singular Time-Delay Systems, Proceedings of the 41th IEEE Conference on Decision and Control, Las Vegas, Nevada, pp. 1802–1807, 2002.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.