# Distributed Tracking Control for Discrete-Time Multiagent Systems with Novel Markovian Switching Topologies.

1. IntroductionInspired by the potential applications in engineering, such as networked autonomous vehicles, sensor networks [1], and formation control [2], distributed coordination of multiagent systems has attracted much attention from researchers [3, 4]. Very recently, consensus problems have been studied extensively as well as references therein [5, 6]. Many methods have been developed to deal with the consensus problem like linear system theory [7], impulsive control [8], convex optimization method [9], and so on. Due to the complexity of network, the control problem of multiagent systems will be very challenging and difficult. Therefore, how to design the consensus control protocol for multiagent systems becomes a significant research focus.

In most cases, the connectivity of graph might be unfixed; it may deteriorate the system performance and even cause instability. Therefore, some of the existing results concentrate on the ideal case where multiagent systems can be described as the dynamic topology [10, 11]. Researching among those works, some main results and progress on distributed coordination control were given and the system under a dynamic topology was addressed through various methods [12,13]. For example, distributed consensus problem was studied for discrete-time multiagent systems with the switching graphs, where each agent's velocity was constrained to lie in a nonconvex set [14]. Moreover, two consensus problems were solved under a switching topology, which was assumed to be uniformly connected only [15]. Otherwise, the aforementioned works not only focused on first-order and second-order systems [16], but also focused on Euler-Lagrange models [17, 18] and even took the time delay and noises into account [19, 20].

Due to the random link failures, variation meeting the need and sudden environmental disturbances, some dynamical systems could be modeled as Markovian switching systems, which are starting with a rapid development [21-23]. Leader-following consensus problem was studied for data-sampled multiagent systems under the Markovian switching topologies [24] and a more interesting case with multiple dynamic leaders was considered in [25]. In [26], under a switching topology governed by Markov chains, the consensus seeking problem was solved through a guaranteed cost control method. It was unnecessary for the Markov chain to be ergodic, since each topology had a spanning tree. In addition, it is difficult to obtain all the elements of the transition rate matrix, or some of the elements are not necessary to guarantee the system stability. Markovian switching model with partially unknown transition rates was considered in [27], and any knowledge of the unknown elements was needed in the design procedure of finite time synchronization controller.

However, many practical systems can be addressed as a dynamic model, such as replacing the broken agents in the group and expanding the function on the basis of traditional one. The time varying reference can be tracked firmly in the original system, whether the union system could achieve consensus in case of combining some followers with a fixed graph. Besides, as far as we know, the usual case, in which Markov chain used in, is the modes of the topologies, since all of the subgraphs and the transition rate matrix should be known or partly known clearly. In contrast with that, Markov chains are applied to the edges of graph in this paper, so that the union system could be discovered through introducing a novel mapping, together with the distributed tracking problem for the union system; it is a valuable topic to be researched.

The main purpose of this paper is to establish the Markovian switching topologies for the union system with two subgraphs. Through a novel mapping, Markovian switching topologies are governed by a set of Markov chains to the edges of the graph. Hence, distributed coordinated tracking control problem is solved via a PD-like consensus algorithm adopted from [16]. Different from [16], a sufficient condition on the system stability is obtained based on trigonometric function theory. As shown in the forward reference, the tracking errors are ultimately bounded, which is partly determined by the bounded changing rate and the number of agents. Simulation result can more fully prove the effectiveness of the strategy.

The rest of this paper is organized as follows. In Section 2, graph theory based on a novel Markov process is given and PD-like consensus algorithm is adopted. In Section 3, stability analysis and some results are provided. Simulation example is presented in Section 4 and this paper is concluded in Section 5.

2. Preliminaries

