Mean Square Consensus of General Linear Multiagent Systems with Communication Noises under Switching Topologies

Chen, Kairui; Yan, Chuance; Ren, Qijun; Zeng, Xianxian; Wang, Junwei

doi:https://doi.org/10.1155/2022/1337959

Complexity

On this page

Abstract Introduction Conclusions Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Behavior Analysis, Complexity and Control of Networked Dynamical Systems 2022

View this Special Issue

Research Article | Open Access

Volume 2022 | Article ID 1337959 | https://doi.org/10.1155/2022/1337959

Mean Square Consensus of General Linear Multiagent Systems with Communication Noises under Switching Topologies

Kairui Chen,^1,2Chuance Yan,¹Qijun Ren,³Xianxian Zeng,⁴and Junwei Wang³

Academic Editor: Xiao Ling Wang

Received22 Feb 2022

Revised17 May 2022

Accepted27 Jun 2022

Published13 Aug 2022

Abstract

This paper investigates the distributed consensus problem of general linear multiagent systems (MASs) with communication noises under fixed and Markovian switching topologies, respectively. Each agent can obtain full state of itself and receive its neighbors’ state with noises, where intensities of noises are vector functions of relative states of agents. Bearing in mind the above constrains, a consensus protocol is proposed, where the gain matrix is obtained by the algebraic Riccati equation and the coupling strength is restricted in a given interval. By using the stochastic stability theorem, we show that mean square consensus is achieved in fixed topology case and switching topologies case, respectively. Furthermore, an estimation of the exponential convergence rate of consensus is given explicitly. Finally, simulation examples are given to show the correctness of the proposed results.

1. Introduction

In system and control community, the coordination problem of MASs is one of the most concerned hotspots in the past decade, which has shown its potential in real-world applications, such as distributed sensor networks, smart grids, and multirobot formation [1–4]. Consensus is a fundamental issue in the control problem of MASs, which refers to designing a protocol such that all agents converge to a common value. Research results on the consensus problem can be extended to solve many coordination problems of MASs, including flocking, swarming, and rendezvous formation [5–7].

In real world, agents and their connections are often affected by noises, which could sometimes affect the performance or even destroy the stability of systems [8, 9]. Generally, noises can be divided into two categories: additive noise and multiplicative noise, and both kinds of noises have been considered in the study of MASs [10]. For additive noise, which destroys the signal in the form of superposition, its intensity is determined by external factors, such as lightning, and pulse. In 2009, Huang and Manton introduced the stochastic approximation technique to design a decreasing nonnegative gain function , which could attenuate the impact of additive noise while letting the MASs achieve consensus [11]. The idea of nonnegative gain function was then utilized by some scholars to investigate MASs with additive noise. For example, Li et al. proposed sufficient and necessary conditions for the decreasing nonnegative gain function to achieve asymptotic unbiased mean square average consensus [12]. Based on these results, leader-following consensus problem was solved in [13], containment control problem was studied in [14], and bipartite consensus problem was concerned in [15]. For multiplicative noise, its intensity depends on states of the system, e.g., measuring relative states through analog fading channels [16]. In [17], by using the small gain theorem, Zhang et al. developed necessary and sufficient conditions for mean square consensus and almost sure consensus for MASs. By using the stochastic stability theorem, heterogeneous MASs were studied in [18], and MASs with nonidentical channel fading were analyzed in [19]. In practical applications, the two kinds of noise may coexist in MASs [20]. Motivated by this phenomenon, MASs with both additive and multiplicative noises were considered in [10] for the consensus problem, and in [21], for the containment control problem. However, in the above studies, the concerned MASs were in first- or second-order dynamics under fixed topology.

