# Consensus of High-Order Linear Multiagent Systems with Multitype Switching Topologies Based on the Dynamic Dwell Time Approach.

1. IntroductionIn the past few decades, the study of distributed coordination control of multiagent systems has been a hot topic due to the extensive applications in various specialized areas, including flocking [1], formation control [2], the cooperative control of unmanned air vehicles [3], and communication control of large scale networks [4]. Consensus, as one of the most important subjects in distributed coordination control, means that, by appropriate control protocols, multiple agents can reach agreement on certain quantities of interest, such as velocity, position, or heading direction.

Numerous significant theoretical results in the literature have dealt with the consensus problem of multiagent systems in the framework of first-order/second-order state space [5-7]. However, due to the complexity and diversity of agents in the real world, high-order dynamics should be considered. Reference [8] investigated a general high-order model for linear multiagent systems (LMASs) under a fixed communication topology and presented some consensus criteria. The impact of the agent dynamic structure and the communication topology on consensusability was pointed out in [9]. Reference [10] derived some necessary and sufficient conditions for ensuring consensus of high-order system and introduced the concept of consensus regions. In [11], consensus criteria and consensus functions were obtained, and the design of feedback gain matrix in protocol was provided.

Moreover, link failure and creation occur frequently due to, for instance, the sensors limited communication range, transmission failures, and certain obstacles. Therefore, the study of the consensus of high-order LMASs under switching topologies is more practical. Under the assumption that the communication topologies are undirected, a sufficient condition for consensus was derived in [12] with a constraint that the communication topologies are required to be "frequently connected." In [13], the communication topology condition was extended to "jointly connected." Based on digraphs, [14] relaxed the communication topology conditions in [12, 13] and pointed out the fact that the "uniformly jointly quasi-strongly connected" topology is critical for LMASs to achieve consensus.

It is well known that there are three key factors for consensus of LMAS under fixed topology: dynamic structure of agents, communication topology of LMASs, and control protocol. Further, switching signals on communication topologies play a key role in achieving consensus for LMASs under switching topologies. When dynamic structures of agents and possible communication topologies are given, one can study the relationship between the consensus and the switching rule of communication topologies. A natural question which arises is with what switching signal can the LMASs achieve consensus? Literature addressing this concern has already been published. For instance, by using the average dwell time method, [15] chose a class of signals to deal with a synchronization problem of a nonlinear multiagent system under undirected switching topologies. The topology condition was extended to the digraph in [16,17]. However, switching signals based on the average dwell time method are "slow switching" and are too limited to precisely depict the sufficient condition for consensus. This limitation brings difficulties to the analysis of consensus conditions. To overcome this drawback, a switching rule based on the dynamic dwell time method [18] was introduced in [19] with an assumption that all possible communication topologies are consensusable.

However, in practice, the possible communication topologies of LMASs are not always consensusable. Thus, this paper analyzes the consensus problem for high-order LMASs under multitype switching topologies. It is aimed at exploring a switching rule, such that, with a class of switching signals satisfying this rule, consensus can be achieved by LMASs. Compared with the existing works, the contributions of the paper are summarized as follows. (1) Communication topology conditions in [19] are extended to include both consensusable and unconsensusable communication topologies. (2) Compared with the switching rule based on the average dwell time method in [16, 17], a switching rule based on the dynamic dwell time method is less conservative and more flexible; in addition, it allows more numbers of switching signals.

An outline of this paper is organized as follows. In Section 2, some basic concepts are described and the problem to be studied is formulated. A linear transformation is presented along with a lemma to describe the equivalent relation between the consensus problem and the stability problem of a corresponding switched system in Section 3. A sufficient condition based on the dynamic dwell time method for the consensus of LMASs is established in Section 4. A numerical example is provided in Section 5. Conclusions are drawn in Section 6.

2. Problem Description

Consider a system consisting of N agents, labelled 1 through N, and the dynamic of the ith agent is

[[??].sub.i] (t) = A[x.sub.i] (t) + B[u.sub.i] (t),

[x.sub.i] (0) = [x.sub.i0],

