A scheduling algorithm for networked control systems

This paper deals with the design of scheduling logics for Networked Control Systems (NCSs) whose communication networks have limited capacity. We assume that only a subset plants can communicate their controllers at any time instant. Our contributions are twofold. First, we present probabilistic algorithm to that, under certain conditions on plant and controller dynamics capacity network, ensure stochastic stability each in an NCS. Second, given static state-feedback such our satisfied. The main apparatus analysis is Markovian jump linear system representation individual involve sets matrix inequalities. numerical experiments demonstrate results.