Typically, agents are connected through a network, which is not only affected by noises, but also has problems of link failure or abrupt change, etc. [22–25]. Many significant results on MASs under switching topologies have been addressed [26–29]. It can be found that the switching signals in many existing results were subject to deterministic time sequences [30–32]. However, due to unpredictable changes in the communication networks, it is more significant to study the case that topologies switch randomly [33]. In [34], consensus problem of double-integrator MASs was studied under Markovian switching topologies. In [35, 36], consensus problems were investigated for MASs with semi-Markovian switching topologies. In addition, there are reports involving Markovian switching topologies and communication noises at the same time. For example, in [13], Wang et al. considered the mean square and almost sure consensus problem for MASs with Markovian switching topologies and additive noises. The results in [13] were then extended in [37], where sufficient and necessary conditions were obtained for single-integrator MASs with Markovian switching topologies and additive noises.

Inspired by the above discussions, mean square consensus of general linear MASs with communication noises under Markovian switching topologies is investigated in this paper. Consensus protocol will be designed by combining the stochastic stability theory, the Riccati equation, and some theories on matrix. The contributions of this paper are summarized as follows:(i)Consensus problem of general linear MASs with communication noises is studied. The considered noises are induced by the communication among agents, which is a distinct feature of networked systems. Moreover, the general linear MASs include some results concerned with first-order MASs as special cases [37].(ii)To capture the time-varying communication among agents in real, we extend the consensus problem by studying the switching topologies case. We assume that the switching signals are subject to a Markovian process, under which we merely require the combined topology rather than each underlying topology being connected.

We organize the rest of the paper in the following way. Section 2 contains some useful preliminaries and a formulation of the problem. In Sections 3 and 4, consensus results for fixed and Markovian switching topologies under communication noises are provided. Section 5 is devoted to simulation examples. Finally, a conclusion of the paper is given in Section 6.

The following notations will be used. We define a column vector that is all ones as , the -dimensional column vector with the th element being 1 and others being zero as , the matrix as , and the -dimensional identity matrix as . For any given square matrix , define . Denote for . denotes the mathematical expectation.

2. Problem Formulation

2.1. Graph Theory

Let be an undirected graph, where is the set of nodes; is the set of edges. Node means agent . An edge of is denoted by , and it implies that the information can be exchanged between node and node . The adjacency matrix represents the structure of the graph, where if , otherwise, . Assume that there are no self-loops, i.e., for all . The set of neighbors of agent is denoted as . Let , where is the degree of agent . The Laplacian matrix of is defined to be .

For a positive integer , the union of graphs is denoted by . Let ) be the interaction topology of agents at time , where the edge set and the adjacency matrix are time varying.

Lemma 1 (see [26]). If is a connected graph that is undirected, is the corresponding Laplacian matrix, and its eigenvalues can be ordered in ascending order asandwhere is called the algebraic connectivity of .

2.2. Problem Formulation

In this section, we consider MASs with the following dynamics:where is the state of the th agent and is the control input. and are given constant matrices with appropriate dimensions satisfying that is controllable.

Remark 1. Comparing with first-order systems, states in general linear system (3) are coupled through matrix and the control is not placed on the state directly. It can be found that the general linear MASs (3) include the first-order MASs in [37] as special cases. Therefore, in this paper, we require to be controllable and employ the Riccati equation to obtain a feasible gain matrix. Then, a kind of Lyapunov function, which differs from that in integrator cases, will be designed to prove the stability of the consensus error.
In real MASs, each agent receives information from its neighbors with random perturbations. Hence, when agent communicates with its neighbor agent , agent receives the state of agent in the following form:where denotes the measurement of by agent and denotes the communication noises. The noise intensity function is a mapping from to . There exists a constant , such that , , and, for any . The noise process satisfies , , where is an independent Brownian motion.
Due to the existence of communication noises, the consensus protocol is designed aswhere is the coupling strength and is the gain matrix to be designed later.
In this work, we also consider the consensus of MASs (3) over randomly switching topologies and the consensus protocol is modified as follows:where is the element of and will randomly switch among distinct topologies , and , if and only if the random variable . The switching process is governed by a time-homogeneous Markov process, whose state space corresponds to all possible topologies.
For MASs (3) and distributed control protocols (5) or (6), the following questions need to be addressed. (i) Under what conditions can the mean square consensus be achieved? (ii) How to design the control gain matrix and coupling strength ?
In this paper, the common probability space for all random variables is denoted by , where is the sample space of elementary events. is the -field of subsets of the sample space and is the probability measure on . Let the infinitesimal generator of the continuous-time Markov process be , which is given bywhere is the transition rate from state to state with , if , , and denote an infinitesimal of a higher order than , that is, . Note that is a transition rate matrix, whose row summation is zero and all off-diagonal elements are non-negative.

