Scheduling networked control systems under known data loss patterns

Abstract

This paper deals with the design of scheduling logics for Networked Control Systems (NCSs) whose shared networks have limited communication capacity and are prone to data losses. We assume that an upper bound on the number of consecutive data losses is known a priori, and present an algorithm to allocate the network among the plants of the NCS such that stability of each plant is preserved under all admissible data loss signals. The main apparatus for our analysis is a switched systems representation of the individual plants in an NCS. We rely on matrix commutators (Lie brackets) between the stable and unstable modes of operation of the plants to guarantee stability under our scheduling logics.