Second-Order Consensus for Multiagent Systems under Directed and Switching Topologies

We consider multiagent consensus problems in a decentralized fashion. The interconnection topology among the agents is switching and directed. The agent dynamics is expressed in the form of a double-integrator model. Two different cases are considered: one is the leaderfollowing case and the other is the leaderless case. Based on graph theory and the common Lyapunov function method, some sufficient conditions are established for the consensus stability of the considered systems with the neighbor-based feedback laws in both leader-following case and leaderless case, respectively. As special cases, the consensus conditions for balanced and undirected interconnection topology cases can be established directly. Finally, two numerical examples are given to illustrate the obtained results.


Introduction
In recent years, the coordination problem of multiple autonomous agents has drawn an increasing attention.It is because there are many applications of multiagent systems in many areas including cooperative control of unmanned air vehicles, flocking of birds, schooling for underwater vehicles, distributed sensor networks, attitude alignment for cluster of satellites, collective motion of particles, and distributed computations 1-5 .
Although these practical backgrounds are different, the fundamental principles in the coordination of multiple spacecraft, robots, and even animals are very similar, that is, coordinating multiple agents to achieve a goal of the whole system by local information.As a result, a critical problem for coordinated control is to design appropriate protocols and algorithms such that the group of agents can reach consensus on the shared information in the presence of limited and unreliable information exchange and dynamically changing interaction topologies 6 .In 5 , the author also pointed out that a key technology in cooperative control is the problem of consensus.The investigated feedback scheme associated Mathematical Problems in Engineering with those problems is inspired by the aggregates of individuals in nature.Reynolds first proposed a computer animation model to simulate collective behaviors of multiple agents in 2 .In the fields of system and control, the development of consensus theory is primarily impelled by Vicsek's particle swarm model mentioned in 3 .In 1 , Jadbabaie et al. gave a theoretical explanation of the consensus behavior of Vicsek's model and proved that the states of all the jointly connected agents converged to the same value or the value of a given leader.Ren and Beard 6 extended the work of Jadbabaie et al. 1 to the case of directed graphs and explored the minimum requirements to reach global consensus.Olfati-Saber and Murray studied the average-consensus problem with strongly connected and balanced directed topologies in 7 , which is essentially the same problem as in 1, 6 for continuoustime consensus scheme.Similar or generalized consensus problems have also been studied in 8-12 .There are also many interesting results about the similar topic for stochastic complex networks 13-15 .In real applications, the interacting topology between agents may change dynamically since the communication links between agents may be unreliable due to disturbances and/or subject to communication time delay.It is well known that switching of the communication topology and communication time delays may lower the system performance and even cause the network system to diverge or oscillate.Theoretically, the consensus in undirected switching topology is much easier than that of directed switching topology.Recently, some preliminary results have been reported to deal with the directed switching topology 16, 17 .Furthermore, with many practical applications, especially involving mechanical systems, the dynamics of agents is usually modeled as a double integrator ẍ u.There are many interesting agent-related works, such as in 18-20 , involving double-integrator dynamics under switching and undirected interconnection topology among the agents.Most existing results are obtained under undirected interconnection topology.In directed topology case, 21 discussed this topic under the simple fixed topology.In 9 , the authors pointed out that the system matrix related to this multiagent system with double-integrator dynamics does not satisfy the properties related to stochastic matrix and the norm-based method proposed by 1 may fail for the double-integrator form agent dynamic.Therefore, the Lyapunov-based approach is often chosen to solve consensus problem of multi-agent systems with double integrator model.Motivated by the above works, we study a group of agents with the double-integrator dynamics.The main purpose of this paper is to develop a decentralized control strategy to reach the global consensus of the multi-agent systems under directed switching interconnection topology among the agents.Two different cases are considered: one is the leader-following case and the other is the leaderless case.First, we establish a sufficient consensus condition by constructing a parameter-dependent common Lyapunov function in leader-following formulation.The established consensus condition is expressed as a reducedorder Lyapunov matrix inequalities.As commonly known, it is not an easy task to construct a common Lyapunov function for a switching system, let alone the parameter-dependent common Lyapunov function.As for the leaderless case, the common Lyapunov method cannot be used directly.By using the Schur orthogonal transformation, we decomposes the group tracking dynamics into two subsystems: one represses the leader and the other represses a leader-following subsystem.Then, a sufficient condition is established by applying the obtained leader-following consensus condition to leader-following subsystem.As special cases, we can obtain consensus conditions directly for the multi-agent system with undirected and balanced switching interconnection topology.The jointly connected convergence condition can guarantee that the multi-agent with linear dynamical model achieves consensus.But for double-integrator model, we construct a counterexample to show that the jointly connected condition may not guarantee that the multi-agent system achieves consensus, which implies that the proposed globally reachable convergence condition may be moderatable and acceptable.By using similar analysis method, we also can probe consensus problems of 9, 18, 19 with switching and directed interconnection topology.Finally, the numerical examples also show that the established consensus condition is solvable.
The rest of the paper is organized as follows.In Section 2, we give a formulation of the coordination problem with help of graph theory.Then in Section 3, some results on the consensus stability are obtained for the multi-agent system with fixed and varying interconnection topologies in the leader-following case, while in Section 4, the leaderless case is studied.In Section 5, two simulation examples are presented to illustrate our theoretical results.Finally, concluding remarks with discussions of the future work are given in Section 6.
The notation of this paper is standard.R is the real number set.I is an identity matrix with compatible dimension.A T denotes as transpose of a matrix A. For symmetric matrices A and B, A > ≥ B means A − B is positive semi-definite.λ A represents an eigenvalue of A. For symmetric matrices A, λ min A and λ max A represent the minimum and maximum eigenvalue of A, respectively.• denotes the Euclidean norm.⊗ denotes the Kronecker product, which satisfies 1