2.1. Graph Theory. Define a directed leader-following graph G [??] (V, [epsilon]) with one leader labeled as node 0 and n followers. V = {[v.sub.0], ..., [v.sub.n]} is a nonempty finite set of nodes and [epsilon] [subset or equal to] V x V is a set of edges. For an edge ([v.sub.i], [v.sub.j]) [member of] [epsilon], if the node [v.sub.j] can obtain information from [v.sub.i], [v.sub.i] is a neighbor of node [v.sub.j]. A directed path is a sequence of edges in the form of ([v.sub.1]; [v.sub.2]), ([v.sub.2], [v.sub.3]), ([v.sub.3], [v.sub.k]),..., where [v.sub.k] [member of] V. The adjacency matrix A = [[a.sub.ij]] [member of] [R.sup.(n+1)x(n+1)] is associated with G, where [a.sub.ij] > 0 if agent [v.sub.i] can obtain information from agent and [a.sub.ij] = 0 otherwise. Assume [a.sub.ii] = 0 and the leader does not receive information from the followers. Thus, the adjacency matrix of G is denoted by

[mathematical expression not reproducible], (1)

where [mathematical expression not reproducible] be a fixed and directed graph with m agents. The adjacency matrix of [G.sub.2] is given by [[lambda].sub.2] = [[a.sub.ij]] [member of] [R.sup.mxm]. The union graph is denoted by [G.sup.u] = G [union] [G.sub.2] with the node set [V.sup.u] = V [union] [V.sub.2] and the edge set [[epsilon].sup.u] = [epsilon] [union] [[epsilon].sub.2]. Hence

[mathematical expression not reproducible], (2)

[mathematical expression not reproducible], (3)

where [mathematical expression not reproducible] are parts of the switching matrices among the nodes of G and [G.sub.2], [theta](k) (for brevity, denoted by [[theta].sub.k]) is a finite homogeneous Markov process, and it will be detailed in the following section.

2.2. Markov Chains. Define a finite set [mathematical expression not reproducible], where [direct sum] represents a novel operation mark among matrices, [GAMMA] is a set corresponding to [mathematical expression not reproducible]. Meanwhile, introduce the mapping [THETA]: [[GAMMA].sup.ef] [right arrow] [[GAMMA].sub.ef] with

[mathematical expression not reproducible]. (4)

Then, the mapping [XI](x) is a bijection from [[GAMMA].sup.ef] to [[GAMMA].sub.ef].

Remark 1. Based on the bijection in (4), the transition probability [THETA]([[theta].sub.k]) = Pr[[[theta].sub.k] | [[theta].sub.k-1]] could be derived as follows.

Firstly, for the matrix [mathematical expression not reproducible] is corresponding to the only matrix in the set [[GAMMA].sup.mn]. In the modes [[theta].sub.k] and [[theta].sub.k-1], the following is yielded:

[mathematical expression not reproducible]. (5)

Assume that each edge of [G.sup.u] takes value in the set [DELTA] with an unequal probability. The transition rate matrix is given by

[mathematical expression not reproducible]. (6)

where

[mathematical expression not reproducible]. (7)

In addition, Markov chain is ergodic throughout this paper. It is obvious that

[mathematical expression not reproducible], (8)

where [delta](* | *) represents the transition probability from one mode to another. Let the transition probability be [mathematical expression not reproducible]; then

[mathematical expression not reproducible]. (9)

The same work is done to the matrices [mathematical expression not reproducible]. Overall consideration, for brevity, denotes the total probability as

[mathematical expression not reproducible]. (10)

Finally, the total number of system modes is [eta] = [[gamma].sup.2mn+m], and the transition rate matrix is

[PI] = 1/[omega] [1.sub.[eta]] [1.sup.T.sub.[eta]]. (11)

2.3. PD-Like Consensus Algorithm. Suppose the discrete dynamic of the ith follower is

[[xi].sub.i] (k + 1) = [[xi].sub.i] (k) + T[u.sub.i], (k), (12)

where [[xi].sub.i](k) is the state at t = kT, where k is the discrete-time index, T is the sampling period, and [u.sub.i](k) is the control input.

Let the reference state be [[xi].sub.0](k) = [[xi].sup.r](k). Consider the discrete-time coordinated tracking algorithm adopted from [16], together with the Markovian parameter [[theta].sub.k]; consensus algorithm (13) will be applied to the agents in graph [G.sup.u]:

