Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.14188 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917929888514048 |
|---|---|
| author | Xiao, Chunjie Hou, Ting Zhang, Weihai Deng, Feiqi |
| author_facet | Xiao, Chunjie Hou, Ting Zhang, Weihai Deng, Feiqi |
| contents | This paper is concerned with the robustness of discrete-time Markov jump linear systems (MJLSs) with the Markov chain on a Borel space. For this general class of MJLSs, a small gain theorem is first established and subsequently applied to derive a lower bound of the stability radius. On this basis, with the aid of the extended bounded real lemma and Schur complements, the robust stability problems for the MJLSs are tackled via linear matrix inequality (LMI) techniques. The novel contribution, primarily founded on the scenario where the state space of the Markov chain is restricted in a continuous set, lies in the formulation of a griding approach. The approach converts the existence problem of solutions of an inequality related to $H_{\infty}$ analysis, which is an infinite-dimensional challenge, into a finite-dimensional LMI feasibility problem. As an application, within the framework of MJLSs, a robustness issue of the sampled-data systems is addressed by using a Markov chain, which is determined by the initial distribution and the stochastic kernel, to model transmission delays existing in networked control systems (NCSs). Finally, the feasibility of the results is verified through two examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_14188 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Small Gain Theorem-Based Robustness Analysis of Discrete-Time MJLSs with the Markov Chain on a Borel Space and Its Application to NCSs Xiao, Chunjie Hou, Ting Zhang, Weihai Deng, Feiqi Optimization and Control This paper is concerned with the robustness of discrete-time Markov jump linear systems (MJLSs) with the Markov chain on a Borel space. For this general class of MJLSs, a small gain theorem is first established and subsequently applied to derive a lower bound of the stability radius. On this basis, with the aid of the extended bounded real lemma and Schur complements, the robust stability problems for the MJLSs are tackled via linear matrix inequality (LMI) techniques. The novel contribution, primarily founded on the scenario where the state space of the Markov chain is restricted in a continuous set, lies in the formulation of a griding approach. The approach converts the existence problem of solutions of an inequality related to $H_{\infty}$ analysis, which is an infinite-dimensional challenge, into a finite-dimensional LMI feasibility problem. As an application, within the framework of MJLSs, a robustness issue of the sampled-data systems is addressed by using a Markov chain, which is determined by the initial distribution and the stochastic kernel, to model transmission delays existing in networked control systems (NCSs). Finally, the feasibility of the results is verified through two examples. |
| title | Small Gain Theorem-Based Robustness Analysis of Discrete-Time MJLSs with the Markov Chain on a Borel Space and Its Application to NCSs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2502.14188 |