Problem Formulation
Stability analysis of the group of agents is based on several results of algebraic graph theory.In this section, we first introduce some basic concepts and notations in graph theory that will be used throughout this paper.More details are available in 22 .
We n by G {V, ε, A} with an index set I {1, 2, . . ., n}, where V {v 1 , v 2 , . . ., v n } is the set of vertices, ε ⊂ V × V is the set of edges of the digraph, and each edge is denoted by v i , v j ∈ ε, i, j ∈ I, and a weighted adjacency matrix A a ij has nonnegative adjacency elements a ij .Throughout this paper, we assume that all the graphs have no edges from a node to itself.A weighted graph is called undirected if for all v i , v j ∈ ε ⇒ v j , v i ∈ ε and a ij a ji .Otherwise, the graph is called a directed graph or digraph.The adjacency elements associated with the edges of the graph are positive, that is a ij > 0 ⇔ v i , v j ∈ ε.Obviously, we also have a ij 0 ⇔ v i , v j / ∈ ε.A path from vertex v i to vertex v j is a sequence of distinct vertices starting with v i and ending with v j such that consecutive pair of vertices make an edge of digraph.If there is a path from one node v i to another node v j , then v j is said to be reachable from v i .If a node v i is reachable from every other node of the digraph, then it is said to be globally reachable.Obviously, every node of an undirected connected graph is globally reachable.
The relationships between n agents can be conveniently described by a simple digraph G.We denote the set of all neighbor vertices of vertex v i by N i {j | v i , v j ∈ ε}.Neighboring relations reflect physical proximity between two agents, or the existence of a communication channel 6 .Its degree matrix D diag{d 1 , . . ., d n } ∈ R n×n is a diagonal matrix, where diagonal elements d i j∈N i a ij for i 1, . . ., n.Then the Laplacian matrix of G is defined as 2.1 The following lemma relates the Laplacian matrix with its directed graph, as well as supplying an algebraic characterization.It is well known that the Laplacian matrix captures many interesting properties of the graphs.The result of Lemma 2.1 can be found in 6 .
Lemma 2.1.The weighted graph Laplacian matrix L associated with graph G has at least one zero eigenvalue, and all of the nonzero eigenvalues are located on the open right half plane.Furthermore, L has exactly one zero eigenvalue if and only if the directed graph G has a globally reachable node.
Moreover, for a digraph with a globally reachable node, the n-dimensional eigenvector associated with the single zero eigenvalue is the vector of ones, 1 : 1, 1, . . ., 1 T .For undirected weight graph G, L is symmetric, positive and semidefinite, and all eigenvalues of L are real and nonnegative.
A weighted graph G V, ε, A is said to be balanced if Any undirected weighted graph is balanced.Furthermore, a weighted graph is balanced if and only if 1 T L 0 see 7 .
Let ε be the set of reverse edges of G obtained by reversing the order of all the pairs in ε.The mirror of G is denoted by an undirected graph in the form G V, ε, A with the same set of nodes of G, the set of edges ε ε ∪ ε, and the symmetric adjacency matrix A a ij with elements a ij a ij a ji /2.The Laplacian matrix for mirror graph In what follows, we mainly consider a graph G associated with the system with n agents labeled by v i , i 1, 2, . . ., n and one leader labeled by v 0 .A simple and directed graph G describing the topology relation of these n followers, and G contains graph G and v 0 with the directed edges from some agents to the leader describes the topology relation among all agents.In other words, we denote a weighted digraph of order n 1 by G {V, ε, A}, where V {v 0 , v 1 , . . ., v n }, and the weighted matrix has the following form: The element a ij > 0 represents that agent i is connected to agent j, and b i > 0 represents that agent i is connected to leader.Meanwhile, a ij 0 and b i 0 represents that agent i is not connected to agent j and leader, respectively.The induced subgraph G {V, ε, A} of G represses the interconnection topology among n following agents.
For the multi-agent system under consideration, the relationships between neighbors can change over time and the interconnection topology may be dynamically changing.Let t 1 0, t 2 , t 3 , . . .be an infinite time sequence at which the interconnection graph of the considered multi-agent system switches.Usually, it is assumed that chattering does not occur; that is, there is a constant τ 0 > 0, often called dwell time, with t i 1 − t i ≥ τ 0 , for all i.Moreover, we assume that only finite possible interconnection topologies can be switched.In the leaderless case, denote S {G 1 , G 2 , . . ., G N } as a set of the graphs of all possible topologies, while in the leader-following case, denote S {G 1 , G 2 , . . ., G N 0 } as a set of the graphs of all possible topologies.Denote P {1, 2, . . ., N} and P 0 {1, 2, . . ., N 0 } as index sets, respectively.In this paper, we intend to coordinate n mobile agents with each agent expressed in the form of a double integrator: where r i ∈ R m is the position of agent i, p i ∈ R m its velocity and u i ∈ R m its control inputs.In the leader-following case, the dynamics of the leader is taken as where r 0 ∈ R m and p 0 ∈ R m are the position and velocity vectors of the leader, respectively, and a 0 t ∈ R m is a known input, which may be regarded as some given policy known to all the agents.Particularly, a 0 t ≡ 0 expresses that the leader moves in constant velocity.
The n mobile agents are said to achieve global consensus if for any given initial values r i 0 and p i 0 i 1, 2, . . ., n , lim t → ∞ r i t − r j t 0 and lim t → ∞ p i t − p j t 0 for any i, j 1, 2, . . ., n.Thus, in the leader-following case, the multi-agent system achieves global consensus if and only if lim t → ∞ r i t − r 0 t 0 and lim t → ∞ p i t − p 0 t 0 for any initial values.
The control law is said to beneighbor control law or local control law if all the control inputs u i only depend on the states of agent i and its neighbors.We are interested in using neighbor control law to solve the consensus problem.To this end, the controller u i of agent i, regarded as node i in a graph, requires state information from a subset of the agent's flockmates, called the neighbor set N i and defined as above.There are two cases considered for multi-agent system as follows.

