# Stabilizing Scheduling Policies for Networked Control Systems

## TL;DR

This paper presents a method for designing periodic scheduling policies in networked control systems to ensure stability despite limited communication capacity, using graph-based cycle construction.

## Contribution

It introduces a novel graph-based approach to synthesize stabilizing scheduling policies for NCSs with shared communication channels.

## Key findings

- Proposes a cycle-based algorithm for stabilizing scheduling policies.
- Ensures global asymptotic stability of all plants in the NCS.
- Provides a systematic method for resource allocation in communication-constrained NCSs.

## Abstract

This paper deals with the problem of allocating communication resources for Networked Control Systems (NCSs). We consider an NCS consisting of a set of discrete-time LTI plants whose stabilizing feedback loops are closed through a shared communication channel. Due to a limited communication capacity of the channel, not all plants can exchange information with their controllers at any instant of time. We propose a method to find periodic scheduling policies under which global asymptotic stability of each plant in the NCS is preserved. The individual plants are represented as switched systems, and the NCS is expressed as a weighted directed graph. We construct stabilizing scheduling policies by employing cycles on the underlying weighted directed graph of the NCS that satisfy appropriate contractivity conditions. We also discuss algorithmic design of these cycles.