Definition 1. The MASs (3) with proper designed consensus protocol are said to achieve mean square consensus if for any given

Remark 2. Mean square stable is generally used to reflect the stability of a stochastic system. Due to the existence of noises, the overall MASs become stochastic systems. Therefore, the mean square consensus defined above is suitable to describe the consensus of the concerned MASs with noises.

3. Consensus on Fixed Topology

Substituting consensus protocol (5) into (3), we get

As is controllable and let matrices be positive definite. The control gain matrix is designed aswhere is the unique positive definite solution to the following algebraic Riccati equation (ARE)

Theorem 1. For the undirected connected graph, the MASs (3) with communication noises achieve mean square consensus under consensus protocol (3), if is designed as (10) and satisfies

Proof. Denote ; we haveAccording to the definition of and , we can get . Let . Using It ’s formula [38], we havewhere .
By using in (10) and the inequality in (12), we haveCombining (14) and (15), we havewhereFinally, we haveThen by the comparison theorem [39], we getleading to . This completes the proof.

Remark 3. Comparing with existing works concerning with noises, general linear MASs with communication noises are considered in this paper. For MASs with additive noises, stochastic approximation technique was widely adopted, which resulted in time-varying coupling strengths [12, 21]. In this paper, by employing Riccati equation and It ’s formula, the coupling strength in the consensus protocol is time-invariant, but restricted in a given interval. For some works dealt with communication noises, the concerned MASs were in first-order dynamics, which were special cases of this paper [37].

4. Consensus on Markovian Switching Topologies

In this section, we will analyze consensus of MASs (3) on Markovian switching topologies.

Theorem 2. Assume that the union graph of is connected, the MASs (3) achieve mean square consensus under consensus protocol (6), if is designed as (9) and satisfies

Proof. The dynamics of error system in switching topologies case isIn this case, we choose a Lyapunov function for aswhere admits a unique stationary distribution . Then the Lyapunov function for the overall system can be expressed as .
By using the stationary distribution , the expectation of becomesBy employing the It ’s formula, we havewhere . Similar to (10), we haveBy (24) and (25), it yieldswhere .
Similar to (16), we getThis completes the proof.

Remark 4. In light of the assumption on the vector function , the intensity of noises gets weaker while achieving consensus. Specifically, when the norm of relative state between two agents decreases, the intensity of noise in their communication channel becomes smaller. Therefore, compared with additive noises, the multiplicative noises with intensities depending on relative states can better describe noises in the analog fading communication channel. If all of the communication noises , our result can be degenerated into the noise-free case [22].

Remark 5. Compared with existing studies, we consider Markovian switching topologies and communication noises for general linear MASs. In this case, the impact of noises on the MASs is changing while the underlying topology is switching, which brings challenges for the analysis of the consensus problem. Compared with the fixed topology case, we only require the combined topology to be connected, which relax the assumption on the topology at each instant.

5. Simulation Example

In this section, we present two numerical examples to verify our theoretical results. We consider a MAS of 6 agents under fixed topology and under switching topology in Examples 1 and 2, respectively.

Example 1. Considering a MAS with the following dynamics:The underlying communication topology is depicted in Figure 1. The corresponding Laplacian matrix isWe chooseAccording to ARE (10), we haveLet , , and by simple calculation, we have , which ensures the sufficient condition (9) in Theorem 1. The noises here are subject to Brownian process and the simulation is conducted by the Euler–Maruyama method. Under these settings, the MASs achieve consensus as shown in Figure 2. According to Figure 2, we find that the process of achieving consensus is chartering due to the existence of communication noises. We generate 100 sample paths to simulate the mean square average, and Figure 3 shows the system achieves mean square consensus.

