On $\ell_2$-performance of weakly-hard real-time control systems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916601508397056 |
|---|---|
| author | Seidel, Marc Lang, Simon Allgöwer, Frank |
| author_facet | Seidel, Marc Lang, Simon Allgöwer, Frank |
| contents | This paper considers control systems with failures in the feedback channel, that occasionally lead to loss of the control input signal. A useful approach for modeling such failures is to consider window-based constraints on possible loss sequences, for example that at least r control attempts in every window of s are successful. A powerful framework to model such constraints are weakly-hard real-time constraints. Various approaches for stability analysis and the synthesis of stabilizing controllers for such systems have been presented in the past. However, existing results are mostly limited to asymptotic stability and rarely consider performance measures such as the resulting $\ell_2$-gain. To address this problem, we adapt a switched system description where the switching sequence is constrained by a graph that captures the loss information. We present an approach for $\ell_2$-performance analysis involving linear matrix inequalities (LMI). Further, leveraging a system lifting method, we propose an LMI-based approach for synthesizing state-feedback controllers with guaranteed $\ell_2$-performance. The results are illustrated by a numerical example. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_07875 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On $\ell_2$-performance of weakly-hard real-time control systems Seidel, Marc Lang, Simon Allgöwer, Frank Systems and Control Optimization and Control This paper considers control systems with failures in the feedback channel, that occasionally lead to loss of the control input signal. A useful approach for modeling such failures is to consider window-based constraints on possible loss sequences, for example that at least r control attempts in every window of s are successful. A powerful framework to model such constraints are weakly-hard real-time constraints. Various approaches for stability analysis and the synthesis of stabilizing controllers for such systems have been presented in the past. However, existing results are mostly limited to asymptotic stability and rarely consider performance measures such as the resulting $\ell_2$-gain. To address this problem, we adapt a switched system description where the switching sequence is constrained by a graph that captures the loss information. We present an approach for $\ell_2$-performance analysis involving linear matrix inequalities (LMI). Further, leveraging a system lifting method, we propose an LMI-based approach for synthesizing state-feedback controllers with guaranteed $\ell_2$-performance. The results are illustrated by a numerical example. |
| title | On $\ell_2$-performance of weakly-hard real-time control systems |
| topic | Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2305.07875 |