Resilient First-Order Consensus and Weakly Stable, Higher Order Synchronization of Continuous-Time Networked Multiagent Systems

被引:67
作者
LeBlanc, Heath J. [1 ]
Koutsoukos, Xenofon [2 ]
机构
[1] Ohio Northern Univ, Elect & Comp Engn & Comp Sci Dept, Ada, OH 45810 USA
[2] Vanderbilt Univ, Dept Elect Engn & Comp Sci, 221 Kirkland Hall, Nashville, TN 37235 USA
来源
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS | 2018年 / 5卷 / 03期
基金
美国国家科学基金会;
关键词
Adversary; Byzantine; consensus; distributed algorithms; resilience; robust networks; synchronization; FAULT-TOLERANT; ALGORITHMS; ROBUSTNESS; STRATEGIES;
D O I
10.1109/TCNS.2017.2696364
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Local interaction rules for consensus and synchronization are vital for many applications in distributed control of cyber-physical systems. However, most research in this area assumes all nodes (or agents) in the networked system cooperate. This paper considers local interaction rules for resilient first-order consensus and weakly stable, higher order synchronization whenever some of the agents in the network are Byzantine-like adversaries defined in a continuous-time setting. The normal agents have identical dynamics modeled by continuous-time, linear, time-invariant, weakly stable systems. Agents in the networked system influence one another by sharing state or output information according to a directed, time-varying graph. We present a resilient consensus protocol as well as dynamic state and output feedback control laws for the normal agents, to achieve the resilient consensus and synchronization objectives, respectively. We characterize the required network topologies using the property of network robustness. We demonstrate the results in simulation examples to illustrate the resilient synchronization output feedback control law.
引用
收藏
页码:1219 / 1231
页数:13
相关论文
共 43 条
[11]   REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTS [J].
DOLEV, D ;
LYNCH, NA ;
PINTER, SS ;
STARK, EW ;
WEIHL, WE .
JOURNAL OF THE ACM, 1986, 33 (03) :499-516
[12]  
Forouzan B, 2007, Cryptography and Network Security
[13]   SATS: Secure Average-Consensus-Based Time Synchronization in Wireless Sensor Networks [J].
He, Jianping ;
Cheng, Peng ;
Shi, Ling ;
Chen, Jiming .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (24) :6387-6400
[14]   Resilient network coding in the presence of Byzantine adversaries [J].
Jaggi, S. ;
Langberg, M. ;
Katti, S. ;
Ho, I. ;
Katabi, D. ;
Medard, M. .
INFOCOM 2007, VOLS 1-5, 2007, :616-624
[15]   SYNCHRONIZING CLOCKS IN THE PRESENCE OF FAULTS [J].
LAMPORT, L ;
MELLIARSMITH, PM .
JOURNAL OF THE ACM, 1985, 32 (01) :52-78
[16]   THE BYZANTINE GENERALS PROBLEM [J].
LAMPORT, L ;
SHOSTAK, R ;
PEASE, M .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401
[17]  
LeBlanc H.J., 2013, P 16 INT C HYBR SYST, P21
[18]  
LeBlanc H, 2011, HSCC 11: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL, P281
[19]  
LeBlanc HJ, 2013, P AMER CONTR CONF, P1237
[20]   Resilient Asymptotic Consensus in Robust Networks [J].
LeBlanc, Heath J. ;
Zhang, Haotian ;
Koutsoukos, Xenofon ;
Sundaram, Shreyas .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (04) :766-781