Kalman filtering for linear singular systems subject to round-robin protocol

Key words:  Networked control systems · Communication constraints · Round-robin protocol · Singular systems · Filtering

摘要:

Abstract:

This paper introduces a Kalman-type recursive state estimator for a class of discrete-time stochastic linear singular systems where the measurements are carried part by part periodically following a scheduling algorithm.We consider that the system is in a network with limited allotted bandwidth,which refers to a situationwhere the total available bandwidth for data transmission through the network is limited. This limitation can occur for various reasons, such as network congestion, resource allocation policies, or bandwidth limitations imposed by network administrators. In such networks, the entire measurement vector cannot be transmitted to the estimator instantly. Thus, managing a network with a limited allotted bandwidth requires careful planning, monitoring, and implementing some scheduling strategies to optimize the use of measured data while estimating the system states. We show that a scheduling method, namely, round-robin protocol, is suitable for singular systems to deal with such a scenario. The upper bound of the prior error covariance is studied via a periodic Riccati equation (PRE). To retain the boundedness of prior error covariance, the stability of the PRE is examined by the observability properties of the round-robin-induced system. Finally, a simulation example is presented to show the effectiveness of the designed filtering scheme.