Leader-Following Case
For any i ∈ I, take the local control law, which is neighbor-based feedback law as follows: where κ is considered as a "control" parameter, which is positive constant and will be determined later, and γ is a positive weighted parameter.The set of switching interconnection topology graph is assumed to be G l {V, ε l , A l }, l ∈ P 0 , where the A l has the following form:

Mathematical Problems in Engineering
In time t, the interconnection topology graph is assumed to be switched to G l , l ∈ P 0 , so a ij t and b i t are chosen by a ij t a l ij and b i t b l i .Denote s j r j − r 0 and q j p j − p 0 .Take s : s T 1 , . . ., s T n T ∈ R mn , q : q T 1 , . . ., q T n T ∈ R mn , and u : Then error dynamics of closed system 2.4 -2.6 can be rewritten as ṡ q, where H σ L σ B σ , σ : 0, ∞ → P 0 {1, 2, . . ., N 0 } is a piecewise constant switching signal with successive times when the topology of graph G switches.L σ is the Laplacian matrix of the switching graph G consisting of n vertices presenting agents 1, . . ., n , and B σ is a diagonal matrix whose i diagonal entry is b i t at time t.

Leaderless Case
Because there is no leader dynamics 2.5 , take the local control law for any i ∈ I as follows: 2.9 Let r : r T 1 , . . ., r T n T and p : p T 1 , . . ., p T n T .Then we can rewrite the closed-loop system 2.4 and 2.9 as ṙ p, where σ : 0, ∞ → P {1, 2, . . ., N} is a piecewise constant switching signal to describe the switch of the interconnection graph G.The a ij t is chosen by a ij t a l ij , l ∈ P. The next lemma shows well-known results and will be used later, which is given in 23 .

