Efficient stability analysis approaches for nonlinear weakly-hard real-time control systems

被引:11
作者
Hertneck, Michael [1 ]
Linsenmayer, Steffen [1 ]
Allgoewer, Frank [1 ]
机构
[1] Univ Stuttgart, Inst Syst Theory & Automat Control, D-70569 Stuttgart, Germany
关键词
Control under communication constraint; Networked control systems; Sampled-data systems; Cyber-physical systems; Switching controllers; LINEAR-SYSTEMS;
D O I
10.1016/j.automatica.2021.109868
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article considers the stability analysis of nonlinear control systems with failures in the feedback loop that satisfy weakly-hard real-time (WHRT) constraints. Such WHRT constraints are window-based guarantees like for example, that the feedback loop is at least closed for n times in each window of m sampling times. WHRT constraints can, e.g., describe the packet loss properties of a communication network. We consider two different actuation strategies to deal with failures in the feedback loop: holding the last received input or setting the input to zero if no new input arrives. We present stability analysis procedures for both strategies. The procedures are based on the emulation of a sampled-data controller from continuous-time feedback. For the hold strategy, we use a graph description for the WHRT constraints and a modified version of the Viterbi algorithm to bound a Lyapunov function candidate. For the zero strategy, we employ a bound on the evolution of the Lyapunov function candidate for zero input. For both strategies, efficient stability analysis procedures based on non monotonic Lyapunov functions are derived. In addition, we demonstrate how switched controllers, that switch depending on the past dropout sequence, can be used for the hold strategy. Such switched controllers can significantly increase the maximum allowable sampling period for the hold strategy. The proposed approaches are illustrated with a numerical example. (C) 2021 Elsevier Ltd. All rights reserved.
引用
收藏
页数:13
相关论文
共 31 条
[1]  
Ahrendts L., 2018, LEIBNIZ INT P INFORM, V106, DOI [10.4230/LIPIcs.ECRTS.2018.15, DOI 10.4230/LIPICS.ECRTS.2018.15]
[2]  
[Anonymous], 2017, P C DEC CONTR
[3]   Weakly hard real-time systems [J].
Bernat, G ;
Burns, A ;
Llamosí, A .
IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (04) :308-321
[4]  
Blind R, 2015, IEEE DECIS CONTR P, P7510, DOI 10.1109/CDC.2015.7403405
[5]   A Lyapunov proof of an improved maximum allowable transfer interval for networked control systems [J].
Carnevale, Daniele ;
Teel, Andrew R. ;
Nesic, Dragan .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (05) :892-897
[6]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[7]  
Gaukler M., 2019, ARXIV PREPRINT ARXIV
[8]   A DYNAMIC PRIORITY ASSIGNMENT TECHNIQUE FOR STREAMS WITH (M,K)-FIRM DEADLINES [J].
HAMDAOUI, M ;
RAMANATHAN, P .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (12) :1443-1451
[9]  
Heijmans S. H. J., 2020, IEEE T AUTOMAT CONTR
[10]  
Hertneck M., 2021, P 3 IFAC C MOD ID CO