Premium
Discrete‐time network‐based control under scheduling and actuator constraints
Author(s) -
Liu Kun,
Fridman Emilia
Publication year - 2015
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.3179
Subject(s) - control theory (sociology) , actuator , computer science , discrete time and continuous time , networked control system , scheduling (production processes) , inverted pendulum , control system , mathematics , control (management) , mathematical optimization , engineering , nonlinear system , statistics , physics , quantum mechanics , artificial intelligence , electrical engineering
Summary 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.