Consensus-Based Distributed Reduced-Order Observer Design for LTI Systems

被引:28
作者
Wang, Xiaoling [1 ]
Jiang, Guo-Ping [1 ]
Su, Housheng [2 ]
Zeng, Zhigang [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Automat, Coll Artificial Intelligence, Jiangsu Engn Lab IoT Intelligent Robots, Nanjing 210023, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Artificial Intelligence & Automat, Image Proc & Intelligent Control Key Lab, Educ Minist China, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Observers; Linear systems; Directed graphs; Topology; Adaptive systems; Consensus protocol; Adaptive strategy; consensus; linear time-invariant (LTI) system; reduced-order observer; DYNAMICS;
D O I
10.1109/TCYB.2020.3025603
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we refocus on the distributed observer construction of a continuous-time linear time-invariant (LTI) system, which is called the target system, by using a network of observers to measure the output of the target system. Each observer can access only a part of the component information of the output of the target system, but the consensus-based communication among them can make it possible for each observer to estimate the full state vector of the target system asymptotically. The main objective of this article is to simplify the distributed reduced-order observer design for the LTI system on the basis of the consensus communication pattern. For observers interacting on a directed graph, we first address the problem of the distributed reduced-order observer design for the detectable target system and provide sufficient conditions involving the topology information to guarantee the existence of the distributed reduced-order observer. Then, the dependence on the topology information in the sufficient conditions will be eliminated by using the adaptive strategy and so that a completely distributed reduced-order observer can be designed for the target system. Finally, some numerical simulations are proposed to verify the theoretical results.
引用
收藏
页码:6331 / 6341
页数:11
相关论文
共 25 条
[1]   A Simple Approach to Distributed Observer Design for Linear Systems [J].
Han, Weixin ;
Trentelman, Harry L. ;
Wang, Zhenhua ;
Shen, Yi .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (01) :329-336
[2]   Towards a minimal order distributed observer for linear systems [J].
Han, Weixin ;
Trentelman, Harry L. ;
Wang, Zhenhua ;
Shen, Yi .
SYSTEMS & CONTROL LETTERS, 2018, 114 :59-65
[3]   Swarming Behavior of Multiple Euler-Lagrange Systems With Cooperation-Competition Interactions: An Auxiliary System Approach [J].
Hu, Hong-Xiang ;
Wen, Guanghui ;
Yu, Wenwu ;
Xuan, Qi ;
Chen, Guanrong .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (11) :5726-5737
[4]   Collaborative scalar-gain estimators for potentially unstable social dynamics with limited communication [J].
Khan, Usman A. ;
Jadbabaie, Ali .
AUTOMATICA, 2014, 50 (07) :1909-1914
[5]   Completely Decentralized Design of Distributed Observer for Linear Systems [J].
Kim, Taekyoo ;
Lee, Chanhwa ;
Shim, Hyungbo .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (11) :4664-4678
[6]   Consensus of Multi-Agent Systems With General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols [J].
Li, Zhongkui ;
Ren, Wei ;
Liu, Xiangdong ;
Fu, Mengyin .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (07) :1786-1791
[7]   Opinion dynamics with similarity-based random neighbors [J].
Liu, Qipeng ;
Wang, Xiaofan .
SCIENTIFIC REPORTS, 2013, 3
[8]   Nonsmooth Finite-Time Synchronization of Switched Coupled Neural Networks [J].
Liu, Xiaoyang ;
Cao, Jinde ;
Yu, Wenwu ;
Song, Qiang .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (10) :2360-2371
[9]   Distributed Consensus of Second-Order Multi-Agent Systems With Heterogeneous Unknown Inertias and Control Gains Under a Directed Graph [J].
Mei, Jie ;
Ren, Wei ;
Chen, Jie .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (08) :2019-2034
[10]   Distributed Observers for LTI Systems [J].
Mitra, Aritra ;
Sundaram, Shreyas .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (11) :3689-3704