Journal of Control Science and Engineering

Volume 2017 (2017), Article ID 3949428, 8 pages

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

## Synchronization of Coupled Harmonic Oscillators Using Quantized Sampled Position Data

The School of Resources and Environment, North China University of Water Resource and Electric Power, Zhengzhou 450045, China

Correspondence should be addressed to Xinjing Wang; moc.361@888gnijnixgnaw

Received 27 February 2017; Revised 25 April 2017; Accepted 29 May 2017; Published 3 July 2017

Academic Editor: Wenwu Yu

Copyright © 2017 Xinjing Wang and Peipei He. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

For coupled harmonic oscillators (CHO), the paper studies the synchronization problem by using the quantized current sampled position data. The logarithmic quantizer is adopted here to quantize the information transmitted; thus the quantization error of the sampled position data can be illustrated as the uncertainty according to the sector bound property. On the basis of that, the synchronization problem is converted into the asymptotical stability of the subsystems and even the solving problem of characteristic equation. Some sufficient conditions ensuring the synchronization of CHO are obtained relating to coupling strength, sampling period, and quantizer parameter. The usefulness of the theoretical result is shown by an example at the end.

#### 1. Introduction

Recently, as a special multiagent system, CHO has gotten much attention. By assuming that the undirected network is not connectivity, literature [1] shows that the CHO is also able to achieve synchronization. When the CHO is affected by controller loss and communication time-delays, an algorithm is proposed in [2] to ensure the synchronization of the system and a brief procedure of the convergence analysis for such algorithm is given. By using some special analysis tools, literature [3] shows that the CHO can be synchronized under the conditions of mild connectivity for the directed graph. A frequency dependent topology condition is given in [4] to synchronize the CHO. With the measurement noise, literature [5] gives an effective algorithm and the convergence analysis of the CHO for the directed network topologies with or without leaders. A sufficient condition for the synchronized oscillatory motions of CHO is given by the influence of noise for the strongly connected directed graph.

The control algorithms proposed in the above literature use both velocity information and position information. In some cases, each oscillator exchanges just the velocity information or the position information with its neighbors. The relating papers which design control algorithms just use velocity information or position information include [6–9]. Assuming that the network is connected, the sufficient conditions are given for the synchronized oscillatory motions by just using velocity information in brief [6]. The results of [6] are generalized to the sampled-data CHO affected by input signals loss in [7]. Literature [8] proposes a distributed control method just using the outdated position states. For both positive and negative coupling strengths, it derives some necessary and sufficient conditions (NSCs) for the synchronization of CHO. In [9], by adopting current and outdated position data, respectively, two distributed protocols are adopted for the synchronization of CHO.

On the other hand, as an important issue, data quantization has received extensive attention in multiagent systems. Theoretical results in the past two years include [10–16]. The consensus of multiagent systems is studied according to the robust learning control approach in [10]. For the undirected connected graphs, literature [11] obtains some strong results for the problem of expected time to convergence for quantized consensus. Under the influence of quantized input and disturbances, the distributed quantized consensus is investigated in [12]. For the high-order multiagent systems, the quantized consensus is studied in [13], in which it assumed that only the first state can be measured. By adopting both uniform and logarithmic quantizers, some quantized consensus results are achieved for heterogeneous systems in [14]. By using probabilistic versus deterministic quantizers, the quantized consensus problem for multiagent systems is studied in [15]. Moreover, event-triggered consensus [16], averaging consensus [17], consensus tracking [18], metropolis consensus [19], containment control [20], and other consensus problems [21–23] affected by data quantization are discussed in recent papers.

Summarized above, the synchronization of CHO and quantized consensus for the general multiagent systems have received enough attention, respectively. However, there are few results relating to the synchronization of CHO affected by data quantization, which is the problem studied in our paper. In fact, this paper’s main contribution is to extend the results of literature [9] to the synchronization problem for CHO by using the quantized position data. By adopting the logarithmic quantizer, the quantization error of the sampled position data can be illustrated as the uncertainty according to the sector bound property. With this setup, some sufficient conditions relating to coupling strength, sampling period, and quantizer parameter are obtained for synchronized CHO.

The organizational structure of the paper is as follows. Section 2 demonstrates the problem discussed and the CHO network; distributed protocol and logarithmic quantizer are illustrated there in detail. Some sufficient conditions for synchronization of CHO and the detailed proving process are shown in Section 3. The usefulness of the theoretical results is illustrated by a simulation example in Section 4. Section 5 gives some conclusions.

*Notation.* The -dimensional Euclidean space is denoted by . () indicates the positive integers (real numbers) set. We denote by the module of complex number . and are the inverse and the transpose of matrix , respectively. and denote the vectors with dimension whose elements are all zeros or ones, respectively. For a multiagent system, especially for CHO, information exchange between agents can be modeled by a network or graph [24]. Let graph be with node set and edge set . If there exists at least one node having a directed path to every other node, the digraph is called containing a directed spanning tree (DST). The adjacency matrix satisfies if and if . is a set including all the neighbor nodes of node . We use to denote the Laplacian matrix, whose elements satisfy and [25]. represent the eigenvalues of when the digraph contains a DST. indicates the diagonal matrix with diagonal elements .

#### 2. Problem Formulation

For continuous-time CHO, we illustrate the synchronization problem and protocol by using the quantized sampled position data in this section.

For a positive constant , the synchronization problem of the following CHO network composed by nodes is discussed:with position states , velocity states , and control input for node .