[mathematical expression not reproducible], (13)

where [mathematical expression not reproducible], is the (i, j)th entry of [A.sup.u], and q is a positive constant. Suppose that each follower has at least one neighbor, thus [mathematical expression not reproducible]. Appling (12) and (13) yields

[mathematical expression not reproducible]. (14)

Define [mathematical expression not reproducible]; it follows that

[mathematical expression not reproducible], (15)

where

[mathematical expression not reproducible]. (16)

{[sigma](k), k [member of] [Z.sup.+]} is not a Markov process, but the joint process {[sigma](k), [[theta].sub.k]} is. Assume that the reference trajectory is a deterministic signal instead of a random one. The initial state of the joint process is denoted as {[[sigma].sub.0], [[theta].sub.0]}. It follows that the solution of (15) is

[mathematical expression not reproducible]. (17)

Note that the eigenvalues of [[??].sub.1] play an important role in the determining of [sigma](k) as k [right arrow] [infinity].

3. Convergence Analysis

Theorem 2. Suppose that the leader has directed paths to all followers 1 to n + min [G.sup.u], then

[mathematical expression not reproducible] (18)

has all eigenvalues within the unit circle, where [mathematical expression not reproducible] is denoted as the inverse of [mathematical expression not reproducible].

Proof. There exists [mathematical expression not reproducible] which is corresponding to [mathematical expression not reproducible] as denoted in (16), it follows from (3) that

[mathematical expression not reproducible]. (19)

Then, it is obvious that

[mathematical expression not reproducible]. (20)

All the elements of [mathematical expression not reproducible] are less than 1. Based on Lemma 3.1 in [5], (18) has all eigenvalues within the unit circle.

Lemma 3 ([28], Proposition 3.6). Let [mathematical expression not reproducible], is defined in (16); let [cross product] represent the Kronecker product of matrices. If [rho](L) < 1, then [phi]([??]) < 1, where [rho](x) denotes the matrix spectral radius.

Theorem 4. Suppose that the leader has directed paths to all nodes in the union graph [G.sup.u], while [[tau].sup.1.sub.i], [[tau].sup.2.sub.i] > 0 holds obviously. If the positive scalars T > 0 and q > 0 satisfy

[mathematical expression not reproducible], (21)

where

[mathematical expression not reproducible], (22)

then [??] has all eigenvalues within the unit circle.

Proof.

Step 1. The matrix [A.sup.u] has [eta] modes based on the analysis in the Section 2. If the leader has directed paths to all followers, it follows from Theorem 2 that (18) has all eigenvalues within the unit circle. It will be shown that [rho]([??]) < 1 through the method of perturbation arguments. Hence [??] can be written as

[mathematical expression not reproducible]. (23)

Denote the elementary transformation block matrix [mathematical expression not reproducible] as

[mathematical expression not reproducible]. (24)

The equation can be calculated as

[mathematical expression not reproducible]. (25)

The issue will be converted to find the conditions to make sure all eigenvalues of [M.sup.i] are within the unit circle.

Step 2. The characteristic polynomial of [M.sup.i] is given by

[mathematical expression not reproducible]. (26)

Note that [s.sup.i.sub.h] is the hth eigenvalue of [D.sup.-i] [A.sup.i], which is in the unit circle. Define [s.sup.i.sub.h] = r cos([theta]) + r sin([theta])j, where r [member of] [0,1] is the length of [s.sup.i.sub.h], [phi] [member of] [0,2[pi]], and j is the imaginary parts signal. Therefore, the roots satisfy

[[lambda].sup.2] + [Tq - 1 - (1 + Tq) [s.sup.i.sub.h]] [lambda] + [s.up.i.sub.h] = 0. (27)

It can be noted that

[mathematical expression not reproducible]. (28)

Let [[lambda].sub.1] = [l.sub.1] cos([alpha]) + [l.sub.1] sin([alpha])j and [[lambda].sub.2] = [l.sub.2] cos([beta]) + [l.sub.2] sin([beta])j. Based on (28), thus