Lemma 2.2. Suppose that a symmetric matrix is partitioned as
where C 1 and C 3 are square.This matrix is positive definite if and only if C 1 is positive definite and In what follows, we first focus on the analysis of the leader-following case and then study the leaderless case in a similar trace.
Mathematical Problems in Engineering 7

Leader-Following Case
In this section, we concentrate on the analysis of the multi-agent systems with a leader.If the information of the input a 0 t can be used in local control design, then we can prove that although the leader keeps changing, the agents can follow the leader that is, consensus is achieved.
Using neighbor-based feedback law 2.6 , the error dynamics system 2.8 will be expressed in a compact form as follows: where The interconnection topology graph is G σ t , and the interconnection graphs associated with all followers are G σ t .
Note that F σ is not directly related to a stochastic matrix, and therefore, the method reported in 1 cannot be applied directly.In what follows, we will propose an approach based on common Lyapunov function for the system 3.1 to demonstrate the convergence of the dynamics system 3.1 .Now we give the main result in the leader-following case as follows.
Theorem 3.1.Suppose that the interconnection graph is connected for any interval t j , t j 1 .If there exist a positive definite matrix P 1 and a positive constant μ such that and taking a constant then the local control law 2.6 can guarantee that multi-agent system 2.4 , 2.5 achieves consensus for any given initial condition r 0 and p 0 .
Proof.To prove the theorem, we consider the dynamics in each interval at first.Note that, in any interval say t j , t j 1 , the interconnection topology does not change.Therefore, F σ t is a constant matrix for t ∈ t j , t j 1 for any j ≥ 0, and then the solution to 3.1 is well defined.Thus, we can assume that σ t l, l ∈ P 0 , t ∈ t j , t j 1 .Choose matrix P 1 as We can verify that P 1 is positive definite by applying Lemma 2.2.Consider a common Lyapunov function V x x T P 1 ⊗ I m x, where P 1 is defined in 3.5 .Then, for any l ∈ P 0 which corresponds to interval t j , t j 1 , we have where Note that Then we have 3.9 By using Lemma 2.2, 3.4 guarantees that matrix Q is positive definite.
In addition, the maximum eigenvalue of P 1 is

3.11
Thus we have lim t → ∞ x t 0 with at least an exponent rate β.The proof is now completed.
Remark 3.2.Obviously, the consensus problem of closed-loop multi-agent system 2.4 , 2.5 and 2.6 is equivalent to stability problem of error system 3.1 .The closed-loop multiagent system and the error system are both 2n-order systems, and the consensus condition 3.3 given in Theorem 3.1 is n-order Lyapunov matrix inequalities.Thus, the established consensus condition is a reduced order condition.In many applications, the system normally switches in finite model.The assumption that the system switches only in finite model is often used.Because the interconnection topology is modeled by weighted digraph, different weight will lead different interconnection topology.Although the set of nodes and the set of possible edges are finite, the set of possible interconnection topology may be infinite, but from the point of mathematics, the assumption that the index set P is finite in Theorem 3.1 may be not necessary.From the proof of Theorem 3.1, we can also obtain the result of Theorem 3.1 by the assumption that condition 3.3 is satisfied for any element of an infinite index set P.
Note that the matrix H L B plays a key role in the convergence analysis of system 3.1 .A matrix is said to be a positive stable matrix if all its eigenvalues have positive real parts.The matrix H L B is positive stable if and only if node v 0 is globally reachable in G see 18 .
Of course, the result of Theorem 3.1 can be applied to fixed topology case directly.Because H is positive stable, there exists a positive definite matrix P 2 ∈ R n×n such that H T P 2 P 2 H I.