Assuming that the information between nodes is transmitted over the network, then it must be quantized before transmission. A protocol using the quantized value of the current relative sampled position data is adopted in this paper:in which coupling strength is to be designed and , denote the sampled position at time instants , with . The quantizer used here is a general logarithmic one defined as [26, 27] for any , with , , and .

The aim of our paper is designing suitable and such that the CHO (1) under the control input (2) achieves synchronization; that is,for any .

#### 3. The Sufficient Conditions for Synchronization

For CHO (1) with protocol (2), the synchronization problem is studied in this section. The sufficient conditions for synchronization are pursued on the basis of the following two lemmas.

Lemma 1 (see [28]). *The fact that the graph contains a DST is equal to the fact that the matrix has a simple zero eigenvalue and other eigenvalues having positive real parts. Furthermore, is the right eigenvector relating to zero eigenvalue of . Moreover, we can always get a suitable , which is left eigenvector relating to zero eigenvalue of , satisfying and .*

Lemma 2 (see [29]). *Let be a complex-coefficient polynomial with real constants , and , and then the asymptotical stability of is equivalent to and .*

By using the above lemmas, the following theorem is given to discuss the synchronization of CHO (1) under protocol (2), which is the main result of this paper.

Theorem 3. *If the graph contains a DST and the initial states satisfy with defined in Lemma 1, then network (1) under protocol (2) can achieve synchronization if and are selected satisfyingwhere and are, respectively, the nonzero eigenvalues of and with , , , for any , and for any with , and , in which denote possible values for , defined by (10). Moreover, let and , and we obtainfor all .*

*Proof. *By the property of logarithmic quantizer, we get with , . For any , let and ; then network (1) under protocol (2) can be rewritten aswhere , and .

For the matrix , the following claim holds by Lemma 1.*Claim*. If the graph contains a DST, then the matrix , has a simple zero eigenvalue and other eigenvalues having positive real parts. Furthermore, and defined in Lemma 1 are the right eigenvector and left eigenvector, respectively, relating to zero eigenvalue of .

Based on the above claim, for any , there must exist matrices and with and such thatwith Jordan canonical form and block upper triangular matrix represented asin which satisfying are the nonzero eigenvalues of , and is equal to or .

Let and , and then (8) gives thatindicatingfor any , with .

Next, we will verify that the asymptotic stability of subsystem (12b) is equivalent to the synchronization of (8) if the initial states satisfy . On one hand, if , combining with and gives . Moreover, by defining the equalities and tell us thatfor any . Thus we get which means that the synchronization of (8) is guaranteed with synchronization state . On the other hand, if the synchronization of (8) is ensured, by letting the synchronization state as , we will show . In fact, it holds that according to . Based on , we get . Combined with (14), it gives , and thus . Taking , into consideration, we get , which ensures the asymptotic stability of subsystem (12b).

By the claim above and (10), we know that the asymptotic stability of (12b) is equal to that of the following subsystems: the solution of which is as for any , where Let ; then equality (16) gives for any .

The boundedness of results in that tends to if . Denoting the possible values for by , then is ensured by which is equal to the fact that the following equation’s solutions satisfy :If we set , characteristic equation (19) is rewritten asfor any , . According to the property of bilinear transformation, achieves if and only if . Moreover, if we define and denote the nonzero eigenvalues of and as and , respectively, according to the relationship between the eigenvalues and the parameters , we get which ensures that , if (5a) is satisfied. Combining with (5b) gives that equality (20) can be transferred into, , Considering , Lemma 2 tells us that the roots of (22) located in the left-half plane are equal to wherefor all , . Recalling (5a), we have that condition (23) is equivalent to which is guaranteed by Based on the relationship between the eigenvalues and the parameters and inequality (21), we know that with .

Moreover, (26) gives indicating and . By defining we get that (24) holds if with defined by . Therefore, if (5a) and (5b) are satisfied, we obtain that the roots of (20) hold negative real part if (5c) and (5d) hold which means that , where denotes the eigenvalues of . Thus is guaranteed which gives indicating . Up to now, it shows that the synchronization of network (1) under protocol (2) is obtained when (5a), (5b), (5c), and (5d) are satisfied. This completes the proof.

*Remark 4. *In this paper, the constraint on the initial state, , is a necessary condition to ensure the synchronization of (8) according to , in which and are different from each other. How to relax the constraint on the initial state is one of our further research directions, which will need completely different proof line.

*Remark 5. *When we design parameters based on the above theorem, it is obvious that the difficulty lies in ascertaining the value of . In fact, it can always increase or decrease the value of to study the proportional relationship between and and thus determine the value of and the feasible interval for .

*Remark 6. *It is worth mentioning that the synchronization expression of CHO (1) under protocol (2) is the same as the one under protocol [9] where the current relative sampled position data has not been quantized. This is due to the fact that defined in (13), which determines the synchronization state, is not influenced by quantization.

#### 4. Simulation

A simulation example is given in this section to show the usefulness of the result. The CHO network composed of four nodes and the adjacency matrix is given as Select parameters as , and satisfying Based on and [9]we know by setting . Selecting and the initial states as satisfying with , the synchronization states can be shown in Figure 1, from which we see that the CHO network reaches synchronization. If the initial state is set as which violates , Figure 2 shows that the synchronization errors do not tend to zeros, which means that the synchronization for CHO network is not reached.