i [member of] I, (1)

where [x.sub.i] [member of] [R.sup.n] is the state variable of agent i, [u.sub.i] [member of] [R.sup.m] is its control input, I = {1, ..., N} is the index set of agents, and A [member of] [R.sup.nxn] and B [member of] [R.sup.nxm] are constant matrices.

The communication topology (hereafter referred to as topology) of system (1) is expressed by a weighted digraph N(t) = {V, E(t), W(t)}, where the ith element of the vertex set V = {[v.sub.1], ..., [v.sub.N]} represents agent i, and the element ([v.sub.i], [v.sub.j]) of the time-varying edge set E(t) [subset or equal to] V x V denotes the communication link from agents i to j. Let [N.sub.i] (t) = {[v.sub.j] [member of] V, ([v.sub.j], [v.sub.i]) [member of] E(t)} stand for the neighbor set of agent i, and weight matrix W(t) = [[[w.sub.ij]].sub.NxN], where [w.sub.ij] is a scalar which represents the coupling strength of information transmitting from agents j to i, i, j [member of] I.

Using a protocol [5],

[u.sub.i] (t) = K [summation over (j [member of] [N.sub.i] (t))] [w.sub.ij] (t) ([x.sub.j] (t) - [x.sub.i] (t)), i [member of] I, (2)

where K e Rmxn is a feedback gain matrix.

Definition 1. System (1) achieves consensus via protocol (2) if, for any initial state, there is [lim.sub.t[right arrow][infinity]] [parallel][x.sub.i](t) - [x.sub.j](t)[parallel] = 0, i, j [member of] I.

Herein [parallel]*[parallel] denotes the Euclidean norm of a vector.

Definition 2 (see [19]). A time-invariant topology N is called consensusable topology of system (1), if there exists a protocol in form (2) such that system (1) achieves consensus. Otherwise, topology N is unconsensusable.

For instance, a topology in which there exists a spanning tree is consensusable.

Due to various reasons, such as the sensors limited communication range, transmission failures, and obstacles, the communication links between agents may disconnect or reconnect and result in time-varying topology N(t). Without loss of generality, suppose there are finite topologies of system (1); that is, N(t) [member of] NA = {[N.sup.l], l [member of] M}, M = {1, ..., M}. Within NA, there are [M.sub.1] consensusable topologies, that is, set NC = {[N.sup.l], l [member of] [M.sup.-]}, and [M.sub.2] unconsensusable topologies, that is, set NU = {[N.sup.l], l [member of] [M.sup.+]}, where M = [M.sup.-] [union] [M.sup.+] and NA = NC [union] NU. Next, we consider a case which satisfies the following assumption.

Assumption 3. Topology N(t) switches within set NA = {[N.sup.l], l [member of] M}, where [N.sup.l], l [member of] [M.sup.-] is consensusable, while [N.sup.l], l [member of] [M.sup.+] is unconsensusable.

Via protocol (2), system (1) can be expressed by the switched system as follows:

[??](t) = ([I.sub.N] [cross product] A - [L.sub.[sigma](t)] [cross product] (B[K.sub.[sigma](t)])) x(t), t [member of] [0, [infinity]), (3)

where x = [[[x.sup.T.sub.1] ... [x.sup.T.sub.N]].sup.T] [member of] [R.sup.Nn], x(0) = [x.sub.0] is initial state, IN is the identity matrix of order N, [cross product] is the Kronecker product of matrices, [sigma](t) : [0, +[infinity]) [right arrow] M is a piecewise constant function which describes the switching law of topology N(t); namely, N(t) = [N.sup.l] [??] [sigma](t) = l, l [member of] M. Suppose that there is finite switching for N(t) within any finite time interval. For any given [sigma](t), define the switching sequence {([t.sub.0], [l.sub.0]), ([t.sub.1], [l.sub.1]), ..., ([t.sub.r], [l.sub.r]), ..., | [l.sub.r] [member of] M, r = 0, 1, ...}, where [sigma]([t.sub.r]) = lr; that is, the topology of LMAS (1) is [mathematical expression not reproducible] when t [member of] [[t.sub.r], [t.sub.r+1]). [L.sub.[sigma](t)] [member of] [R.sup.NxN] is the weighted Laplacian matrix induced by the topology N(t) = {[N.sup.[sigma](t).sub.i], i [member of] I}, and its entries are defined by