3.12
Therefore, we can obtain the following corollary for fixed topology case.then the local control law 2.6 can guarantee that system 2.4 , 2.5 achieves consensus for any given initial condition r 0 and p 0 .
Moreover, let λ i H α i jβ i i 1, 2, . . ., n be ith eigenvalue of H.A necessary and sufficient condition for fixed topology case obtained by 21 is given as follows.The local control law 2.6 can guarantee that the multi-agent system in leader-following case achieves consensus for any given initial condition r 0 and p 0 if and only if node v 0 is globally reachable in G and the constants κ and γ satisfy

3.14
The assumption that node v 0 is globally reachable in G can guarantee that α i > 0. For any given γ > 0, α i > 0, and β i , it is not difficult to see 3.14 can be satisfied for larger enough κ.Obviously, 3.14 always holds for any γ > 0, κ > 0 if all β i 0. When the interconnection graphs G associated with all followers are undirected and node v 0 is globally reachable in G, all eigenvalues of H are real and positive see 9 .Thus, in this fixed undirected case, multiagent system 2.4 -2.6 achieves consensus for any given initial condition r 0 and p 0 if and only if node v 0 is globally reachable in G.
Consider the special case that the graph G σ associated with all followers is balanced.The matrix L σ L T σ is positive semidefinite.Moreover, we have see 18 .
Lemma 3.4.Suppose G l is balanced.Then H T l H l is positive definite if and only if node v 0 is globally reachable in G l .
Based on Lemma 3.4 and the fact that the set P 0 is finite, define which is fixed and depends directly on the constants a l ij and β l i for i, j 1, . . ., n and l 1, 2, . . ., N. Obviously, if all the interconnection graphs G σ associated with followers are undirected and node v 0 is globally reachable in G σ , λ 1 can be expressed as λ 1 min p∈P 0 {λ min H l }.Now we propose following the corollary for the balanced graph case.Corollary 3.5.In any interval t j , t j 1 , suppose that node v 0 is globally reachable in the interconnection graph G l , and G l associated with all followers is balanced.Taking a constant κ > 1 then multi-agent system 2.4 -2.6 achieves consensus for any given initial condition r 0 and p 0 .
Proof.According to Lemma 3.4 and the definition of λ 1 , we have 3.17 Then we can obtain the corollary directly by using the result of Theorem 3.1.
Because the interconnection graph considered in this paper is weighted graph, two graphs with same edge set and different weighted adjacency matrices are different interconnection graphs.Although the node set and edge are finite, the set of possible interconnection graph may be infinite.For the case that all the graphs G l , l ∈ P 0 are associated with all followers are balanced and the switching index set P 0 is infinite, we also can prove that multi-agent system achieves consensus by only assumption that there exists a positive constant a min such that all nonzero weighted factors a l ij , b l i are equal or greater than a min .To probe the consensus stability condition in this case, let Γ 0 {G p , p ∈ P 0 } denote the class of all possible interconnection graphs with the following properties: 1 v 0 is globally reachable node; 2 the interconnection graph G p related to all followers is balanced; 3 all constant weighted factors a ij , b i are equal or greater than a positive constant a min .P 0 is index set of Γ 0 , which is infinite set.Let Γ 0 denote the class of all possible nonweighted interconnection graphs with the properties: 1 v 0 is globally reachable node; 2 the interconnection graph G related to all followers is undirected; 3 all nonzero weights are 1.
For any graph G ∈ Γ 0 , we construct a related graph G by replacing all directed edges between all follower agents with undirected edges and all nonzero weights with 1.Because v 0 is globally reachable node in the interconnection graph G, v 0 is also globally reachable node in G. Thus, we have G ∈ Γ 0 .Moreover, H G B G L G is symmetric and positive definite by Lemma 3.4.Because of the finiteness of node set and edge set, Γ 0 is a finite set.Define which is fixed, and λ 1 > 0.
On the other hand, consider a weighted graph G with same node set and edge set as G l .In addition, its weight of edge i, j is taken as a ij a ji /2 − a min ≥ 0 and weight of edge 0, i is taken as 2b i − a min ≥ 0. It is not difficult to see that

3.19
Noticing that H G is symmetric and positive semidefinite matrix, we have Similarly, we can get the following result.
Corollary 3.6.Suppose that the interconnection graph G σ t of any interval t j , t j 1 belongs in Γ 0 .Take a constant κ > 2 a min γ 2 λ 1 .

3.21
Then the local control law 2.6 can guarantee that the multi-agent system in leader-following case achieves consensus for any given initial condition r 0 and p 0 .