Example 2. Consider a MAS of 6 agents with the interaction topology randomly switches among , , and in Figure 4. The Laplacian of the combined graph is . The transition rate matrix is chosen asLet , , and by simple calculation, we have , which ensures the sufficient condition (19) in Theorem 2. Figure 5 shows the sample paths of 6 agents under a known generator matrix. After a realization of randomly switching topologies, the consensus is reached. Figure 6 shows the switching signals, which are subject to a Markovian process. Compared with Example 1, it takes much longer for the switching topologies case to achieve consensus. We generate 100 sample paths to simulate the mean square average, and Figure 7 shows the MAS achieves mean square consensus.

(a)

(b)

(c)

(d)

6. Conclusions

Motivated by the uncertainties in real communication networks, in this article, we study the consensus problem of the general linear continuous-time MASs with communication noises. Each agent can obtain full state of itself and receive its neighbors’ state information with noises, whose intensity is a vector function of agents’ relative states. Research is conducted on both fixed topology and switching topologies, respectively. Mean square consensus is proved by using stochastic analysis and algebraic graph theory, and an estimation of the exponential convergence rate of consensus is given. For future research on this topic, the case of finite time consensus will be taken into account.

Data Availability

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (62103115 and 11771102), in part by the Natural Science Foundation of Guangdong Province (2021A1515011636), in part by the Science and Technology Research Program of Guangzhou (202102020975), in part by the Special Projects in Key Fields of Colleges and Universities in Guangdong Province (2021ZDZX1109), in part by the Characteristic Innovation Projects of Colleges and Universities in Guangdong Province, China (2019GKTSCX081), and in part by the Yangcheng Scholars Scientific Research Project of Colleges and Universities in Guangzhou City (202235364).

References

