Please use this identifier to cite or link to this item:
|Title:||Simultaneous stability of a collection of networked control systems with uncertain delays||Authors:||Dai, S.-L.
|Keywords:||Average dwell time
Networked control systems (NCSs)
|Issue Date:||2008||Citation:||Dai, S.-L., Lin, H., Ge, S.S., Li, X. (2008). Simultaneous stability of a collection of networked control systems with uncertain delays. 2008 10th International Conference on Control, Automation, Robotics and Vision, ICARCV 2008 : 35-40. ScholarBank@NUS Repository. https://doi.org/10.1109/ICARCV.2008.4795488||Abstract:||This paper is concerned with simultaneous stability of a collection of continuous-time linear plants whose feedback control loops are closed via a shared digital communication network. Because of the limitation of communication capacity, only a limited number of controller-plant connections can be accommodated at any time instant. Therefore, it is necessary to carefully design the scheduling policy so as to achieve simultaneous stabilization for all these control loops. In the paper, sufficient condition on the existence of such a scheduling policy is presented for the collection of networked LTI systems with sampled-data controllers and network-induced uncertain delays. It turns out that the condition is only based on the convergence rate of the closed-loop system and the divergence rate of the open-loop plant. The proof for this schedulability condition is in a constructive way, which can also serve as a systematic way for the scheduling policy design. © 2008 IEEE.||Source Title:||2008 10th International Conference on Control, Automation, Robotics and Vision, ICARCV 2008||URI:||http://scholarbank.nus.edu.sg/handle/10635/71787||ISBN:||9781424422876||DOI:||10.1109/ICARCV.2008.4795488|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2019
WEB OF SCIENCETM
checked on Mar 27, 2019
checked on Apr 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.