Leaderless Case
In this section, similar to the analysis given in the last section, we probe the consensus problem for leaderless case.The involved interconnection graph is G instead of G.The closedloop system 2.10 will be expressed in a compact form as follows: Noticing that vector 1 is the eigenvector of the Laplacian matrix L σ corresponding to its zero eigenvalue by Lemma 2.1, we choose an orthogonal matrix with form where * denotes the other entries in this matrix.We have where Taking s U T r and q U T p, system 4.1 is equivalent to be described by For convenience, set Mathematical Problems in Engineering 13 ψ 0 q 1 , ψ 1 q T 2 , q T 3 , . . ., q T n T .

4.6
Then the whole system decomposes into two subsystems as follows: one is and the other one is

4.8
Notice that all eigenvalues of the matrix L σ are eigenvalues of L σ from 4.4 , which means all of the nonzero eigenvalues of L σ are located on the open right half plane by Lemma 2.1.If the graph has a globally reachable node, the rank of L σ is n − 1, and therefore all the eigenvalues of matrix L σ are located on the open right half plane, which implies matrix L σ is positive stable matrix.Now we give the main result in leaderless case as follows.
Theorem 4.1.Suppose that the interconnection graph has a globally reachable node for any interval t j , t j 1 .If there exist a matrix U 1 ∈ R n× n−1 , a positive definite P 3 ∈ R n−1 × n−1 , and a positive constant μ such that and taking a constant then the local control law 2.9 can guarantee that the multi-agent system in leaderless case achieves consensus for any given initial condition r 0 and p 0 .
, it is easy to know that U is an orthogonal matrix and satisfies 4.4 .Because the interconnection graph G l has a globally Mathematical Problems in Engineering reachable node, L l U T 1 L l U 1 is positive stable matrix.Applying the result of Theorem 3.1 to system 4.7 , we have lim Noticing that U T 1 √ n, 0, . . ., 0 T , we have 12 which imply lim t → ∞ r i t − r j t 0 and lim t → ∞ p i t − p j t 0 for any i, j 1, 2, . . ., n.This completes the proof.
Similarly, consider the special case that all the interconnection graphs G σ are balanced.Due to 1 T L σ L σ 1 0 for balanced graph G σ , we have where U is orthogonal matrix having form 4. Proof.1/2 L T σ L σ is the Laplacian matrix of the mirror graph of G σ .Because G σ is balanced and has a globally reachable node, the mirror graph is undirected and connected.Therefor, 1/2 L T σ L σ is positive semidefinite and its rank is n − 1.From 4.13 , we have L T σ L σ is positive definite.
Based on Lemma 4.2 and the fact that the set P is finite, define L l | G l is balanced and has a globally reachable node > 0.
4.14 λ 2 is also well defined.From 4.13 , λ 2 is equivalent to be expressed as then the local control law 2.9 can guarantee the multi-agent system in leaderless case achieves consensus for any given initial condition r 0 and p 0 .
Similarly, denote by Γ {G p , p ∈ P} the class of all possible interconnection graphs with the following properties: 1 the interconnection graph G p is balanced and has a globally reachable node; 2 all constant weighted factors a ij are equal or greater than a positive constant a min .P is index set of Γ, which is infinite set.Let Γ denote the class of all possible nonweighted interconnection graphs with the properties that the graph is balanced and connected.Thus Γ is a finite set.Define which is fixed, and λ 2 > 0. By applying similar analysis of leader-following case, we propose the following result directly.
Corollary 4.4.Suppose that any interconnection graph G σ t associated with interval t j , t j 1 belongs in Γ.Take a constant κ > 2 a min γ 2 λ 2 .

4.18
Then the local control law 2.6 can guarantee that the multi-agent system in leader-following case achieves consensus for any given initial condition r 0 and p 0 .
Remark 4.5.We define the center of the multi-agent system as r 1/n n i 1 r i .The velocity of the center is expressed as p 1/n n i 1 p i .If all the interconnection graphs G σ associated with any time interval are balanced, the dynamics of center is given by ṙ 1

4.19
Then, we can get that

