arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.06035eess.SYcs.SY
收藏

衰减通信速率下的事件触发分布式估计

Event-Triggered Distributed Estimation With Decaying Communication Rate

Xingkang He, Yu Xing, Junfeng Wu, Karl H. Johansson

摘要:

研究了一组传感器的高维静态参数向量的分布式估计问题,传感器的通信网络由固定有向图建模。不同于现有的时间触发通信方案,事件触发的异步方案进行了研究,以减少通信,同时保持估计收敛。首先提出了一种基于事件触发的具有时变衰减门限的分布式估计算法。在事件触发机制下,每个传感器仅在当前估计值与上次发送的估计值之差大于触发阈值时才将其估计值发送给相邻传感器。在综合考虑传感器网络拓扑和传感器测量矩阵的条件下,证明了该算法分别具有均方收敛性和几乎处处收敛性。如果拓扑是一个包含生成树的平衡有向图,并且系统是集体可观测的,则满足该条件。此外,我们提供的收敛速度,这是有关的步长以及触发阈值的估计。此外,作为事件触发分布式算法中传感器通信强度的重要度量,通信速率随着时间的推移几乎必然以一定的速度衰减到零.我们表明,给定的步长,调整触发阈值的衰减速度可以导致估计误差的收敛速度和通信速率的衰减速度之间的权衡。具体地,增加阈值的衰减速度将使通信速率衰减得更快,但降低估计误差的收敛速度。数值模拟来说明开发的结果。

英文摘要:

We study distributed estimation of a high-dimensional static parameter vector through a group of sensors whose communication network is modeled by a fixed directed graph. Different from existing time-triggered communication schemes, an event-triggered asynchronous scheme is investigated in order to reduce communication while preserving estimation convergence. A distributed estimation algorithm with a single step size is first proposed based on an event-triggered communication scheme with a time-dependent decaying threshold. With the event-triggered scheme, each sensor sends its estimate to neighbor sensors only when the difference between the current estimate and the last sent-out estimate is larger than the triggering threshold. We prove that the proposed algorithm has mean-square and almost-sure convergence respectively, under an integrated condition of sensor network topology and sensor measurement matrices. The condition is satisfied if the topology is a balanced digraph containing a spanning tree and the system is collectively observable. Moreover, we provide estimates for the convergence rates, which are related to the step size as well as the triggering threshold. Furthermore, as an essential metric of sensor communication intensity in the event-triggered distributed algorithms, the communication rate is proved to decay to zero with a certain speed almost surely as time goes to infinity. We show that given the step size, adjusting the decay speed of the triggering threshold can lead to a tradeoff between the convergence rate of the estimation error and the decay speed of the communication rate. Specifically, increasing the decay speed of the threshold would make the communication rate decay faster, but reduce the convergence rate of the estimation error. Numerical simulations are provided to illustrate the developed results.

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

↑