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

有限时间分布式状态估计 over 时间变化图:利用信息年龄

Finite-Time Distributed State Estimation over Time-Varying Graphs: Exploiting the Age-of-Information

Purdue University(普渡大学);Sandia National Laboratories(桑迪亚国家实验室)

Aritra Mitra, John A. Richards, Saurabh Bagchi, Shreyas Sundaram

AI总结:

本文研究了通过时间变化有向通信图中传感器节点协作估计离散时间线性时不变过程状态的问题,提出了一种分布式观测器,能够在单时间尺度上运行,具有与状态相同维度,并在联合可观测性和联合强连通性假设下实现稳定性和快速收敛。

摘要:

我们研究了通过时间变化有向通信图中传感器节点协作估计离散时间线性时不变过程状态的问题。现有方法要么对动态模型做出限制性假设,要么对通信图序列做出限制性假设,要么要求在动态时间步之间进行多次共识迭代,要么要求更高维的观测器。本文提出了一种分布式观测器,能够在单时间尺度上运行,具有与状态相同维度,并在联合可观测性和联合强连通性假设下实现稳定性和快速收敛。我们的方法基于一种新的“新鲜度指数”,用于跟踪网络中扩散的信息年龄。特别是,这些指数使节点能够拒绝关于系统状态的陈旧信息,并从而帮助实现估计误差动态的稳定性。基于所提出的方法,每个节点的估计可以以任意期望的收敛速率指数收敛到真实状态。事实上,我们论证通过适当选择观测器增益也可以实现有限时间收敛。我们的收敛证明是自包含的,并且使用了简单的线性系统理论和图论论证。

英文摘要:

We study the problem of collaboratively estimating the state of a discrete-time LTI process by a network of sensor nodes interacting over a time-varying directed communication graph. Existing approaches to this problem either (i) make restrictive assumptions on the dynamical model, or (ii) make restrictive assumptions on the sequence of communication graphs, or (iii) require multiple consensus iterations between consecutive time-steps of the dynamics, or (iv) require higher-dimensional observers. In this paper, we develop a distributed observer that operates on a single time-scale, is of the same dimension as that of the state, and works under mild assumptions of joint observability of the sensing model, and joint strong-connectivity of the sequence of communication graphs. Our approach is based on the notion of a novel "freshness-index" that keeps track of the age-of-information being diffused across the network. In particular, such indices enable nodes to reject stale information regarding the state of the system, and in turn, help achieve stability of the estimation error dynamics. Based on the proposed approach, the estimate of each node can be made to converge to the true state exponentially fast, at any desired convergence rate. In fact, we argue that finite-time convergence can also be achieved through a suitable selection of the observer gains. Our proof of convergence is self-contained, and employs simple arguments from linear system theory and graph theory.

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

↑