[mathematical expression not reproducible], (4)

It is generally known that the switching signals of topologies have great impact on the consensus of LMASs. If LMASs follow an incorrect switching signal, consensus cannot be achieved even though N(t) switches within consensusable topologies. Conversely, if LMASs follow a correct switching signal, consensus can be achieved even if N(t) switches within unconsensusable topologies. We aim to explore under what condition for the switching signal [sigma](t) can system (1) achieve consensus via protocol (2) with topology N(t) satisfying Assumption 3. In order to depict the switching signal [sigma](t), we introduce the definition of dwell time.

Definition 4 (see [20]). Let {[t.sub.k], k = 0, 1, 2, ...} be the set of switching instants of a given switching signal [sigma](t),where [t.sub.0] = 0. [[tau].sub.l] ([t.sub.k]) = [t.sub.k+1] - [t.sub.k] is called the dwell time of system (1) under topology [N.sup.l], l = [sigma] ([t.sub.k]).

Next, by a linear transformation, we equivalently transform the consensus problem into an asymptotic stability problem of a corresponding switched system.

3. Linear Transformation and Consensus Analysis

Consider the following linear transformation [11]:

[mathematical expression not reproducible], (5)

where [1.sup.T.sub.N] = [1 1 ... 1] is N dimensional vector, [bar.x] = [[[[bar.x].sup.T.sub.1] ... [[bar.x].sup.T.sub.N-1] [[bar.x].sup.T.sub.N]].sup.T], and [[??].sub.0] is (N - 1) x N matrix defined by

[mathematical expression not reproducible]. (6)

The inverse matrix of H can be worked out as follows:

[H.sup.-1] =: [[[??].sub.0] [N.sup.-1] [1.sub.N]] [cross product] [I.sub.n], (7)

where [[??].sub.0] is N x (N - 1) matrix given by

[mathematical expression not reproducible]. (8)

After the linear transformation (5), system (3) is transformed into the following system:

[??](t) = H ([I.sub.N] [cross product] A - [L.sub.[sigma](t)] [cross product] (B[K.sub.[sigma](t)])) [H.sup.-1] [bar.x] (t),

[bar.x](0) = [[bar.x].sub.0].

Let [bar.x] = [[[y.sup.T] [z.sup.T]].sup.T], where y = [[[[bar.x].sup.T.sub.1] ... [[bar.x].sup.T.sub.N-1]].sup.T], z = [[bar.x].sub.n].

Then system (9) can be rewritten into two equations:

[??] = [[bar.A].sub.[sigma](t)] y,

[??] = [[bar.C].sub.[sigma]{t)] y + Az, (10)

where

[mathematical expression not reproducible]. (11)

As [sigma](t) is a piecewise constant function that maps into M, the first equation of system (10) can be expressed by a switched system with M subsystems and a switching signal [sigma](t):

[??] = [[bar.A].sub.l]y, l [member of] M. (12)

Definition 5 (see [20]). The equilibrium point y = 0 of the switched system (12) is said to be exponentially stable under switching signal [sigma](t) if the solution y(t) satisfies

[mathematical expression not reproducible], (13)

where constants [eta] [greater than or equal to] 1 and [lambda] > 0.

The consensus of system (1) via protocol (2) is equivalent to the asymptotic stability of equilibrium point y = 0 for the switched system (12). Thus, similar to the proof process of Lemma 2 and Theorem 1 in [11], we arrive at the following lemma.

Lemma 6. For given topology set {[N.sup.l], l [member of] M} and a switching signal [sigma](t), via protocol (2), system (1) achieves state consensus if and only if the switched system (12) is exponentially stable.

Let [sigma](t) [equivalent to] I. From Lemma 6 we can derive a consensus criterion of system (1) under fixed topology [N.sup.l] as follows.