[mathematical expression not reproducible]. (29)

[mathematical expression not reproducible]. (30)

It follows from (30) that

[mathematical expression not reproducible]. (31)

Using (29) and (31), after some manipulation, (31) can be rewritten as

[mathematical expression not reproducible]. (32)

Aimed to prove that [[lambda].sub.1] and [[lambda].sub.2] are within the unit circle, with [l.sub.1] [less than or equal to] 1, [l.sub.2] [less than or equal to] 1, it follows that

-2 < 2[l.sup.2.sub.1] [cos.sup.2] ([alpha]) + 2[l.sup.2.sub.2][cos.sup.2] ([beta]) - ([l.sup.2.sub.2] + [l.sup.2.sub.1]) < 2. (33)

Then, the following holds:

[mathematical expression not reproducible]. (34)

To get the condition of Tq, the transition of (34) is made:

[mathematical expression not reproducible]. (35)

With the limit conditions of r, [phi], and (35), the range of Tq can be obtained.

Firstly, as is well-known, in the analysis of [g.sub.1](Tq), let

[mathematical expression not reproducible]; (36)

then

[mathematical expression not reproducible]. (37)

After some manipulation, this yields

Tq [member of] [0, [[tau].sup.1.sub.i]], (38)

where [[tau].sup.1.sub.i] satisfies (22) with [[DELTA].sub.1] > 0.

Then, for the condition of [g.sub.2](Tq), the same as [g.sub.1](Tq), it can be obtained that

[mathematical expression not reproducible]. (39)

Similarly, we have

Tq [member of] [0, [[tau].sup.2.sub.i]], (40)

where [[tau].sup.2.sub.i] satisfies (22) with a > 0.

Finally, sufficient condition (21) can be exactly proved. It follows from Lemma 3.1 in [5] that ([[summation].sup.[eta].sub.i=1] [M.sup.i])/w has all eigenvalues within the unit circle. Thus, based on (21), the system tracking errors can be convergent stably.

Remark 5. Markov chains are required to be ergodic; therefore it can be ensured that the leader has directed paths to all followers in [G.sup.u]. Certainly, the results can be expanded to the case where all the links are governed by Markov chains; through the mapping in (4), Markovian switching topologies will be addressed finally. From this, large numbers of system modes can be described, and the traditional Markovian switching topologies can be recovered through the adjustment of the links modes and the transition rate matrix. However, it will magnify the calculation load and the unknown or partly unknown transition probability in some scenes will be considered in the future.

Lemma 6 ([16], Lemma 3.5). Let L be defined in Lemma 3. For small enough Tq, [rho](L) < 1, if and only if the leader has directed paths to all followers in the union graph rather than the subgraphs.

Theorem 7. Assume that [[xi].supr](k) satisfies the fact that the changing rate is bounded; thus

[absolute value of [[xi].sup.r] (k) - [[xi].sup.r] (k - 1)/T] [less than or equal to] [bar.[xi]]; (41)

the leader has directed paths to all followers 1 to n + m in the union graph. When Theorem 4 holds, using algorithm (13), if there exist 0 < [mu] < 1 and v [greater than or equal to] 1, the tracking errors of the agents are ultimately mean-square bounded as follows:

2(m + n) T [bar.[xi]] [v/1 - [mu]]. (42)

Proof. It follows from (15) that

[mathematical expression not reproducible]. (43)

Noting that N[X.sup.r](k - 1) is deterministic, based on (41), thus

[mathematical expression not reproducible]. (44)

Based on Lemmas 3.4 and 3.5 and Theorem 3.9 in [28], there exist 0 < [mu] < 1 and v [greater than or equal to] 1, yielding

[mathematical expression not reproducible]. (45)

Noting that 2[square root of (m + n)] T[bar.[xi]] [less than or equal to] 2(m + n)T[bar.[xi]]v, after some manipulation, thus it follows that

[mathematical expression not reproducible]. (46)

