arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.06819eess.SYcs.SY
收藏

分布式状态估计框架下复杂网络传感器调度设计

Sensor Scheduling Design for Complex Networks under a Distributed State Estimation Framework

Peihu Duan, Lidong He, Lingying Huang, Guanrong Chen, Ling Shi

摘要:

本文研究了共享传输信道上复杂网络状态估计的传感器调度问题。对于一个由动力系统组成的复杂网络,即节点,采用传感器网络对系统状态进行分布式测量和估计,其中传感器用于测量节点。估计从传感器传输到相关联的节点,在一步的时间延迟的存在下,并受到数据包丢失。由于有限的传输能力,只有一部分传感器被允许在每个时间步发送信息。本文的目标是寻求一个最佳的传感器调度策略,使整体估计误差最小化。在分布式状态估计框架下,将该问题转化为一个马尔可夫决策过程,其中每个节点的一级奖励是强耦合的。保证了问题重构的可行性。此外,一个易于检查的条件,以保证存在一个最佳的确定性和平稳的政策。此外,它被发现的最优策略有一个阈值,可以用来减少计算复杂度,在获得这些政策。最后,通过几个仿真例子说明了理论结果的有效性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