Message scheduling algorithms for Networked Control Systems with time slotted communication protocols

Feedback control systems, of which control loops are closed over a real-time communication network, are called Networked Control Systems (NCSs). In this study, the message scheduling problem for NCSs with time slotted communication protocols is tackled. First, an algorithmic approach is presented to check the necessary and sufficient conditions for a given message schedule such that the real-time requirements of the system are satisfied. Second, starting from an initial schedule, Simulated Annealing is used to compute an optimal schedule which satisfies the necessary and sufficient conditions for a given system. The schedule produced by the sufficiency condition algorithm is compared to the solution of the Simulated Annealing approach.