Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A scheduling algorithm for networked control systems (2101.00649v1)

Published 3 Jan 2021 in eess.SY and cs.SY

Abstract: This paper deals with the design of scheduling logics for Networked Control Systems (NCSs) whose shared communication networks have limited capacity. We assume that among (N) plants, only (M:(< N)) plants can communicate with their controllers at any time instant. We present an algorithm to allocate the network to the plants periodically such that stability of each plant is preserved. The main apparatus for our analysis is a switched systems representation of the individual plants in an NCS. We rely on multiple Lyapunov-like functions and graph-theoretic arguments to design our scheduling logics. The set of results presented in this paper is a continuous-time counterpart of the results proposed in [15]. We present a set of numerical experiments to demonstrate the performance of our techniques.

Citations (4)

Summary

We haven't generated a summary for this paper yet.