Corollary 7. [N.sup.l], the topology of system (1), is consensusable if and only if the matrix [[bar.A].sub.l] in (12) is Hurwitz stable.

4. Main Results

In this section, based on the dynamic dwell time method, we will analyze a sufficient condition that guarantees the consensus of system (1) under multitype switching topologies.

Suppose topology N(t) satisfies Assumption 3. From Corollary 7, we obtain that [[bar.A].sub.l], l [member of] [M.sup.-] in (12) is Hurwitz stable while [[bar.A].sub.l], l [member of] [M.sup.+] is not Hurwitz stable. Hence, there are positive scalars [[lambda].sub.l], l [member of] M and positive definite matrices [Q.sub.l], l [member of] M such that

[([[bar.A].sub.l] + [[lambda].sub.l]I).sup.T] [Q.sub.l] + [Q.sub.l] ([[bar.A].sub.l] + [[lambda].sub.l]I) < 0, l [member of] [M.sup.-],

[([[bar.A].sub.l] + [[lambda].sub.l]I).sup.T] [Q.sub.l] + [Q.sub.l] ([[bar.A].sub.l] - [[lambda].sub.l]I) < 0, l [member of] [M.sup.+]. (14)

Define the Lyapunov functions

[V.sub.l] (y) = [y.sub.T][Q.sub.l]y, y [member of] [R.sup.(N-1)n], l [member of] M. (15)

As N(t) switches among topology set NA = NC [union] NU. Without loss of generality, suppose system (1) firstly runs under several consensusable topologies in succession, which are denoted by a consensusable subgroup [mathematical expression not reproducible] and then follow with several unconsensusable topologies one after another, which is denoted as unconsensusable subgroup [mathematical expression not reproducible], and that cycle repeats. Hence, we have an assumption about switching signal [sigma](t) as follows.

Assumption 8. The consensusable subgroup [mathematical expression not reproducible] is first activated and then follows with the unconsensusable subgroup [mathematical expression not reproducible], and that cycle repeats. Switching signal [sigma](t) has a sequence of switching instants as follows:

subgroup switching instants

[mathematical expression not reproducible], (16)

where [mathematical expression not reproducible].

Remark 9. From Assumption 8, we know that, for any positive number T, there exists interval [mathematical expression not reproducible] such that a consensusable topology is activated.

Let [l.sup.-] be the index of the former consensusable topology of [N.sup.l], l [member of] [M.sup.-]. [t.sup.-] ([t.sup.+]) is the left (right) limit of t.

Theorem 10. Assume that topology N(t) of system (1) satisfies Assumption 3 and the switching signal [sigma](t) satisfies Assumption 8. System (1) can achieve consensus via protocol (2) with the switching signal [sigma](t) if the corresponding dwell time [[tau].sub.l] of [mathematical expression not reproducible] for system (1) satisfies

[mathematical expression not reproducible], (17)

where

[mathematical expression not reproducible]. (18)

Proof. First, we prove that switched system (12) is asymptotic stable. It contains three steps as follows.

Step 1. Condition (17) implies

[mathematical expression not reproducible]. (19)

Considering the Lyapunov functions [V.sub.l] (y) in (15), there are

[[alpha].sub.1] [[parallel]y[parallel].sup.2] [less than or equal to] [V.sub.l] (y) [less than or equal to] [[alpha].sub.2] [[parallel]y[parallel].sup.2], l [member of] M, (20)

where [[alpha].sub.1] = [min.sub.l[member of]M] [[lambda].sub.min] ([Q.sub.l]) and [[alpha].sub.2] = [max.sub.l[member of]M] [[lambda].sub.max] ([Q.sub.l]). Let [mathematical expression not reproducible]. From (14), we obtain

[mathematical expression not reproducible]. (21)

Hence, for [mathematical expression not reproducible], there is

[mathematical expression not reproducible]. (22)

Let [mathematical expression not reproducible], and, from (21), we derive

[mathematical expression not reproducible], (23)

where [mathematical expression not reproducible]. Thus, formula (19) is available.

