Event-Triggered Pinning Control for Consensus of Multiagent Systems With Quantized Information

Wu, Zheng‐Guang; Xu, Yong; Pan, Ya‐Jun; Shi, Peng; Wang, Qian

doi:10.1109/tsmc.2017.2773634

Cited by 187 publications

(72 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The diagonal matrix

S false(t false) ≜ diag false{s_{1} false(t false), …, s_{m} false(t false) false}

, where s i ( t ) ∈ {0,1} is driven by a supervisory switching strategy (see Figure ), and S ( t ) will be used to search for the attacked links and then prevent the attacks from entering the plant. The quantizer is denoted as

q false(u false(t false) false) ≜ {false[q_{1} false(u_{1} false(t false) false), …, q_{m} false(u_{m} false(t false) false) false]}^{T} \in R^{m}

, whose quantization error is assumed to be bounded, ie,

normalΔ q false(u false(t false) false) ≜ q false(u false(t false) false) - u false(t false)

is bounded, where u i ( t ) is the i th component of u ( t ). Advanced embedded systems‐on‐chip render the possibility to equip the receiver with storage and computing capabilities, and then, it is reasonable to assume that the i th receiver outputs the product of the two inputs s i ( t ) and q i ( u i ( t )) + a i ( t ), where a i ( t ) is the i th component of a ( t ).…”

Section: Problem Statement and Preliminariesmentioning

confidence: 99%

Observer‐based attack‐resilient control for linear systems against FDI attacks on communication links from controller to actuators

Xie

Yang

2018

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

For the adversarial attacks on the communication links from the controller to the actuators, most of the existing attack-resilient control results focus on denial-of-service attacks. Unlike the existing results, this paper studies the observer-based attack-resilient control problem for linear systems with false data injection attacks and process disturbances. Due to limited resources, the malicious attacker is assumed to only manipulate a certain number of communication links from the controller to the actuators. A novel control architecture is proposed, which consists of an attack-resilient state observer, a controller gain scheme, and a supervisory switching strategy. The observer is developed based on the maximin strategy, and state estimation will be used to construct the controller. The switching strategy is designed to pick an appropriate controller gain and prevent the attack signals from entering the plant automatically. It is shown that the closed-loop system is stable with an attack-resilient performance.Finally, to verify the effectiveness of the proposed controller, simulation results on a linearized reduced-order aircraft system and an IEEE six-bus power system are provided. KEYWORDSattack-resilient control, cyber-physical systems, observer, supervisory switching strategy INTRODUCTIONCyber-physical systems (CPSs) integrate physical processes, computational resources, and communication capabilities 1 and merge the cyber-world with the physical world. CPSs have become prevalent in multifarious real-wold systems, including communication systems, power systems, and aerospace systems. Since CPSs are increasingly connected to the intranet and internet for remote monitoring and control, they become more vulnerable to malicious cyberattacks. For this reason, security issues of CPSs subject to cyberattacks have attracted considerable attention in the last decades. [2][3][4] In a networked control system, cyberattacks to the communication links can be broadly divided into two categories: denial-of-service (DoS) attacks and deception attacks. DoS attacks refer to obstructing/blocking the communication between networked agents 5,6 and causing packet losses. Deception attacks (including false data injection [FDI] attacks, 7,8 sparse attacks, 9 replay attacks, 10 zero-dynamic attacks, 11 etc) are intended to manipulate transmitted data packages and result in false feedback information. 8 For the immense field of CPSs' application, various problems have been investigated, eg, sensor scheduling, 12,13 secure state estimation, 14-16 and secure control. 17 4382It is also worth noting that there are many research challenges toward achieving a secure control objective, as argued in the work of Cardenas et al. 17 During recent years, some researchers have tried to solve the challenging secure control problem for CPSs.Related works on secure control: The secure estimation and control problem was addressed in the work of Fawzi et al 18 for the discrete-time systems with FDI sensor attacks. The main idea is to first design ...

show abstract

“…The diagonal matrix

S false(t false) ≜ diag false{s_{1} false(t false), …, s_{m} false(t false) false}

q false(u false(t false) false) ≜ {false[q_{1} false(u_{1} false(t false) false), …, q_{m} false(u_{m} false(t false) false) false]}^{T} \in R^{m}

, whose quantization error is assumed to be bounded, ie,

normalΔ q false(u false(t false) false) ≜ q false(u false(t false) false) - u false(t false)

Section: Problem Statement and Preliminariesmentioning

confidence: 99%

Observer‐based attack‐resilient control for linear systems against FDI attacks on communication links from controller to actuators

Xie

Yang

2018

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

show abstract

“…Since all the eigenvalues of the Laplacian matrix L N−1 of the completed graph with weights N − 1 are 1, all the eigenvalues of 2L N−1 + Λ w(0), f l are positive and less than 3, so it can be derived by (27) and (28) that…”

Section: Adaptive Guaranteed-performance Consensus Design For Leader-mentioning

confidence: 99%

“…The first one is to design a proper Lyapunov function which can translate the nonzero eigenvalues of the Laplacian matrix of the interaction topology rightward. The second one is to construct the relationship between the linear quadratic index and the Laplacian matrix of the interaction topology, as shown in (13) and (14) for leaderless cases and (27) and (28) for leader-follower cases.…”

Section: Adaptive Guaranteed-performance Consensus Design For Leader-mentioning

confidence: 99%

Adaptive guaranteed-performance consensus design for high-order multiagent systems

Yang

Liu

et al. 2018

Information Sciences

View full text Add to dashboard Cite

The current paper addresses the distributed guaranteed-performance consensus design problems for general high-order linear multiagent systems with leaderless and leaderfollower structures, respectively. The information about the Laplacian matrix of the interaction topology or its minimum nonzero eigenvalue is usually required in existing works on the guaranteed-performance consensus, which means that their conclusions are not completely distributed. A new translation-adaptive strategy is proposed to realize the completely distributed guaranteed-performance consensus control by using the structure feature of a complete graph in the current paper. For the leaderless case, an adaptive guaranteed-performance consensualization criterion is given in terms of Riccati inequalities and a regulation approach of the consensus control gain is presented by linear matrix inequalities. Extensions to the leader-follower cases are further investigated. Especially, the guaranteed-performance costs for leaderless and leader-follower cases are determined, respectively, which are associated with the intrinsic structure characteristic of the interaction topologies. Finally, two numerical examples are provided to demonstrate theoretical results.

show abstract

“…However, the synchronization conditions have not appeared under the condition that randomness of controller gain fluctuation, nonfragile character, sampled‐data, uncertainty, and time‐delays are considered in the state‐feedback controller. Many control methods have appeared to achieve synchronization including state‐feedback control, 16 adaptive control, 17 pinning control, 18,19 sliding mode control, 20 intermittent control, 21 and so on. Fragility is the basic problem of performance degradation of the feedback control for CDNs due to the phenomenon of inaccuracies in the process of implementing controller.…”

Section: Introductionmentioning

confidence: 99%

Novel results on nonfragile sampled‐data exponential synchronization for delayed complex dynamical networks

Zhao

Zhong

Zhang

et al. 2020

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

This article investigates exponential synchronization for complex dynamical networks (CDNs) with nonfragile sampled-data feedback control. An important yet challenging problem that contains the time delays of the controller, the uncertainties occurrence and randomness of controller gain fluctuation due to the packet loss, and time delays during data transmission is to be solved. A novel Lyapunov-Krasovskii functional (LKF) that allows for more free matrix terms and slacks certain one of the terms to nonpositive definite is first constructed based upon special refined block matrices. By employing the novel LKF and functional analysis theory, the nonfragile sampled-data feedback controller is developed to guarantee the exponential synchronization of CDNs and make a more optimal bound estimation of the sampled period. Finally, compared simulation examples are performed as significant to demonstrate the effective performance and the superiority of the proposed methods.

show abstract

Event-Triggered Pinning Control for Consensus of Multiagent Systems With Quantized Information

Cited by 187 publications

References 37 publications

Observer‐based attack‐resilient control for linear systems against FDI attacks on communication links from controller to actuators

Observer‐based attack‐resilient control for linear systems against FDI attacks on communication links from controller to actuators

Adaptive guaranteed-performance consensus design for high-order multiagent systems

Novel results on nonfragile sampled‐data exponential synchronization for delayed complex dynamical networks

Contact Info

Product

Resources

About