论文标题

线性系统的基于分形光谱的分布式状态估计

Split-Spectrum Based Distributed State Estimation for Linear Systems

论文作者

Wang, Lili, Liu, Ji, Anderson, Brian B. O., Morse, A. Stephen

论文摘要

本文研究了连续和离散时间线性系统的分布式状态估计问题。首先描述了简单的结构化分布式估计器(包括互连的本地估计器),用于估计连续和多通道线性系统的状态,其感应的输出分布在固定的多代理网络上。然后将估算器扩展到非平稳网络,其图形根据开关信号进行切换。只要满足了频谱分离形式的网络共享的高增益条件,估算器就可以确保解决问题。作为在整个网络上共享共同增益的替代方案,还研究了估算器的完全分布式版本,在该版本中,每个代理都会自适应地调整本地增益,尽管这种方法的实用性会受到适应性控制共同的鲁棒性问题。还研究了分布式状态估计问题的离散时间版本,并针对随时间变化的网络提出了基于频谱分离但不是高增益的相应估计器。对于每种情况,都可以解释如何构建估计器,以便本地估计器中的状态估计错误都以固定但任意选择的速率呈指数级快速地收敛到零,前提是该网络的图一直连接到始终连接。提出的估计量本质上可以弹性,对于算法依赖的代理数量和通信链接的突然变化,前提是该网络是有效的强烈连接并可以重新观察到的。

This paper studies a distributed state estimation problem for both continuous- and discrete-time linear systems. A simply structured distributed estimator (comprising interconnected local estimators) is first described for estimating the state of a continuous and multi-channel linear system whose sensed outputs are distributed across a fixed multi-agent network. The estimator is then extended to non-stationary networks whose graphs switch according to a switching signal. The estimator is guaranteed to solve the problem, provided a network-widely shared high gain condition achieving a form of spectrum separation is satisfied. As an alternative to sharing a common gain across the network, a fully distributed version of the estimator is also studied in which each agent adaptively adjusts a local gain, though the practicality of this approach is subject to a robustness issue common to adaptive control. A discrete-time version of the distributed state estimation problem is also studied, and a corresponding estimator based again on spectrum separation, but not high gain, is proposed for time-varying networks. For each scenario, it is explained how to construct the estimator so that the state estimation errors in the local estimators all converge to zero exponentially fast at a fixed but arbitrarily chosen rate, provided the network's graph is strongly connected for all time. The proposed estimators are inherently resilient to abrupt changes in the number of agents and communication links in the inter-agent communication graph upon which the algorithms depend, provided the network is redundantly strongly connected and redundantly jointly observable.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源