Step 2. Without loss of generality, assume that [mathematical expression not reproducible] is the initial state. According to (20), we obtain

[mathematical expression not reproducible]. (24)

By (21), for [mathematical expression not reproducible], we have

[mathematical expression not reproducible]. (25)

It concludes that

[mathematical expression not reproducible], (26)

where [mathematical expression not reproducible]. By using (19), we obtain

[mathematical expression not reproducible]. (27)

Thus, for any [epsilon] > 0, there exists [mathematical expression not reproducible], such that [parallel]y(t)[parallel] < [epsilon] for all [mathematical expression not reproducible], whenever [parallel]y([t.sub.1])[parallel] < [[delta].sub.2].

Step 3. When [mathematical expression not reproducible], we get

[mathematical expression not reproducible]. (28)

In summary,

[mathematical expression not reproducible], (29)

where [mathematical expression not reproducible]. Consider

[mathematical expression not reproducible], (30)

where [beta] is a positive constant.

Therefore, for any [epsilon] > 0, there exist [[delta].sub.2] = [([[alpha].sup.-1.sub.1][[alpha].sub.2] [[PI].sup.k.sub.s=1] [[bar.h].sub.s] [beta]).sup.-1/2] [epsilon] such that [parallel]y(t)[parallel] < [epsilon] for all t [member of] [mathematical expression not reproducible], whenever [mathematical expression not reproducible].

Hence, for any t > 0 and [epsilon] > 0, there exist [[delta].sub.2] = max ([[delta].sub.1], [[delta].sub.2]) such that [parallel]y(t)[parallel] < [epsilon]. Consequently, the switched system (12) is asymptotic stable.

From Lemma 6 we know that system (1) achieves consensus. The proof is complete.

Remark 11. Let [mathematical expression not reproducible], and choose [[lambda].sup.*] [member of] ([lambda], [[lambda].sup.-]). It can be seen that the condition in Theorem 10 implies both [tau] > (ln [mu]) / [lambda] and time ratio condition [inf.sub.t[greater than or equal to]0] ([T.sup.-] (t) / [T.sup.+] (t)) [greater than or equal to] ([[lambda].sup.+] + [[lambda].sup.*]) / ([[lambda].sup.-] - [[lambda].sup.*]), where [T.sup.-] (t) (resp., [T.sup.+] (t)) stands for the total activation time of system (1) under consensusable (resp., unconsensusable) topologies. Theorem 2 in [16] is a special case of Theorem 10.

Remark 12. When unconsensusable topology set NU = 0, that is, N(t) switches in consensusable topology set NA = NC, it can be seen that Theorem 1 in [19] is only a special case of Theorem 10.

5. Simulation Example

In this section, we give a numerical simulation to illustrate the obtained result. Consider a multiagent system with 6 agents:

[mathematical expression not reproducible], (31)

with protocol

[u.sub.i] (t) = [1 1.2] [summation over (j [member of] [N.sup.[sigma](t).sub.i])] [w.sup.[sigma](t).sub.ij] ([x.sub.j] (t) - [x.sub.i] (t)), (32)

where [[x.sub.i] (t) = [[x.sub.i1] (t), [x.sub.i2] (t)].sup.T].

Figure 1 shows four different directed topologies [N.sup.l] : l = 1, 2, 3, 4. The weight of each edge is 1. From Definition 2 and Corollary 7, it derives that [N.sup.1] and [N.sup.3] are consensusable topologies while [N.sup.2] and [N.sup.4] are unconsensusable topologies. Consider switching topologies with a periodic switch sequence S : [N.sup.1] [right arrow] [N.sup.2] [right arrow] [N.sup.3] [right arrow] [N.sup.4] [right arrow] [N.sup.1] ....

Next, we compare the consequences of two types of switching signals which are correspondingly based on the dynamic dwell time method (DDTM) in this paper and on the average dwell time method (ADTM) in [16].

