{'fraction_non_alphanumeric': 0.030870737815449818, 'fraction_numerical': 0.012810633789250627, 'mean_word_length': 4.821418559013177, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 7, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Guaranteed cost synchronization for second-order discrete-time multi-node networks with switching transmission topologies and cost limitations

The guaranteed cost synchronization control for discrete-time second-order leader-following multi-node networks with varying transmission topologies and cost limitations is investigated. First, the control law and its cost function are proposed to balance the tradeoff between the synchronization regulation and the control cost. Then, we derive the sufficient conditions without cost limitations to achieve guaranteed cost synchronization with varying transmission topologies, where the dimensions of matrix variables do not rely on the number of nodes. In addition, we calculate an upper bound on the cost consumption index, which is a function of the initial conditions. Moreover, guaranteed cost synchronization criteria are formulated for control with cost limitations, which are involved by establishing the relation between the cost limitation and the upper bound on the cost consumption index. Numerical simulation experiments were conducted to validate the theoretical results.


Introduction
As a basic problem in multi-node networks (MNNs), synchronization has received increasing attention mostly by its potential to handle problems such as multi-vehicle formation control, 1-3 design of sensor networks, [4][5][6][7] and rendezvous problems. [8][9][10] Various node synchronization problems in MNNs have been addressed considering first-and second-order dynamics, where the transmission topology can be either leaderless or leader-following. In leaderfollowing MNNs, the leader guides the motion of the whole network, and the followers should converge to the states of the leader by sharing information among nodes to realize synchronization control. To this end, a control law should be devised for all the followers to agree with the leader in some states as time proceeds.
Various studies have considered continuous-time nodes with first-and second-order dynamics. [11][12][13][14] In Qin et al., 13 a sampled-data synchronization strategy was adopted for nodes modeled by double-integrator dynamics with both fixed and dynamic transmission topologies. In Xiao et al., 14 partial state synchronization problems were addressed for second-order MNNs, and an asynchronous distributed synchronization protocol with intermittent information transmission was proposed. Compared with the continuous-time approaches, the discrete control results may apply to more practical conditions; thus, the discrete control method should be studied further. In Qin et al., 15 You and Xie 16 and Hengster-Movric et al., 17 synchronization strategies for a number of nodes equipped with second-order discrete-time dynamics were introduced. In Li et al., 18 synchronization control for discrete-time leader-following MNNs was addressed considering a directed fixed topology and a limited transmission rate. Likewise, synchronization control problems of discretetime MNNs were discussed considering the influence of time delays. [19][20][21] In MNNs, the transmission topology usually varies due to link failures or other reasons. Therefore, switching transmission topologies should be handled for discrete-time WNN synchronization to optimize the performance of the whole network.
Most existing studies focus on synchronization problems for MNNs. However, the limited resources in real implementations should be considered while optimizing synchronization in MNNs. In Liu et al., 20 an optimal synchronization strategy was proposed for continuous-and discrete-time models with singleintegrator dynamics. In Wang et al., 21 an optimal control algorithm based on minimization of an individual cost function by local states was proposed. In Guan et al., 22 Cheng and Ugrinovskii, 23 and Yu et al., 24 guaranteed performance synchronization for MNNs was addressed, but the control consumption cost was disregarded. Moreover, the synchronization performance index was not jointly considered with the control consumption cost for the synchronization strategies. [22][23][24][25] Although guaranteed cost control problems were addressed for discrete-time isolated systems, 26-28 these approaches cannot be directly used for guaranteed cost synchronization in MNNs. This problem was addressed in Xu et al., 29 where robust discrete-time guaranteed cost synchronization control for linear high-order MNNs containing time-varying delays was studied. Likewise, synchronization of guaranteed cost control for MNNs with parameter uncertainties was investigated in Ren and Zhang. 30 Although control consumption cost and synchronization regulation performance were considered, [31][32][33][34][35][36] these studies neglected the overall cost limitations in MNNs.
In this paper, we investigate the guaranteed cost synchronization control for leader-following discrete-time second-order MNNs with varying transmission topologies. On the basis of the relative states between nodes, the synchronization control law with the cost consumption index function and varying topologies are constructed. Using the characteristic of the orthonormal matrix, the dynamics of the state errors between the nodes are modeled. For discrete-time MNN synchronization without cost limitations, a new design approach using lemmas is proposed to design the control parameters of gain matrices, and sufficient conditions are derived. Furthermore, an upper bound on the cost consumption index is computed according to the initial state of the proposed Lyapunov function candidate. For discrete-time MNN synchronization with cost limitations, guaranteed cost synchronization sufficient criteria are derived, in which we determine the control parameters that relate the cost limitations and the upper bound on the cost function.
Compared with existing studies on MNN synchronization, we provide various contributions from our study. First, a guaranteed cost synchronization control law and a cost consumption index function are presented for discrete-time MNN with varying transmission topologies, where the tradeoff between synchronization regulation performance and control consumption cost is considered. Most existing studies have only addressed guaranteed performance control without control cost optimization for discrete-time MNNs. 24,25 Second, the impacts of cost limitations on synchronization criteria are considered to redefine the sufficient conditions with the additional constraints, which means that the whole cost consumption for discrete-time MNNs can be constrained and it is applicable in practice. In Zhou et al. 34 and Wang et al., 35 a different upper bound on the cost consumption index was reported, and the discrete-time MNNs did not consider cost limitations in those studies.
The remainder of the study is organized as follows. The second section describes the preliminaries and problem description used in this study. In the third section, we state the sufficient conditions of guaranteed cost synchronization for discrete-time MNNs without cost limitations, derive the explicit upper bound on the cost function, and finally extend the synchronization criteria to include cost limitations. In the forth section, it reports numerical simulation examples and their results as the effectiveness evidence for the proposed methods. Finally, we draw conclusions in the fifth section.
Notations: We use the following general notations throughout this study. R k is the k-dimensional Euclidean space of nodes, and R k3g is used to describe k3g-dimensional matrices over real field. Value 0 represents both the scalar zero and a column vector of zeroes with appropriate dimensions. I m represents the m-dimensional identity matrix. Z T = Z . 0 and Z T = Z \ 0 denote symmetric matrix Z being positive and negative definite, respectively. diag u 1 , u 2 , Á Á Á , u N f g denotes a diagonal matrix with elements u 1 , u 2 , Á Á Á , u N along the diagonal. Symbol Ã in a matrix indicates a symmetric element.

Preliminaries and problem description
For the following analysis, we first introduce the model of the topology graph and the graph theory notation. Problem descriptions are then provided.

Graph model of transmission topology
A second-order leader-following MNN consists of N nodes, which can be represented as weighted graph G: gis a limited collection of vertices and E(G) V(G)3V(G) is a nonempty collection of edges in graph G: All vertices belong to a finite index set v = 1, 2, Á Á Á , N f g : An edge of the MNN is denoted by e ij = (v i , v j ), which means there is a transmission channel from v i to v j , and v j is the neighbor of v i . In addition, the coupling weight of edge i2N j a ji and l ji =À a ji j 6 ¼ i ð Þ: Graph G has a directed spanning tree, whose root vertex is connected to all the other vertices via paths. We suppose that there exists a spanning tree in the entire topology of the second-order MNN and designate the root vertex as the leader. The transmission states of the leader are independent, whereas those of the followers are influenced by the states of the leader and some neighbors, and the local transmission topology among other neighbors is undirected. More details on related concepts of graph theory can be found in Godsil and Royal. 37 In order to prove obtained results, the lemmas stated below are crucial for us. 38 there exists a positive matrix P 2 R m3m satisfying A T PA À P + T \ 0 if and only if there exists a matrix X . 0 such that Lemma 2. Let P and H be real symmetric matrices with H being invertible. 39 Then,

Problem description
Let a second-order discrete-time MNN consist of a group of N linear identical nodes, which are modeled as vertices in transmission topology graph G: Root node 1 is represented as a leader, and the others correspond to N À 1 followers. A discrete-time dynamic description of the j th node is given by where x j (r) 2 R is the queue length, v j (r) 2 R is the transmission rate, and u j (r) 2 R is the coupling input for j = 1, 2, Á Á Á , N: Update instant r takes values r = 0, 1, Á Á Á : Assume that the states of the leader remain fixed and u 1 r ð Þ[0: Let all possible transmission topologies be described by set P = G 1 , G 2 , Á Á Á , G M g f with finite index set I M = 1,2, Á Á Á , Mg f and q(r) : 0, 1, Á Á Á ½ Þ!I M denote a switching signal. In addition, assume that switching instants satisfy t d À t dÀ1 5T d for switching instant t d (d = 1, 2, Á Á Á ) and dwell time T d . 0: To obtain guaranteed cost synchronization for the second-order MNN represented by (1), we construct a distributed neighborbased synchronization law: where § 1 , § 2 2 R . 0 and j 2 R . 0 are available, k 1 . 0 and k 2 . 0 are control parameters, j = 2, 3, Á Á Á , N, N q(r), j corresponds to the neighbor set of node j at instant r, and Note that a q(r), ji appears in the synchronization control law given by (2), and hence data can be exchanged among nodes and local neighboring nodes. Therefore, J u (r) and J x (r) can be designed using the control inputs and relative state information, respectively. In addition, J u (r) and J x (r) can correspond to the overall consumption cost containing both the control effort consumption and synchronization regulation performance for a leader-following MNN in practice.
Considering the necessity of MNN guaranteed cost synchronization, we choose positive constant parameters § 1 , § 2 , and j to balance the tradeoff, in which the consumption cost of the nodes can be reduced, and the synchronization performance can be optimized. Moreover, considering that nodes have limited cost budgets in practice, we set the total cost limitation as a constraint when calculating the control law parameters for guaranteed cost synchronization.
Let J Ã F . 0 be the total cost limitation of the MNN represented by (1). Guaranteed cost synchronization is defined as follows for this discrete-time leader-following MNN with switching transmission topologies and cost limitations. Definition 1. For any given J Ã F . 0, the discrete-time leader-following MNN represented by (1) achieves guaranteed cost synchronization by the control law in (2) if there exist control parameters k 1 and k 2 such that F for any bounded disagreement initial conditions x j (0) and v j (0)(j = 2, 3, Á Á Á , N): We focus on the effect of switching transmission topologies and cost limitations on guaranteed cost synchronization of the discrete-time MNN represented by (1).

Remark 1
In comparison with the guaranteed cost synchronization laws in Ren and Zhang 30 and Xi et al., 32,33 two key aspects can be highlighted from the synchronization law in (2). First, the relative states between nodes instead of the node states are used to construct the synchronization control law. This is because the node states may not converge to zero, but it is noted that the state errors among nodes converge to zero. Moreover, the cost consumption index function upper bound is more difficult to calculate, because it involves the node state errors and discrete-time control parameters. Second, the cost limitations are considered, which means that the whole cost supply is limited and modeled as the constrained conditions. Thus, the sufficient conditions should reflect the coupling relations between the upper bound on the cost consumption index function and the cost limitations, where the real consumption cost must be lower than the cost limitations.

Guaranteed cost synchronization for MNNs
We address the cases without and with cost limitations for second-order discrete-time MNNs with switching transmission topologies. Without cost limitations, we derive the sufficient condition to solve the control parameters for the guaranteed cost synchronization and calculate a cost consumption index function upper bound that reflects both the control effort consumption and the synchronization performance regulation. We also provide a sufficient condition when considering the cost limitations.

Remark 2
When analyzing the synchronization conditions, we use Lyapunov stability theory and supporting lemmas. The variables are transformed by an orthonormal matrix W q(r) : Based on the preliminary conditions of discretetime control, it may be complex to determine the control parameters given as the irregular matrix form. Nevertheless, the introduced lemma allows to transform the irregular matrix into a regular form and then obtain the control parameters by linear matrix inequalities. Then, the synchronization conditions in terms of these inequalities can be obtained for the MNN represented by (1) with switching transmission topologies. In this case, when the MNN achieves guaranteed cost synchronization, the initial state value of the Lyapunov function candidate can serve as a specified upper bound on the cost consumption index function. It should be noted that according to the convexity of linear matrix inequalities, the sufficient conditions depend on nonzero eigenvaluesl 2 andl N . Hence, the dimensions of the matrix variables do not rely on the quantity of nodes. To reduce the computational load, we can computel 2 andl N using the methods in Horn and Johnson. 40 Moreover, we do not need to estimate all nonzero eigenvalues of the switching transmission topologies.
Considering the cost limitations, we prove the existence of control parameters in Theorem 2.
Theorem 2. For any given J Ã F . 0, the discrete-time leader-following MNN represented by (1) achieves guaranteed cost synchronization by the control law in (2) if there exist matrix W . 0 and matrix X = X T . 0 such that , and P = X À1 : In this case, K = k 1 , k 2 ½ = WX À1 : Proof: Given control input u j (r), by (7)-(9), we have For r = 0, we obtain Using the proof of Theorem 1, we obtain That is, V(0) is a specified upper bound on the cost consumption index function. By (21) and (22), As a result, the discrete-time leader-following MNN represented by (1) allows to reach the guaranteed cost synchronization with cost limitations, completing the proof.

Remark 3
By the discrete-time control law in (2), the node dynamics can be represented using (6). By the Lyapunov stability theory and supporting lemmas, the sufficient conditions with regard to linear matrix inequalities can ensure that matrixÕ j in Theorem 1 is negative and ensure the guaranteed cost synchronization. In addition, an explicit upper bound on the cost consumption index function can be calculated as a function of the initial state errors and control parameters. We introduce cost limitations in Theorem 2 to obtain the sufficient conditions that can be applied in practice. With the upper bound on the cost consumption index function, we can show that J F 4V(0)4J Ã F can ensure a limited cost satisfying the consumption cost. Then, the coupling correlation between the cost consumption index function upper bound value and the cost limitations can be established. Hence, the sufficient conditions can ensure that the cost function remains below the constraint values. Moreover, the additional factors are still relevant to eigenvaluesl 2 andl N , and thus no more eigenvalues should be calculated, maintaining the computational load from the case without cost limitations.

Numerical simulation
We verify the effectiveness of the proposed synchronization control method through simulations. We consider a two-dimensional MNN with six nodes labeled from 1 to 6. We set node 1 as the leader and the others correspond to five followers. The dynamics of all nodes are determined by (1). In addition, we consider the switching transmission topologies shown in Figure 1 and the switching sequences of topologies are shown in Figure 2. We assume that all edge weights are 1 and the adjacency matrices are 0-1 matrices. Then, the minimum nonzero and maximum eigenvalues of all the corresponding Laplacian matrices arel 2 = 0:4038 andl 6 = 4:2631, respectively. Moreover, we evaluate the following initial states for the nodes: For the cost function in (2), we set constant parameters j = 9:11, § 1 = 9:02, and § 2 = 9:01. From Theorem 2, we obtain k 1 = 0:12 and k 2 = 0:15: Moreover, the cost limitation is J Ã F = 24000, which is an upper bound value on the cost consumption index function in (2) and includes both the control effort consumption and the synchronization regulation performance. Figures 3 and 4 show state error trajectories of Dx i (r) and Dv i (r) i = 2, 3, Á Á Á , 6 ð Þ of the MNN. Figures 5 and 6 show state trajectories of x i (r) and v i (r) i = 1, 2, Á Á Á , 6 ð Þof the MNN. Figure 7 shows the trajectories of cost limitation J Ã F and linear quadratic cost consumption J F : From these figures, two state error trajectories of all nodes converge to zero and J F 4J Ã F , where the discrete-time MNN achieves leaderfollowing guaranteed cost synchronization with varying transmission topologies and cost limitations.   limitations. In the existing literature, 35 authors investigated the continuous-time guaranteed cost synchronization problem, where the control effort was evaluated and an upper bound of the cost function was presented. Distinguished from Wang et al., 35 this study can achieve the discrete-time guaranteed cost synchronization

Conclusion
For a discrete-time leader-following MNN with switching transmission topologies, we proposed a guaranteed cost synchronization control law with a cost consumption index function. The tradeoff between synchronization regulation performance and control consumption cost was balanced. In addition, Lyapunov stability theory and supporting lemmas were allowed to derive the sufficient conditions without cost limitations with regard to linear matrix inequalities, where the dimensions of the matrix variables did not rely on the quantity of nodes. Moreover, we determined a specified upper bound on the cost function, which is related to the initial relative states and control parameters. Then, we extended the leader-following guaranteed cost synchronization to include cost limitations, where the coupling relation between the cost limitation and the upper bound on the cost consumption index function was considered. The resulting criteria to achieve guaranteed cost synchronization only required checking whether the matrix variations were negative. Especially, further works mainly focus on designing the synchronization control law for the discrete-time leader-following MNN with jointly connected transmission topologies. It should also be mentioned that some new synchronization control approaches are required to solve these problems.

Declaration of conflicting interests
The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.