Sensor scheduling design for complex networks under a distributed state estimation framework

• Published in: Automatica (Oxford) Vol. 146; p. 110628
• Main Authors: Duan, Peihu, He, Lidong, Huang, Lingying, Chen, Guanrong, Shi, Ling
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.12.2022
• Subjects: Complex network; Distributed state estimation; Markov decision process; Sensor scheduling; Markov decision process; Distributed state estimation; Sensor scheduling; Complex network
• ISSN: 0005-1098; 1873-2836
• DOI: 10.1016/j.automatica.2022.110628

This paper investigates sensor scheduling for state estimation of complex networks over shared transmission channels. For a complex network of dynamical systems, referred to as nodes, a sensor network is adopted to measure and estimate the system states in a distributed way, where a sensor is used to measure a node. The estimates are transmitted from sensors to the associated nodes, in the presence of one-step time delay and subject to packet loss. Due to limited transmission capability, only a portion of sensors are allowed to send information at each time step. The goal of this paper is to seek an optimal sensor scheduling policy minimizing the overall estimation errors. Under a distributed state estimation framework, this problem is reformulated as a Markov decision process, where the one-stage reward for each node is strongly coupled. The feasibility of the problem reformulation is ensured. In addition, an easy-to-check condition is established to guarantee the existence of an optimal deterministic and stationary policy. Moreover, it is found that the optimal policies have a threshold, which can be used to reduce the computational complexity in obtaining these policies. Finally, the effectiveness of the theoretical results is illustrated by several simulation examples.