Recent Developments on the Stability and Control of Stochastic SystemsView this Special Issue
Research Article | Open Access
Consensus of Noisy Multiagent Systems with Markovian Switching Topologies and Time-Varying Delays
Stochastic multiagent systems have attracted much attention during the past few decades. This paper concerns the continuous-time consensus of a network of agents under directed switching communication topologies governed by a time-homogeneous Markovian process. The agent dynamics are described by linear time-invariant systems, with random noises as well as time-varying delays. Two types of network-induced delays are considered, namely, delays affecting only the output of the agents’ neighbors and delays affecting both the agents’ own output and the output of their neighbors. We present necessary and sufficient consensus conditions for these two classes of multiagent systems, respectively. The design method of consensus gains allows for decoupling the design problem from the graph properties. Numerical simulations are implemented to test the effectiveness of our obtained results as well as the tightness of necessary/sufficient conditions.
In the past few years, distributed coordination of multiagent systems has been considered by many researchers due to its broad applications in such areas as swarming of animals/robots, cooperative unmanned aerial/underwater vehicles, distributed computation, air traffic control, and distributed sensor networks. One of the important issues in coordinated control is network based consensus protocol design. In this setting, consensus refers to every agent achieving agreement about some common or shared quantity by exchanging information according to a set of rules.
For the purpose of reaching consensus, important interaction details of agents in a system are mostly encoded by the communication graph of the system, which gives a general setting to study consensus and allows for the application of graph-theoretical notations and tools. Distributed computation over networks has been studied in the pioneering work of Tsitsiklis  and Chatterjee and Seneta  in systems and ergodicity theory. More recently, analytical frameworks for solving consensus problems were introduced by Olfati-Saber and Murray  and Jadbabaie et al.  based on graph and matrix theory. Since then numerous consensus protocols have been proposed, mostly for simple single- and double-integrator dynamics (see, e.g., [5–9] and references therein). It is pointed out that  design of consensus protocols for agent dynamics delineated, more generally, by linear time-invariant systems is more challenging due to the possible existence of strictly unstable eigenvalues (poles) in the open-loop matrix. Necessary and sufficient consensus conditions for linear time-invariant systems were explored in [11–14] recently.
In many cases, the communication between agents is subject to stochastic perturbation—the connections change with time due to packet drops, agent failure, and various external disturbances. Therefore, the communication graphs underpinning the physical systems are better characterized by random switching networks. Stochastic consensus with single- and double-integrator dynamics has been well researched [15–21]. For example, asymptotic agreement of continuous-time single-integrator agent dynamics over Poisson random graphs is considered in . The results are further extended in  to solve mean square consensus under directed and weighted independently switching random graphs. When the communication topology is described by a strictly stationary ergodic graph process, a necessary and sufficient condition for almost sure consensus of single-integrator agents is shown to be the connectivity of the mean topology with respect to a stationary distribution of the process . For both discrete-time and continuous-time multiagent systems with single-integrator dynamics and balanced communication graphs, it has been shown in  that the ergodic Markov jump linear system achieves average consensus almost surely if and only if the union of topologies corresponding to the states of the Markov process is strongly connected. Similarly, for second-order discrete systems with (not necessarily ergodic) Markovian switching topologies, the necessary and sufficient condition for mean square consensus becomes that each union of graphs corresponding to the closed sets of positive recurrent states has a spanning tree . Recently, this result is extended to linear time-invariant agent dynamics in  for both discrete- and continuous-time consensus.
It is well documented in the literature  that unmodeled delay effects in a feedback mechanism may destabilize an otherwise stable system. In multiagent systems, time-varying delays may arise naturally due to the asymmetry of interactions, the congestion of the communication channels, and the finite transmission speed. Moreover, noise/uncertainty frequently occurs to agents through, for example, communication errors and spurious measurements in communication systems. Therefore, it would be desirable to understand consensus problems in the setting of Markovian switching topologies with interactions affected by both time-varying delays and random noises.
In this paper, we investigate consensus problems for continuous-time multiagent systems with linear time-invariant agent dynamics under Markovian switching topologies, time-varying delays, and stochastic noises. In particular, we consider two types of communication delays: delays affecting both the state of the agents and that of their neighbors and delays affecting only the state of the agents’ neighbors. A unified framework that considers these delays in continuous-time multiagent systems with fixed topology is first established in . It is worth noting that although other interesting delay-dependent robustness results are reported in, for example, [24–26], the communication topologies considered are either static or switch deterministically.
This work deals with a group of identical agent dynamics, each of which follows a linear time-invariant system with white noises input. The information flow between agents is modeled by a time-homogenous Markov process, whose state space corresponds to all the possible communication patterns (directed graphs). We establish necessary and sufficient conditions to guarantee all agents asymptotically achieve an agreement in the mean square sense and in the almost sure sense for both types of time delays, respectively. When each graph corresponding to a state of the Markov process contains a spanning tree or is -regular for a fixed , we show that the agents can reach consensus for suitable time-varying delays in terms of -matrices if the agent dynamics is stabilizable. Conversely, if the consensus is achieved, the agent dynamics must be stabilizable and each union of graphs corresponding to the closed sets of positive recurrent states of the Markov process contains a spanning tree. The main mathematical techniques used here are based on the stability analysis of Markovian jump linear systems, stochastic differential delay equations, and graph and matrix theory.
The rest of the paper is organized as follows. Section 2 contains the problem formulation. Section 3 presents the main results. A couple of numerical examples are given in Section 4. The conclusion is drawn in Section 5.
Notation. Let and be the -dimensional column vectors of all ones and all zeros, respectively. represents an identity matrix. If the dimension is clear from the context, we sometimes suppress the subscript . The sets of real and complex numbers are denoted by and , respectively. The closed right half plane is signified by . We say () if is positive definite (semidefinite), where and are symmetric matrices of the same dimensions. means the transpose of matrix , while means its conjugate transpose. For a vector , refers to its Euclidean norm; for a matrix , represents its trace norm. Let represent the max norm of a matrix, namely, the maximum of the absolute values of elements. For a matrix , its null space is designated by . By we denote the Kronecker product of matrices and , which admits the following properties: , , and . Denote by the eigenvalues of a matrix . Throughout this paper, we will order them in a nondecreasing order according to their modules: .
2. Problem Formulation and Preliminary Results
2.1. Graph and Consensus Properties
Let represent a directed graph of order , where is the set of nodes (agents) and is the set of directed edges. The ordered pair denotes a directed edge from node to node , indicating that the information can be sent from agent to agent . The weighted adjacency matrix is defined by if and otherwise. Define the in-degree matrix as a diagonal matrix , with being the in-degree of agent . Similarly, the out-degree of agent is defined by . is said to be balanced if for all . Define the graph Laplacian matrix as , which has all row sums equal to zero.
A sequence of edges , with for , is called a directed path from agent to agent . We say that contains a spanning tree if there is an agent (called root) such that every other agent can be connected by a directed path starting from the root. By Lemma of , contains a spanning tree if and only if . Let be a positive integer. The union of graphs is denoted by .
For , let be a differentiable function which will stand for the time-varying communication delay. For , the dynamics of each agent in continuous time takes the following two different forms:(i)with self-delay:(ii) without self-delay:where represents the state of agent at time , are control inputs of agent given byrespectively, , are system matrices, and are independent standard white noises. Here, are common consensus gains to be designed later, and are referred to as the intensity of noise. To highlight the presence of noise, it is natural to define a noise graph with the adjacency matrix satisfying if and otherwise. By definition, if viewing and as unweighted graphs, that is, the adjacency matrices are taken as binary ones, we have . Likewise, the corresponding degree and Laplacian matrices are denoted by with and , respectively.
Remark 1. The above dynamical models characterize system uncertainties with Gaussian white noise appearing as an exogenous input (similar treatment can be found in, e.g., [27–30]). To see this, take and (). System (1), for example, can be recast as The perturbations are represented by a linear combination of gain matrices and to be determined. Moreover, if , we take . (Although other choices are theoretically allowed as per Theorem 8 below, we make them equal in practice since one usually is not able to separate out the noise from the rest of the state.) Thus, the uncertainty reduces to the conventional form . We mention that other commonly studied uncertainties pertaining to the consensus problems include the measurement noises which only affect the received neighbors’ states (e.g., ) and the additive plant noises (e.g., ).
Multiagent system (2) with consensus protocols (5) and (6) considers only propagation delays for information transmitted from agent to agent on the communication network. Propagation delay has been addressed previously, for example, in works [24, 32–35]. Multiagent system (1) with consensus protocols (3) and (4) models both self-delay and neighboring delay. This scheme is relevant for dynamic agents with computation or reaction delays; see, for example, [3, 25, 26, 36, 37]. Although it would be more realistic to explore heterogeneous delays, we consider the uniform delay as a first step, and this simplifies the derivation.
In the current work, we deal with delay robustness in both multiagent systems (1) and (2) over a stochastically time-varying interaction topology as well as its associated noise topology , which is governed by a homogeneous continuous-time Markov process , taking value in the finite set . More precisely, and ; and if and only if . For each , the adjacency, degree, and Laplacian matrices for (, resp.) will be denoted by , , and (, , and , resp.), respectively.
Definition 2. System (1) ((2), resp.) under control protocols (3) and (4) ((5) and (6), resp.) achieves consensus if there exist consensus gains such that, for any and initial distribution of ,for any .
We say matrix in (1) and (2) is Hurwitz (or stable) if every eigenvalue of has strictly negative real part; that is, it belongs to . The pair is called stabilizable if there exists such that is Hurwitz .
Assumption 3. The following assumptions are made throughout the paper: (a)Communication graphs are balanced.(b)Matrix is not Hurwitz.(c)The white noises for all , where means equality in distribution.(d)The Markov process is independent of the Brownian motions .
Item (a) in Assumption 3 is also used in [10, 21]. Item (b) is meant to eliminate the triviality, since consensus can be reached by setting zero consensus gains if is Hurwitz. In this paper, we assume a special sort of noise—possibly due to the homogeneity of the communication channels between each agent and its neighbors—in which is independent of as item (c) indicated. The consensus in Definition 2 is defined in the sense of mean square convergence. This implies that the consensus can also be achieved in the almost sure sense in view of item (d) and the homogeneity of the Markov process (see Corollary of [39, 40]).
2.2. Exponential Stability for Delay Markovian Jump Systems
Denote by the underlying common probability space for the Markov process and Brownian motions discussed above. The homogeneous continuous-time Markov process with generator is formally given by where and . Here is the transition rate from to if , while . As is known, the state space of can be decomposed uniquely into the form , where each is a closed communication class (i.e., closed set in the Markov process) of positive recurrent states and is a set of transient states .
Let for . Consider a stochastic differential delay equation with Markovian switching of the formwhere is an -dimensional standard Brownian motion and and are locally Lipschitz continuous satisfying the following.
Assumption 4. For each , there exist constants and such that, for all , (a);(b);(c).
Define . A square matrix is called a nonsingular -matrix if all the off-diagonal entries are nonpositive and is a nonnegative matrix. A list of equivalent conditions for -matrix can be found in . The following result establishes the exponential stability of system (10).
It is obvious that . Therefore, unbounded time delay is allowed. This is a desirable feature, for example, in delayed cellular neural networks, where delays are variable and in effect unbounded [43–46].
Remark 6. The existence of solutions to dynamical systems (1) and (2), in an even more general nonlinear setting, has been studied in . Let . For , let be a continuous function. Denote by the family of continuous functions from to . It is shown that  for any bounded and -measurable initial condition system (1) (as well as (2)) has a unique continuous solution on . Our strategy in the sequel is to first transfer the systems to error dynamics (see (13) and (26) below) and then address the stability of zero solution utilizing Lemma 5.
The objective of this paper is to reveal how stability analysis of differential delay equations, together with techniques used in matrix, Markov chain, and graph theory, can be applied to investigate stochastic consensus problems (1) and (2).
3. Main Results
3.1. Consensus Conditions for Systems with Self-Delay
Let and signify the Laplacian matrices for the switching topologies and at time . For , define the disagreement error for agent as , where is the average state vector. Rearranging (1) with (3) and (4) giveswhere we have used Assumption 3(a). Set and . Moreover, let be an block diagonal matrix. Consequently, (12) can be recast as
Theorem 7 (necessary conditions). Suppose that Assumption 3 holds and system (1) with protocols (3) and (4) achieves consensus. Furthermore, assume that there exist for , and such that , , and . Then (a)each union of the graphs corresponding to all the states in the closed set for has a spanning tree;(b) is stabilizable.
Proof. To prove (a), let be the union graph corresponding to the closed set . Without loss of generality, assume that does not contain a spanning tree. Denote by its Laplacian matrix. By Assumption 3(a), is also a Laplacian matrix. It follows from Corollary of  that there is a unit vector such that and . Using Lemma of , we obtain Hence, for any . There exists some such that is an orthogonal matrix.
Define . By partitioning in line with , that is, with each , we get and by definition. Moreover, by using (13) we have for If the initial value , then and . Using the assumption , we derive for .
If , take . Thus, under Assumption 3(b). This contradicts with the consensus definition.
If , we obtain and recall . Since , there exist two components and satisfying . Take , , and for all . It yields that . Again, it results in a contradiction.
To prove (b), assume that is not stabilizable. Then has an unstable and uncontrollable mode, denoted by . It follows from the Popov-Belevitch-Hautus controllability test  that there exists some complex vector satisfying and .
Let . By means of (13) and the assumptions that and , we derive Taking , we see that since is unstable. This contradicts with the consensus definition.
Note that the assumption is only used in the proof of statement (a), while the assumptions and are only used in the proof of statement (b).
If is stabilizable, there exists an matrix such thatby the Riccati inequality . Similarly, if is stabilizable, there exists an matrix such that
Theorem 8 (sufficient conditions). Suppose that Assumption 3 holds, both and are stabilizable, and contains a spanning tree for every . If is a nonsingular -matrix and is a positive vector, then system (1) with protocols (3) and (4) achieves consensus for satisfying where , , and and are given by (18) and (19), respectively.
Moreover, feasible consensus gains and are given by with and with , respectively.
Proof. The idea is to apply Lemma 5 to the error dynamics (13). It suffices to check Assumption 4 holds.
For item (a), for all clearly. To check item (b), we take a unitary matrix for each : , where satisfies for . Given , by setting (and partitioning it in conformity with that of as in Theorem 7), we derive thatwhere we have taken with and used inequality (18). Note that is well defined, since contains a spanning tree, and thus there is only one zero eigenvalue of .
Since , using (21) we obtainHence, we take independent of .
To verify item (c), note thatTherefore, similarly as in the proof of (21) and (22) we obtain where we have taken with . Since the fact that contains a spanning tree implies that also contains a spanning tree, is well defined with the same reason as above. Hence, we take and for all .
Remark 9. (a) The design of consensus gains and splits the design problem from the underlying communication topology. For example, is constructed based on the system matrices (18) and a multiplicative coefficient depending only on the graphs. Such a design procedure decouples the effects of agent dynamics and the network topologies, which simplifies the consensus design for the cases where the number of agents is large (see also [10, 13]).
(b) When , , and , we reproduce single-integrator agent dynamics, and (18) and (19) always hold true. This can be viewed as a generalization of results in  by introducing random noise and time delay.
(c) The assumption in Theorem 8 about being a nonsingular -matrix and having positive entries is easy to verify. Indeed, all the off-diagonal entries are nonpositive by the definition of generator . Thus, it suffices to show that is nonnegative (this always holds if ) and ensure that every row sum of it is less than .
(d) There is a gap pertaining to graph connectivity between sufficient conditions (Theorem 8) and necessary conditions (Theorem 7). Comparing with the previous work  for noise-free and delay-free systems, we understand that the stronger connectivity requirement—each graph contains a spanning tree—is introduced to accommodate the added noises and time-varying delays. Notice that the results are based on Lemma 5, which is about nonlinear systems. This also suggests the conditions derived here could be conservative. Notwithstanding, the study of weaker sufficient condition (e.g., using some algebraic methods) comparable to that of the necessary condition is an interesting future research.
3.2. Consensus Conditions for Systems without Self-Delay
Similarly as above, for , define the disagreement error for agent as , and is the average state vector. Under Assumption 3(a), (2) together with (5) and (6) yieldsLet , , and . We rewrite (25) in a compact form as
Theorem 10 (necessary conditions). Suppose that Assumption 3 holds and system (2) with protocols (5) and (6) achieves consensus for some constant delay . Furthermore, assume that there exist for , and such that , , and . Then (a)each union of the graphs corresponding to all the states in the closed set for has a spanning tree;(b) is stabilizable.
As is noted below Theorem 7, the assumption is only used in the proof of statement (a), while the assumptions and are only used in the proof of statement (b).
Recall that if is stabilizable, there exists a such that is Hurwitz. Therefore, by the Lyapunov stability theorem, there exists an matrix such thatDefine a symmetric matrix by
Theorem 11 (sufficient conditions). Suppose that Assumption 3 holds, both and are stabilizable, and is -regular () for any . If is a nonsingular -matrix and is a positive vector, then system (2) with protocols (5) and (6) achieves consensus for satisfying where , , , , and . Here, , , and are given by (28), (19), and (29), respectively.
Moreover, feasible consensus gains and are given by and with , respectively. Here, for .
Proof. As in the proof of Theorem 8, we will apply Lemma 5 to the error dynamics (26).
To check item (a) in Assumption 4, we note thatwhere we have used the assumption that is -regular and the Rayleigh quotient inequality. Taking in (31) and utilizing (28) and (29), we getTherefore, we take for all .
For item (b), again by applying the Rayleigh quotient inequality we derive Therefore, we take for .
To show (c), we recall the simple norm inequality . It suffices to find suitable and so that the following two inequalities hold for :Since is stabilizable, we get such that (19) holds. Hence,where we have taken with . Here are defined as in the statement of Theorem 11. Since , we have for all and . Therefore, is well defined.
Note thatUsing (36) we obtainTherefore, (34) holds by taking for any .
Similarly, (35) is true with by using the Rayleigh quotient inequality.
Remark 12. (a) Similar comments in Remark 9 can be applied here. In addition, we note that the requirement in Theorem 11— are -regular graphs for all —is somewhat restrictive. If this condition is violated, we might use Weyl’s inequality (see, e.g., ) to bound the maximum eigenvalue in (31), which nonetheless will lead to a more cumbersome expression.
(b) Interestingly, sufficient conditions in Theorem 11 do not explicitly mention connectivity assumptions, whereas necessary conditions in Theorem 10 clearly state certain connectivity assumption. To see how some connectivity is implicitly required in Theorem 11, we consider a special case with , , and being not connected and having two connected components, out of which one is a complete graph with nodes. We can show that matrix in Theorem 11 is not a nonsingular -matrix, violating the assumption of Theorem 11. Indeed, it is straightforward to check that , , and with . Setting with , we obtain the matrix . being a nonsingular -matrix is equivalent to the fact that all its leading principal minors are positive , which in turn yields . However, this inequality does not hold for any when .
4. Simulation Examples
In this section, we present several examples to illustrate the availability of the proposed results. We consider all the adjacency matrices as binary 0-1 matrices in the following.
Example 1 (system with self-delay). Consider multiagent system (1) with agents. The communication topologies will randomly switch amongst the triad , , and of Figure 1 following a homogeneous Markovian process with generatorand state space . Note that each of these three graphs is balanced and contains a spanning tree. For , we choose . Take , and let the agent dynamics be specified as and . Since and are Hurwitz by choosing and , both pairs and are stabilizable. Since Riccati inequalities (18) and (19) can be written as linear matrix inequalities (LMIs) (see, e.g., ), we obtain by using LMI Toolbox in MATLAB. We calculatewhich is a nonnegative matrix. In view of Theorem 8, we solve the consensus gains as .
According to Theorem 8, multiagent system (1) with protocols (3) and (4) achieves consensus for satisfying With the initial state of each agent being taken randomly from , we show in Figures 2(a)–2(c) a sample path of the consensus errors by choosing . Clearly, (42) is satisfied, and consensus is achieved. In Figure 2(d), we show only the third component of with . This delay violates condition (42), and consensus is not achieved.
Example 2 (system without self-delay). Consider multiagent system (2) with agents. The communication topologies switch amongst , , and of Figure 3 following the same Markovian process as defined in Example 1. Note that each of these three graphs is balanced and -regular with . and contain spanning trees but does not. The adjacency matrices and the agent dynamics are taken as in Example 1. Solving Lyapunov equation (28) by using LYAP function in MATLAB, we obtainand as in Example 1. It follows from (29) that We calculate , , and a nonnegative matrixFrom Theorem 11, we solve the consensus gains as .
In light of Theorem 11, multiagent system (2) with protocols (5) and (6) achieves consensus for satisfyingWith the initial state of each agent being taken randomly from , we show in Figures 4(a)–4(c) a sample path of the consensus errors by choosing . Since (46) is satisfied, consensus is achieved. We plot in Figure 4(d) only the third component of with . Condition (46) does not hold, and consensus is not achieved.
Example 3 (tightness of bounds). In this example, we consider multiagent system (1) with agents. The communication topologies will randomly switch amongst 10 random graphs in the classical Erdős-Rényi model with being the connection probability between any two nodes . The generator of the underlying Markovian process with is taken as . The adjacency matrices and the agent dynamics are taken as in Example 1. Moreover, we fix .
The program stops if all components of are less than ; if the program does not stop before , we regard that the consensus is not achieved. For each given , we collect 500 samples (1 sample consists of 10 graphs) to check whether the system finally achieves consensus. The fraction of samples that reach consensus is shown in Figure 5 as a function of . The curve displays a sigmoidal variation with respect to , saturating at 1 when is just over . It is well known that  the random graphs are not connected with high probability if (here, about ) in the large limit. Figure 5 reveals that consensus can still be achieved with a much smaller than the connectivity threshold indicating that the sufficient condition regarding connectivity in Theorem 8 can be weakened.
This paper has studied the continuous-time consensus problem of linear multiagent systems under Markovian switching interaction topologies, random noises, and time-varying delays. The agent dynamics are described by linear time-invariant systems, in which two types of network-induced delays are considered, namely, delays affecting only the output of the agents’ neighbors and delays affecting both the agents’ own output and the output of their neighbors. Necessary and sufficient consensus conditions have been derived, respectively, for these two classes of multiagent systems. The design of consensus gains has a computationally advantageous decoupling feature. Numerical examples are given to demonstrate the effectiveness of the proposed methods. Although there is a gap between necessary and sufficient conditions, the necessary one seems to be tighter in view of the simulations. Future research worth investigation could be the heterogeneous time delays, general uncertainties, and systems with different dynamics (see, e.g., ).
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
The author would like to thank Professor Quanxin Zhu for useful suggestions. The author is also grateful to the four anonymous reviewers and the editor for valuable comments that have improved the paper. This work was funded in part by the Program for Young Excellent Talents in Tongji University (2014KJ036) and by Shanghai Pujiang Program (15PJ1408300).
- J. N. Tsitsiklis, Problems in decentralized decision making and computation [Ph.D. thesis], Massachusetts Institute of Technology, Cambridge, Mass, USA, 1984.
- S. Chatterjee and E. Seneta, “Towards consensus: some convergence theorems on repeated averaging,” Journal of Applied Probability, vol. 14, no. 1, pp. 89–97, 1977.
- R. Olfati-Saber and R. M. 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.