Therefore, as k [right arrow] [infinity], it can be obtained that [[parallel][sigma](k)[parallel].sub.E] [less than or equal to] 2(m + n)T[bar.[xi]]v/(1 - [mu]). The same as Theorem 3.2 in [16], the tracking errors will go to zero ultimately as T [right arrow] 0. But for the original interaction topology G, the ultimate mean-square bound is given by 2nT[bar.[xi]]v/(1 - [mu]) through the same method, which is smaller than the union system.

4. Simulation Results

In this section, a simulation example is given to verify the effectiveness of the theoretical results. For brevity, let [mathematical expression not reproducible]. The subgraphs G and [G.sub.2] are shown in Figure 1.

It follows from [G.sup.u] that each Markov chain has two modes, which means [gamma] = 2 and [eta] = [2.sup.3x5+3x4] = [2.sup.27], and the transition rate matrices are considered as in Table 1.

As an example, some modes of the edges are shown in Figure 2.

For the PD-like discrete-time consensus algorithm, the initial states of the agents in G and [G.sub.2] are [mathematical expression not reproducible] also should be defined at the initial time, and let [[xi].sup.r](k) = cos(kT). Distributed controller (13) is implemented with the parameters in the following four cases.

Case 1. T = 0.1, q = 4.

Case 2. T = 0.05, q = 4.

Case 3. T = 0.05, q = 2.

Case 4. T = 0.4, q = 2.

Simulation results are shown in Figures 3-6.

Figure 3 shows the plots of the system states and tracking errors with a time varying reference when T = 0.1, q = 4. Once the two fixed groups are combined at half of the time, all the followers can track the reference finally. More specifically, the system states and tracking errors curves are smooth in the first half of time, but in the rest of time as shown in the partial enlarged details, there are lots of burrs on the plots for all agents obviously, since the links between agents in G and [G.sub.2] are governed by the random Markov chains.

Under the same reference, compared with Figure 3, the system states can track more effectively and the tracking errors are smaller while T = 0.05, q = 4. Furthermore, as shown in Figures 4 and 5, there is a quick response and smaller tracking errors ultimately, along with a bigger control gain q and the same T. But for Figure 6, when T = 0.4, q = 2 in Case 4, the situation is unpredictable, because Tq does not meet the condition of Theorem 4. It can be noted that the tracking errors become unbounded in this case. What should be stressed more is that, based on Theorem 4, the largest value of T^ is approximately equal to 0.44. Otherwise, a quantitative comparison among the four cases is given in Table 2, which shows the mean and standard deviation of the tracking errors in the second half of the time. The comparison results show that the tracking errors depend on T and q obviously.

5. Conclusion

In this paper, distributed discrete-time coordinated tracking control for multiagent systems is investigated to solve the issue on the union graph with Markov chains. Based on a novel mapping, Markovian switching topologies are redesigned through using the Markov chains to the edge set. The PD-like discrete-time consensus algorithm is applied to deal with the time varying reference. A sufficient condition of the match sampling period and a feasible control gain to the time varying reference is obtained in terms of trigonometric function with multiple-term formula. Both the theoretical and simulation results show that the ultimate tracking errors are related to the sampling period. Although we focus on studying the discrete-time multiagent systems with an ideal communication network, an extended analysis may be considered for the case with time delays, which will be addressed in our future work.

https://doi.org/10.1155/2017/1626452

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported by National Natural Science Foundation of China under Grant 61473248 and Natural Science Foundation of Hebei Province under Grant F2016203496.

References

[1] J. Liang, Z. Wang, and X. Liu, "Distributed state estimation for discrete-time sensor networks with randomly varying nonlinearities and missing measurements," IEEE Transactions on Neural Networks and Learning Systems, vol. 22, no. 3, pp. 486-496, 2011.

[2] X. Dong, Y. Zhou, Z. Ren, and Y. Zhong, "Time-Varying Formation Tracking for Second-Order Multi-Agent Systems Subjected to Switching Topologies With Application to Quadrotor Formation Flying," IEEE Transactions on Industrial Electronics, vol. 64, no. 6, pp. 5014-5024, 2017.