By use of the ADTM in [16], we obtain that if the switching signals of topologies satisfy both average dwell time condition [[tau].sub.a] [greater than or equal to] 6.6776 and time ratio condition [inf.sub.t[less than or equal to]0] [T.sup.-] (t) / [T.sup.+] (t) [greater than or equal to] 3, via protocol (32), system (31) can achieve consensus under switching topology. Figure 2 depicts the state trajectory of each state component of the six agents under the aforementioned switching topologies and a switching signal a[sigma](t) in Figure 3 with the switching sequence S.

By using the DDTM (17), we can obtain the dynamic dwell time [[tau].sub.l] (tk), l = 1, 2, 3, 4, k = 1, 2, ..., that evolves on the topologies [N.sup.l], l = 1, 2, 3, 4. If switching signals of topology satisfy dynamic dwell time condition, via protocol (32), system (31) can achieve consensus under switching topologies. Part values of the minimum dwell time of a switching signal are shown in Table 1. Choose dwell time [[tau].sub.l] ([t.sub.k]) + 0.2; Figure 4 gives the state trajectory of each state component of the six agents under the aforementioned switching topologies and a switching signal [[sigma].sub.d] (t) in Figure 5 with the switching sequence S.

What is shown in Figures 2 and 4 indicates that, for the same dynamic, topologies, switching sequence S, protocol, and initial states, system (31) can achieve consensus by the use of switching signals based on average and dynamic dwell time methods. However, switching signal [[sigma].sub.a] (t) in Figure 3 switches 4 times within 25 seconds; in contrast, switching signal [[sigma].sub.d] (t) in Figure 5 switches 68 times within 25 seconds. Based on the above analysis, DDTM (17) is less conservative and provides more flexible switching signals in practical ways for the LMASs to achieve consensus.

6. Conclusion

The consensus problem has been studied for high-order LMASs under multitype communication topologies that include both consensusable and unconsensusable topologies. By using a linear transformation, a lemma has been presented which analyzes the equivalence relation between the consensus of LMASs and the asymptotic stability of a corresponding system. Based on the dynamic dwell time method, a switching rule has been characterized. With a class of switching signals which satisfies this switching rule, the consensus of LMASs can be achieved under multitype switching topologies. Finally, the effectiveness of the proposed theory has been illustrated by a numerical example.

http://dx.doi.org/ 10.1155/2016/7396419

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work is partially supported by Natural Science Foundation of China (61273006, 61511130044, and 61573030).

References

[1] R. Olfati-Saber, "Flocking for multi-agent dynamic systems: algorithms and theory," IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401-420, 2006.

