Group consensus of multi-agent systems subjected to cyber-attacks*

We investigate the problem of ℋ ∞ state estimation for discrete-time Markov jump neural networks. The transition probabilities of the Markov chain are assumed to be piecewise time-varying, and the persistent dwell-time switching rule, as a more general switching rule, is adopted to describe this variation characteristic. Afterwards, based on the classical Lyapunov stability theory, a Lyapunov function is established, in which the information about the Markov jump feature of the system mode and the persistent dwell-time switching of the transition probabilities is considered simultaneously. Furthermore, via using the stochastic analysis method and some advanced matrix transformation techniques, some sufficient conditions are obtained such that the estimation error system is mean-square exponentially stable with an ℋ ∞ performance level, from which the specific form of the estimator can be obtained. Finally, the rationality and effectiveness of the obtained results are verified by a numerical example.

“…Step 2 Setting m ∈ [m q d , m q d+1 ), from inequality (10), one can obtain the following inequality according to Eqs. ( 12) and ( 13):…”

Section: Proofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

ℋ_∞state estimation for Markov jump neural networks with transition probabilities subject to the persistent dwell-time switching rule*

Shen

Xia

et al. 2021

“…In recent years, much attention was paid to the consensus problem for the first-order multi-agent system (MAS). [6][7][8] Compared with the first-order MAS, problems considered in second-order MASs [9][10][11][12][13] are more complex. In Ref.…”

Section: Introductionmentioning

confidence: 99%

Fixed-time group consensus of second-order multi-agent systems based on event-triggered control

Sun

Zhu

et al. 2023

The problem of fixed-time group consensus for second-order multi-agent systems with disturbances is investigated. For cooperative-competitive network, two different control protocols, fixed-time and fixed-time event-triggered group consensus, are designed. It is demonstrated that there is no Zeno behavior under the designed event-triggered control. Meanwhile, it is proven that for an arbitrary initial state of the system, group consensus within the settling time could be obtained under the proposed control protocols by using matrix analysis and graph theory. Finally, a series of numerical examples are propounded to illustrate the performance of the proposed control protocol.

“…In Refs. [1][2][3][4][5][6][7][8][9][10][11][12][13][14], agents were assumed to keep cooperative relationships with each other. However, in Refs.…”

Section: Introductionmentioning

confidence: 99%

Consensus problems on networks with free protocol*

Liu¹,

Mo²

2021

In the real world, rule makers can only restrict, not completely control the behavior of the governed, while the governed can only choose their behavior patterns under these restrictions. In this paper, we design a new control protocol called free protocol to describe this situation. First, we calculate consensus probabilities based on the information of the interaction networks. Then, sufficient conditions are obtained for all agents converging to a same value with probability one. Finally, numerical simulation results are given to verify the above results.