4.20
The center r of the closed-loop system 2.10 will move at a constant speed 1/n n i 1 p i 0 , which is the average initial velocity of all agents.The position and velocity of every agent will tend to the position and velocity of center, respectively, which means that the multi-agent network achieves consensus.Remark 4.6.If the dynamics of the agent is linear, that is, ṙ u i , and the interconnection graph is jointly connected, as pointed out in the local control law can guarantee the multiagent system achieves consensus 1, 8 .But for double-integrator model, the jointly connected condition may not guarantee that the multi-agent system achieves consensus.We propose a counterexample as follows.Thus the assumption that the interconnection graph has a globally reachable node in many references and also in this paper may be moderatable and acceptable.

Counterexample 1
The multi-agent system contains two agents, labeled by agent 1 and agent 2. Without loss of generality, we assume m 1.For any positive constant α, let t 0 0, t 1 , t 2 , . . .be an infinite time sequence, which satisfies t 2k 1 t 2k 1 and t 2k 2 t 2k 1 1/2α 2 1/4α 2 e 2α e −2α , k 0, 1, 2, . ... Suppose that the two agents are connected in time interval t 2k , t 2k 1 and not connected in time interval t 2k 1 , t 2k 2 .The dynamics of the two agents can be expressed as ṙi p i , ṗi u i , i 1, 2.

4.21
Take κ 2α, γ α.All nonzero weighted elements of graph are taken as 1.Applying the local law 2.9 to the multi-agent system, the control input u i has the following form:

4.22
The initial position and velocity of agents are taken as r 1 0 −r 2 0 e 2α − 2α 1 /4α 2 and p 1 0 −p 2 0 1.From the symmetry of the input and initial values, we can know that r 1 −r 2 and p 1 −p 2 .Then, we can obtain for k 0, 1, 2, . ...Although the interconnection graph related with any time interval t 2k 1 , t 2k 2 is not connected, the jointed graph related to the multi-agent system is jointly connected in any interval t 2k , t 2 k 1 .Thus, the interconnection topology of the multi-agent system satisfies jointly connected condition proposed by 1 .On the other hand, it is easy to see that the multi-agent system cannot achieve consensus for any positive constant α in this case.

5.2
The positive definite The initial positions and velocities of the all agents are randomly produced.The position and velocity errors in Figure 1 are defined as r i − r 0 and p i − p 0 , respectively.Figure 1 shows that the follower agents can track the leader.
In leaderless case, consider a multi-agent system with six agents.The interconnection topology is also arbitrarily switched with switching period 1 among four graphs G i i and μ 1 such that they satisfy condition 4.9 .Take γ 2.5 and κ 1 > 2/μγ 2 λ max P 3 , where λ max P 3 0.93.The position and velocity errors in Figure 2 are defined as r i − r and p i − p, respectively.Figure 2 shows the multi-agent system in leaderless case can achieve consensus.

Conclusion
In this paper, we have investigated the control of multi-agent systems with varying directed interconnection topologies using graph theory and stability theory.The proposed consensus strategy is neighbor-based law that is, each agent regulated its position and velocity based on its neighbor agents.There are two different cases considered in this study.One is the leader-following case and the other the leaderless case.To make this less conservative, a parameter-dependent common Lyapunov function CLF was constructed to analyze the stability of the closed system.Some sufficient conditions are given to achieve consensus of these mobile agents with the proposed local control strategies in both leader-following and leaderless cases, respectively.Of course, we can obtain consensus condition directly for the multi-agent system with the switching and undirected interconnection topology or directed balanced interconnection topology.Due to conservativeness of the common Lyapunov function method, we will probe less conservative method in our future work.We also will probe multi-agent H ∞ consensus control problems with external disturbance under time delay directed switching topologies in our future work.Moreover, several numerical simulations were shown to verify the theoretical analysis.

Corollary 3 . 3 .
Suppose the interconnection topology G is fixed.If node v 0 is globally reachable in G and the constant κ satisfies κ > 2 γ 2 λ max P 2 , 3.13

3 .Lemma 4 . 2 .
The next lemma is given for L If G σ is balanced and has a globally reachable node, then L T σ L σ is positive definite.

Figure 1 :
Figure 1: Position and velocity tracking errors of six followers.

Figure 2 :
Figure 2: Position and velocity tracking errors of six followers.
balanced and has a globally reachable node > 0, 4.15 .Moreover, if all the interconnection graphs G σ associated with any time interval are undirected and connected, then we have λ 2 min l∈P {λ 2 L l }.For balanced graph case, the following corollary is similarly obtained as in Corollary 3.5.