Discrete‐time network‐based control under scheduling and actuator constraints
Discrete‐time network‐based control under scheduling and actuator constraints
复制标题
DOI：
10.1002/rnc.3179
复制
发表时间：
2015-08
影响因子：
3.9
通讯作者：
Kun Liu;E. Fridman
中科院分区：
文献类型：
--
作者：
Kun Liu;E. Fridman
研究了离散时间网络控制系统的时滞相关Lyapunov-Krasovskii方法的解界问题。解的界被广泛地应用于由执行器饱和或量化器饱和引起的输入饱和系统。最近，分别在循环协议和加权尝试一次丢弃协议下，开发了用于稳定连续时间网络控制系统的时延方法。未考虑执行器饱和。在本文中，首次将时延方法扩展到离散时间网络控制系统在调度协议和执行器饱和下的稳定性分析。允许通信延迟大于采样间隔。提出了一种新的基于李雅普诺夫的方法来寻找吸引域。系统模型中的多面体不确定性可以很容易地包括在我们的分析中。时滞方法的有效性在推车-摆系统的例子上得到了说明。版权所有© 2014约翰威利父子有限公司.
This paper is concerned with the solution bounds for discrete‐time networked control systems via delay‐dependent Lyapunov–Krasovskii methods. Solution bounds are widely used for systems with input saturation caused by actuator saturation or by the quantizers with saturation. The time‐delay approach has been developed recently for the stabilization of continuous‐time networked control systems under the round‐robin protocol and under a weighted try‐once‐discard protocol, respectively. Actuator saturation has not been taken into account. In the present paper, for the first time, the time‐delay approach is extended to the stability analysis of the discrete‐time networked control systems under both scheduling protocols and actuators saturation. The communication delays are allowed to be larger than the sampling intervals. A novel Lyapunov‐based method is presented for finding the domain of attraction. Polytopic uncertainties in the system model can be easily included in our analysis. The efficiency of the time‐delay approach is illustrated on the example of a cart–pendulum system. Copyright © 2014 John Wiley & Sons, Ltd.