Kundu, A (2021) Scheduling networked control systems under limited communication capacity. In: 2021 60th IEEE Conference on Decision and Control (CDC), 13-17 Dec 2021, Austin, TX, USA, pp. 6946-6951.
PDF
CDC_2022.pdf - Published Version Restricted to Registered users only Download (299kB) | Request a copy |
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 12. We present a set of numerical experiments to demonstrate the performance of our techniques. © 2021 IEEE.
Item Type: | Conference Proceedings |
---|---|
Publication: | Proceedings of the IEEE Conference on Decision and Control |
Publisher: | Institute of Electrical and Electronics Engineers Inc. |
Additional Information: | The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc. |
Keywords: | Continuous time systems; Graph theory; Scheduling, Communication capacity; Communications networks; Continous time; Graph theoretics; Limited capacity; Limited communication; Multiple Lyapunov-like functions; Scheduling logic; Switched system; System representation, Networked control systems |
Department/Centre: | Division of Electrical Sciences > Electrical Engineering |
Date Deposited: | 15 May 2022 17:03 |
Last Modified: | 15 May 2022 17:03 |
URI: | https://eprints.iisc.ac.in/id/eprint/71663 |
Actions (login required)
View Item |