[3] Q. Zhang, P. Li, Z. Yang, and Z. Chen, "Adaptive flocking of non-linear multi-agents systems with uncertain parameters," IET Control Theory & Applications, vol. 9, no. 3, pp. 351-357, 2015.

[4] T. Liu and Z.-P. Jiang, "Distributed nonlinear control of mobile autonomous multi-agents," Automatica, vol. 50, no. 4, pp. 10751086, 2014.

[5] S. Su and Z. Lin, "Distributed Consensus Control of Multi-Agent Systems with Higher Order Agent Dynamics and Dynamically Changing Directed Interaction Topologies," IEEE Transactions on Automatic Control, vol. 61, no. 2, pp. 515-519, 2016.

[6] P. Li and K. Qin, "Distributed robust H[infinity] consensus control for uncertain multiagent systems with state and input delays," Mathematical Problems in Engineering, vol. 2017,15 pages, 2017, ID 5091756.

[7] P. Lin, Y. Jia, and L. Li, "Distributed robust H[infinity] consensus control in directed networks of agents with time-delay," Systems & Control Letters, vol. 57, no. 8, pp. 643-653, 2008.

[8] W. He, G. Chen, Q.-L. Han, and F. Qian, "Network-based leader-following consensus of nonlinear multi-agent systems via distributed impulsive control," Information Sciences, vol. 380, pp. 145-158, 2017.

[9] P. Lin, W. Ren, and J. A. Farrell, "Distributed continuous-time optimization: nonuniform gradient gains, finite-time convergence, and convex constraint set," Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 62, no. 5, pp. 2239-2253, 2017.

[10] Y. Cao, W. Ren, and M. Egerstedt, "Distributed containment control with multiple stationary or dynamic leaders in fixed and switching directed networks," Automatica, vol. 48, no. 8, pp. 1586-1597, 2012.

[11] H. Cai and J. Huang, "Leader-following consensus of multiple uncertain Euler-Lagrange systems under switching network topology," International Journal of General Systems, vol. 43, no. 3-4, pp. 294-304, 2014.

[12] Y. Cao, W. Yu, W. Ren, and G. Chen, "An overview of recent progress in the study of distributed multi-agent coordination," IEEE Transactions on Industrial Informatics, vol. 9, no. 1, pp. 427-438, 2013.

[13] Y. Wang and Q. Wu, "Distributed robust H[infinity] consensus for multi-agent systems with nonlinear dynamics and parameter uncertainties," Asian Journal of Control, vol. 17, no. 1, pp. 352-361, 2015.

[14] P. Lin, W. Ren, and H. Gao, "Distributed velocity-constrained consensus of discrete-time multi-agent systems with nonconvex constraints, switching topologies, and delays," IEEE Transactions on Automatic Control, vol. 62, no. 11, pp. 5788-5794, 2017.

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

[16] H. Zhao, W. Ren, D. Yuan, and J. Chen, "Distributed discrete-time coordinated tracking with Markovian switching topologies," Systems and Control Letters, vol. 61, no. 7, pp. 766-772, 2012.

[17] F. Chen, G. Feng, L. Liu, and W. Ren, "Distributed average tracking of networked Euler-Lagrange systems," Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 60, no. 2, pp. 547-552, 2015.

[18] J. Mei, W. Ren, and G. Ma, "Distributed containment control for Lagrangian networks with parametric uncertainties under a directed graph," Automatica, vol. 48, no. 4, pp. 653-659, 2012.

[19] X. Li, H. Wu, and Y. Yang, "Consensus of heterogeneous multiagent systems with arbitrarily bounded communication delay," Mathematical Problems in Engineering, vol. 2017, Article ID 5679073, 6 pages, 2017.

[20] S. Yu and X. Long, "Finite-time consensus for second-order multi-agent systems with disturbances by integral sliding mode," Automatica, vol. 54, pp. 158-165, 2015.