K. Shen, C. Zhang, P. Dong, Z. Jing, and H. Leung, “Consensus-based labeled multi-Bernoulli filter with event-triggered communication,” IEEE Transactions on Signal Processing, vol. 70, pp. 1185–1196, 2022.
View at: Publisher Site | Google Scholar
O. Mahela, M. Khosravy, N. Gupta et al., “Comprehensive overview of multi-agent systems for controlling smart grids,” CSEE Journal of Power and Energy Systems, vol. 8, no. 1, pp. 115–131, 2022.
View at: Google Scholar
Y. Zhou, J. Xiao, Y. Zhou, and G. Loianno, “Multi-robot collaborative perception with graph neural networks,” IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 2289–2296, 2022.
View at: Publisher Site | Google Scholar
K. Chen, J. Wang, Y. Zhang, and Z. Liu, “Leader-following consensus for a class of nonlinear strick-feedback multiagent systems with state time-delays,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 50, no. 7, pp. 2351–2361, 2020.
View at: Publisher Site | Google Scholar
Y. Xu and S. Xu, “A novel connectivity-preserving control design for rendezvous problem of networked uncertain nonlinear systems,” IEEE Transactions on Neural Networks and Learning Systems, vol. 31, no. 12, pp. 5127–5137, 2020.
View at: Publisher Site | Google Scholar
S. Su and H. Su, “A fully distributed protocol for flocking of time-varying linear systems with dynamic leader and external disturbance,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 52, no. 2, pp. 1234–1242, 2022.
View at: Publisher Site | Google Scholar
M. H. Qasem, N. Obeid, A. Hudaib, M. A. Almaiah, A. Al-Zahrani, and A. Al-Khasawneh, “Multi-agent system combined with distributed data mining for mutual collaboration classification,” IEEE Access, vol. 9, 2021.
View at: Publisher Site | Google Scholar
T. Zhang and J. F. Zhang, “Consensus conditions of multi-agent systems with time-varying topologies and stochastic communication noises,” IEEE Transactions on Automatic Control, vol. 55, no. 9, pp. 2043–2057, 2010.
View at: Publisher Site | Google Scholar
J. Wang, Y. Yan, C. Ma, Z. Liu, K. Ma, and C. Philip Chen, “Fuzzy adaptive event-triggered finite-time constraint control for output-feedback uncertain nonlinear systems,” Fuzzy Sets and Systems, vol. 443, pp. 236–257, 2022.
View at: Publisher Site | Google Scholar
X. Zong, T. Li, and J. F. Zhang, “Consensus conditions of continuous-time multi-agent systems with additive and multiplicative measurement noises,” SIAM Journal on Control and Optimization, vol. 56, no. 1, pp. 19–52, 2018.
View at: Publisher Site | Google Scholar
M. Manton and J. H. Manton, “Coordination and consensus of networked agents with noisy measurements: stochastic algorithms and asymptotic behavior,” SIAM Journal on Control and Optimization, vol. 48, no. 1, pp. 134–161, 2009.
View at: Publisher Site | Google Scholar
T. Li, J. F. Zhang, and J. Zhang, “Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions,” Automatica, vol. 45, no. 8, pp. 1929–1936, 2009.
View at: Publisher Site | Google Scholar
Y. Wang, L. Cheng, W. Ren, Z. G. Hou, and M. Tan, “Seeking consensus in networks of linear agents: communication noises and Markovian switching topologies,” IEEE Transactions on Automatic Control, vol. 60, no. 5, pp. 1374–1379, 2015.
View at: Publisher Site | Google Scholar
W. Li, L. Xie, and J. F. Zhang, “Containment control of leader-following multi-agent systems with Markovian switching network topologies and measurement noises,” Automatica, vol. 51, pp. 263–267, 2015.
View at: Publisher Site | Google Scholar
Y. Du, Y. Wang, and Z. Zuo, “Mean square bipartite consensus for multiagent systems with antagonistic information and time-varying topologies,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 52, no. 3, pp. 1744–1754, 2022.
View at: Publisher Site | Google Scholar
R. Zong and X. Zong, “Time‐varying formation control of linear multiagent systems with time delays and multiplicative noises,” International Journal of Robust and Nonlinear Control, vol. 31, no. 18, pp. 9008–9025, 2021.
View at: Publisher Site | Google Scholar
T. Li, F. Wu, and J. F. Zhang, “Multi-agent consensus with relative-state-dependent measurement noises,” IEEE Transactions on Automatic Control, vol. 59, no. 9, pp. 2463–2468, 2014.
View at: Publisher Site | Google Scholar
K. Zhang, Y. Zhang, X. Zong, and R. Li, “Mean square and almost sure consensus of heterogeneous multi‐agent systems with multiplicative noise,” International Journal of Robust and Nonlinear Control, vol. 32, no. 4, pp. 2399–2419, 2022.
View at: Publisher Site | Google Scholar
J. Xu, Z. Zhang, and W. Wang, “Mean-square consentability of multiagent systems with nonidential channel fading,” IEEE Transactions on Automatic Control, vol. 66, no. 4, pp. 1887–1894, 2021.
View at: Publisher Site | Google Scholar
Y. Du, Y. Wang, and Z. Zuo, “Bipartite consensus for multi-agent systems with noises over Markovian switching topologies,” Neurocomputing, vol. 419, pp. 295–305, 2021.
View at: Publisher Site | Google Scholar
Y. Du, Y. Wang, Z. Zuo, and W. Zhang, “Containment control for distributed networks subject to multiplicative and additive noises with stochastic approximation-type protocols,” International Journal of Robust and Nonlinear Control, vol. 30, no. 2, pp. 665–684, 2019.
View at: Publisher Site | Google Scholar
K. You, Z. Li, and L. Xie, “Consensus condition for linear multi-agent systems over randomly switching topologies,” Automatica, vol. 49, no. 10, pp. 3125–3132, 2013.
View at: Publisher Site | Google Scholar
J. Wang, H. Zhang, K. Ma, Z. Liu, C. L. P. Chen, and J. Liu, “Neural adaptive self-triggered control for uncertain nonlinear systems with input hysteresis,” IEEE Transactions on Neural Networks and Learning Systems, 2021.
View at: Publisher Site | Google Scholar
J. Wang, Z. Liu, Y. Zhang, and C. P. Chen, “A novel fuzzy control with filter-based event-triggered mechanism for nonlinear uncertain stochastic systems suffered input hysteresis,” Fuzzy Sets and Systems, vol. 432, pp. 68–88, 2022.
View at: Publisher Site | Google Scholar
J. Wang, W. Chen, K. Ma, Z. Liu, and C. L. Philip Chen, “Adaptive neural event‐triggered control for nonlinear uncertain system with input constraint based on auxiliary system,” International Journal of Robust and Nonlinear Control, vol. 31, no. 15, pp. 7528–7545, 2021.
View at: Publisher Site | Google Scholar
R. Olfati-Saber and R. Murray, “Consensus problems in networks of agents with switching topology and time-delays,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1520–1533, 2004.
View at: Publisher Site | Google Scholar
W. Cheng and D. Cheng, “Leader-following consensus of multi-agent systems under fixed and switching topologies,” Systems & Control Letters, vol. 59, no. 3-4, pp. 209–217, 2010.
View at: Publisher Site | Google Scholar
Y. Wang and L. Wang, “Distributed consensus of heterogeneous multi-agent systems with fixed and switching topologies,” International Journal of Control, vol. 85, no. 12, pp. 1967–1976, 2012.
View at: Publisher Site | Google Scholar
S. A. Ajwad, E. Moulay, M. Defoort, T. Menard, and P. Coirault, “Leader-following consensus of second-order multi-agent systems with switching topology and partial aperiodic sampled data,” IEEE Control Systems Letters, vol. 5, no. 5, pp. 1567–1572, 2021.
View at: Publisher Site | Google Scholar
S. Li, G. Feng, J. Wang, X. Luo, and X. Guan, “Adaptive control for cooperative linear output regulation of heterogeneous multi‐agent systems with periodic switching topology,” IET Control Theory & Applications, vol. 9, no. 1, pp. 34–41, 2015.
View at: Publisher Site | Google Scholar
Z. Li, M. Z. Chen, and Z. Ding, “Distributed adaptive controllers for cooperative output regulation of heterogeneous agents over directed graphs,” Automatica, vol. 68, pp. 179–183, 2016.
View at: Publisher Site | Google Scholar
X. Li, M. Z. Q. Chen, H. Su, and C. Li, “Distributed bounds on the algebraic connectivity of graphs with application to agent networks,” IEEE Transactions on Cybernetics, vol. 47, no. 8, pp. 2121–2131, 2017.
View at: Publisher Site | Google Scholar
M. Meng, L. Liu, and G. Feng, “Adaptive output regulation of heterogeneous multiagent systems under Markovian switching topologies,” IEEE Transactions on Cybernetics, vol. 48, no. 10, pp. 2962–2971, 2018.
View at: Publisher Site | Google Scholar
Y. Tian and Y. P. Tian, “Consentability and protocol design of multi-agent systems with stochastic switching topology,” Automatica, vol. 45, no. 5, pp. 1195–1201, 2009.
View at: Publisher Site | Google Scholar
X. He and M. He, “H ∞ consensus of multi-agent systems with semi-Markovian switching topologies and mode-dependent delays,” International Journal of Systems Science, vol. 52, no. 1, pp. 173–184, 2020.
View at: Publisher Site | Google Scholar
X. Mu and X. Mu, “Output feedback containment control of multi-agent systems with semi-markovian switching topologies and input-bounded leaders,” International Journal of Systems Science, vol. 51, no. 16, pp. 3299–3319, 2020.
View at: Publisher Site | Google Scholar
M. Deng and F. Deng, “Necessary and sufficient conditions for consensus of continuous-time multiagent systems with Markovian switching topologies and communication noises,” IEEE Transactions on Cybernetics, vol. 50, no. 7, pp. 3264–3270, 2020.
View at: Publisher Site | Google Scholar
X. Mao, Stochastic Differential Equations and Applications, Horwood Publishing, Chichester, U.K, Second Edition edition, 2007.
A. Michel, R. Miller, and M. Vidyasagar, Qualitative Analysis of Large Scale Dynamical Systems, Academic, New York, NY, USA, 1980.

Copyright

Copyright © 2022 Kairui Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

239

Downloads

420

Citations