论文标题
网络控制系统的概率调度算法
A probabilistic scheduling algorithm for networked control systems
论文作者
论文摘要
本文介绍了通信网络容量有限的网络控制系统（NCSS）的调度逻辑的设计。我们假设只有一部分植物可以随时与其控制器进行通信。我们的贡献是双重的。首先，我们提出了一种概率算法来设计调度逻辑，该逻辑在工厂和控制器动力学的某些条件下以及网络的容量中，确保每种植物在NCS中的随机稳定性。其次，鉴于植物动力和网络的能力，我们设计了静态状态反馈控制器，使我们的调度逻辑下的稳定性条件得到满足。我们分析的主要设备是Markovian跳跃线性系统在NCS中的单个植物表示。我们的稳定性条件涉及一组基质不等式。我们提出数值实验以证明我们的结果。
This paper deals with the design of scheduling logics for Networked Control Systems (NCSs) whose communication networks have limited capacity. We assume that only a subset of the plants can communicate with their controllers at any time instant. Our contributions are twofold. First, we present a probabilistic algorithm to design scheduling logics that, under certain conditions on the plant and controller dynamics and the capacity of the network, ensure stochastic stability of each plant in an NCS. Second, given the plant dynamics and the capacity of the network, we design static state-feedback controllers such that the conditions for stability under our scheduling logics are satisfied. The main apparatus for our analysis is a Markovian jump linear system representation of the individual plants in an NCS. Our stability conditions involve sets of matrix inequalities. We present numerical experiments to demonstrate our results.