[2] H. Yang, C. Wang, and F. Zhang, "Robust geometric formation control of multiple autonomous underwater vehicles with time delays," in Proceedings of the American Control Conference (ACC '13), pp. 1380-1385, IEEE, Washington, DC, USA, June 2013.

[3] W. Ren and R. W. Beard, Distributed Consensus in Multi-Vehicle Cooperative Control: Theory and Applications, Springer, London, UK, 2007.

[4] R. Olfati-Saber and P. Jalalkamali, "Coupled distributed estimation and control for mobile sensor networks," IEEE Transactions on Automatic Control, vol. 57, no. 10, pp. 2609-2614, 2012.

[5] 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.

[6] W. Ren and R. W. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Transactions on Automatic Control, vol. 50, no. 5, pp. 655-661, 2005.

[7] W. Ren, R. W. Beard, and E. M. Atkins, "Information consensus in multivehicle cooperative control," IEEE Control Systems Magazine, vol. 27, no. 2, pp. 71-82, 2007.

[8] F. Xiao and L. Wang, "Consensus problems for high dimensional multi-agent systems," IET Control Theory & Applications, vol. 1, no. 3, pp. 830-837, 2007.

[9] C.-Q. Ma and J.-F. Zhang, "Necessary and sufficient conditions for consensusability of linear multi-agent systems," IEEE Transactions on Automatic Control, vol. 55, no. 5, pp. 1263-1268, 2010.

[10] W. Yu, G. Chen, W.Ren, J. Kurths, and W. X. Zheng, "Distributed higher order consensus protocols in multiagent dynamical systems," IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 58, no. 8, pp. 1924-1932, 2011.

[11] Y. Z. Chen, Y. R. Ge, and Y. X. Zhang, "Partial stability approach to consensus problem of linear multiagent systems," Acta Automatica Sinica, vol. 40, no. 11, pp. 2573-2584, 2014.

[12] J. Wang, D. Cheng, and X. Hu, "Consensus of multi-agent linear dynamic systems," Asian Journal of Control, vol. 10, no. 2, pp. 144-155, 2008.

[13] Y. Su and J. Huang, "Stability of a class of linear switching systems with applications to two consensus problems," IEEE Transactions on Automatic Control, vol. 57, no. 6, pp. 1420-1430, 2012.

[14] L. Cheng, H. Wang, Z.-G. Hou, and M. Tan, "Reaching a consensus in networks of high-order integral agents under switching directed topologies," International Journal of Systems Science, 2014.

[15] T. Liu, J. Zhao, and D. J. Hill, "Exponential synchronization of complex delayed dynamical networks with switching topology," IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 57, no. 11, pp. 2967-2980, 2010.

[16] Y. Chen, Y. Zhang, Z. He, and Y. Ge, "Average dwell-time conditions of switching information topologies for consensus of linear multi-agent systems," in Proceedings of the 32th IEEE Chinese Control Conference (CCC '13), pp. 7115-7120, Xi'an, China, July 2013.

[17] Y. R. Ge, Y. Z. Chen, and Y. X. Zhang, "Average dwell-time conditions for consensus of discrete-time linear multi-agent systems with switching topologies and time-varying delays," Acta Automatica Sinica, vol. 40, no. 11, pp. 2609-2617, 2014.

[18] Z. R. Xiang and W. M. Xiang, "Stability analysis of switched systems under dynamical dwell time control approach," International Journal of Systems Science, vol. 40, no. 4, pp. 347-355, 2009.

[19] Z. Yaxiao, C. Yangzhou, and A. Y. Aleksandrov, "Dynamic dwell-time condition of switching information topology for consensus of linear multi-agent systems," in Proceedings of the 34th Chinese Control Conference (CCC '15), pp. 6918-6923, Hangzhou, China, July 2015.

[20] D. Liberzon, Switching in Systems and Control, Springer, Boston, Mass, USA, 2003.

Yaxiao Zhang, Yangzhou Chen, and Xiaojun Qu

Beijing Key Laboratory of Transportation Engineering, College of Metropolitan Transportation, Beijing University of Technology, Beijing 100124, China

Correspondence should be addressed to Yaxiao Zhang; zhangyaxiao@emails.bjut.edu.cn

Received 21 October 2015; Accepted 8 December 2015

Academic Editor: Weiguo Xia

Caption: FIGURE 1: Four possible topologies of system (31).

Caption: FIGURE 2: State trajectories of system (31) with ff[sigma](t).

Caption: FIGURE 3: A switching signal [[sigma].sub.a] (t) of [N.sub.1], [N.sub.2], [N.sub.3], [N.sub.4].

Caption: FIGURE 4: State trajectories of system (31) with [[sigma].sub.d] (t).

Caption: FIGURE 5: A switching signal [[sigma].sub.d] (t) of [N.sub.1], [N.sub.2], [N.sub.3], [N.sub.4].

TABLE 1: Part values of the minimum dwell time Ti{tk) Topology [N.sup.1] [N.sup.2] [N.sup.3] [N.sup.4] [[tau].sub.l] 0 0.1903 0 0.284 ([t.sub.k]) 1.4086 0.0380 0 0.0270 0.7497 0.2654 0 0.3896 0.9814 0.4671 0.2749 0.0650 0.5577 0.2845 0.0557 0.2347 0.5707 0.0060 0 0.1686 ... ... ... ...

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Zhang, Yaxiao; Chen, Yangzhou; Qu, Xiaojun |

Publication: | Mathematical Problems in Engineering |

Date: | Jan 1, 2016 |

Words: | 4553 |

Previous Article: | An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers. |

Next Article: | Synchronization for a Class of Uncertain Fractional Order Chaotic Systems with Unknown Parameters Using a Robust Adaptive Sliding Mode Controller. |