[21] P. Ming, J. Liu, S. Tan, S. Li, L. Shang, and X. Yu, "Consensus stabilization in stochastic multi-agent systems with Markovian switchingtopology, noises and delay," Neurocomputing, vol. 200, pp. 1-10, 2016.

[22] C. Ma, "Finite-time passivity and passification design for markovian jumping systems with mode-dependent time-varying delays," Discrete Dynamics in Nature and Society, vol. 2017, Article ID 3256871, 11 pages, 2017.

[23] D. Xie and Y. Cheng, "Bounded consensus tracking for sampled-data second-order multi-agent systems with fixed and Markovian switching topology," International Journal of Robust and Nonlinear Control, vol. 25, no. 2, pp. 252-268, 2015.

[24] H. Zhao, "Leader-following consensus of data-sampled multi-agent systems with stochastic switching topologies," Neurocomputing, vol. 167, pp. 172-178, 2015.

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

[26] Y. Zhao, G. Guo, and L. Ding, "Guaranteed cost control of mobile sensor networks with Markov switching topologies," ISA Transactions[R], vol. 58, pp. 206-213, 2015.

[27] X. Liu, X. Yu, and H. Xi, "Finite-time synchronization of neutral complex networks with Markovian switching based on pinning controller," Neurocomputing, vol. 153, pp. 148-158, 2015.

[28] O. L. V. Costa, M. D. Fragoso, and R. P. Marques, Discrete-time Markovian Jump Linear Systems, Springer, London, UK, 2005.

Hongbin Wang, Zhen Zhou, and Zhongquan Hu

Key Lab of Industrial Computer Control Engineering ofHebei Province, Yanshan University, Qinhuangdao 066004, China

Correspondence should be addressed to Zhen Zhou; zhouzhen0617@163.com

Received 28 August 2017; Revised 27 November 2017; Accepted 5 December 2017; Published 27 December 2017

Academic Editor: Rigoberto Medina

Caption: Figure 1: Two fixed subgraphs.

Caption: Figure 2: Modes of the edges generated by Markov chains.

Caption: Figure 3: Simulation results in Case 1.

Caption: Figure 4: Simulation results in Case 2.

Caption: Figure 5: Simulation results in Case 3.

Caption: Figure 6: Simulation results in Case 4.

Table 1: Transition rate matrices for Markov chains. Edges ([v.sub.1], [v.sub.5]); ([v.sub.1], [v.sub.6]); ([v.sub.2], [v.sub.7]); ([v.sub.2], [v.sub.6]); ([v.sub.6], [v.sub.3]); ([v.sub.3], [v.sub.6]); ([v.sub.4], [v.sub.5]); ([v.sub.5], [v.sub.4]); ([v.sub.2], [v.sub.6]; ([v.sub.7], [v.sub.4]; Transition [delta] = [0.3 0.7 [delta] = [0.2 0.8 rate matrices 0.4 0.6] 0.4 0.6] Edges ([v.sub.1], [v.sub.7]); ([v.sub.2], [v.sub.5]); ([v.sub.3], [v.sub.5]); ([v.sub.4], [v.sub.6]); ([v.sub.7], [v.sub.3]; Transition [delta] = [0.5 0.5 rate matrices 0.8 0.2] Table 2: Comparison results of the tracking errors among the four cases. Cases Mean Standard deviation Case 1 0.0305 0.1718 Case 2 -0.0163 0.1483 Case 3 -0.0788 0.2349 Case 4 -4.4958 x [10.sup.5] 2.5529 x [10.sup.7]

Printer friendly Cite/link Email Feedback | |

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

Author: | Wang, Hongbin; Zhou, Zhen; Hu, Zhongquan |

Publication: | Discrete Dynamics in Nature and Society |

Date: | Jan 1, 2018 |

Words: | 4550 |

Previous Article: | The Bifurcation of Two Invariant Closed Curves in a Discrete Model. |

Next Article: | The Dynamical Modeling Analysis of the Spreading of Passive Worms in P2P Networks. |

Topics: |