Mathematical Problems in Engineering

Volume 2013 (2013), Article ID 854960, 7 pages

http://dx.doi.org/10.1155/2013/854960

## Collaboration Control of Fractional-Order Multiagent Systems with Sampling Delay

^{1}School of Information and Electrical Engineering, Ludong University, Yantai 264025, China^{2}National Key Laboratory on Aircraft Control Technology, Beihang University, Beijing 100191, China

Received 2 February 2013; Accepted 16 April 2013

Academic Editor: Yang Yi

Copyright © 2013 Hong-yong Yang et al. 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

Because of the complexity of the practical environments, many distributed multiagent systems cannot be illustrated with the integer-order dynamics and can only be described with the fractional-order dynamics. In this paper, collaboration control problems of continuous-time networked fractional-order multiagent systems via sampled control and sampling delay are investigated. Firstly, the sampled-data control of multiagent systems with fractional-order derivative operator is analyzed in a directed weighted network ignoring sampling delay. Then, the collaborative control of fractional-order multiagent systems with sampled data and sampling delay is studied in a directed and symmetrical network. Many sufficient conditions for reaching consensus with sampled data and sampling delay are obtained. Some numerical simulations are presented to illustrate the utility of our theoretical results.

#### 1. Introduction

In recent years, consensus problems in distributed networked multiagent systems have attracted increasing attention of more and more researches including control theory, mathematics, biology, physics, computer science, and robotics. The applications of multiagent systems are extensive, ranging from multiple space-craft alignment, heading direction in flocking behavior, distributed computation, and rendezvous of multiple vehicles. Based on certain quantities of interest, collaboration control problems of agent systems have been studied by many researchers and many important results have been achieved in much literature [1–8].

With the development of digital sensors and controllers, in many cases that the system itself is a continuous process, the synthesis of control law can only use the data sampled at the discrete sampling instants. Compare to continuous-time systems with continuous-time controller, continuous-time systems via sampled control have many advantages, such as flexibility, robustness, and low cost. Therefore, sampled control for continuous-time system is more coincident with applications in our real life. Robots, vehicles, airplanes, satellites, and almost all of the modern artificial products are controlled by digital controller where continuous signals are transferred into discrete ones. For consensus problems of continuous-time multiagent systems via sampled control, some interesting results about consensus problem for multiagent system have been reported [9–15]. However, in the many real applications, we always want to find how large the sampling period should be chosen to guarantee that the system runs well. This requires us to look for an upper bound of sampling period. Moreover, sampling delay of the system cannot be ignored and sometimes may play a key role in the stability analysis of the networks. Therefore, we will also study the case when sampling delay exists.

The important results of the above literature focus the consensus problems of multiagent systems with integer-order dynamical equation. In the complex environment, many phenomena cannot be explained by the framework of integer-order dynamics, for example, the synchronized motion of agents in complex environments such as macromolecule fluids and porous media [16–18]. Under these circumstances, many dynamic characteristics of natural phenomena can only be described in the dynamics of fractional-order (noninteger order) behavior, for example: flocking movement and food searching by means of the individual secretions and microbial, submarine underwater robots in the bottom of the sea with a large number of microorganisms and viscous substances, unmanned aerial vehicles running in the complex space environment [19, 20]. Cao et al. [21, 22] studied distribution coordination of multiagent systems with fractional-order dynamics firstly and gave the relationship between the number of individuals and the fractional order in the stable multiagent systems. However, to the best of our knowledge, there are few researches done on the coordination control of fractional-order multiagent systems via sampled data.

In this paper, we investigate the consensus of fractional-order multiagent systems (FOMAS) with sampled-data control. Because few methods are presented to analyze the fractional-order systems with sampling delay, the problems of the fractional-order systems with sampling delay and sampled data will become more difficult. The main innovation of this paper lies in the study on the distributed coordination of FOMAS with sampled data and sampling delay. The rest of the paper is organized as follows. In Section 2, we recall some basic definitions about fractional calculus. In Section 3, some preliminaries about graph theory, fractional-order coordination model of multiagent systems are shown out. A distributed coordination algorithm for FOMAS with sampled data control is studied in Section 4. Section 5 presents the consensus of FOMAS with sampled data and sampling delay. In Section 6, numerical examples are simulated to verify the theoretical analysis. Conclusions are finally drawn in Section 7.

#### 2. Fractional Calculus

Fractional derivatives provide an excellent instrument to describe the memory and hereditary features of various materials and processes. Fractional calculus also appears in the control of dynamical systems, when the controlled system and the controller are described by a fractional-order differential equation. This is the main advantage of fractional derivatives in comparison with classical integer-order models, in which such effects are in fact neglected. The advantages of fractional-order derivatives become evident in modeling mechanical and electrical characteristics of real materials, as well as in many fields to describe the rheological properties of rocks.

Fractional operator plays an important role in modern science, which is used as a generalization of integration and differentiation with noninteger order fundamental operator , where a and t are the limits of the operation and . The continuous integrodifferential operator is defined as

Three definitions most frequently used for the general fractional operators are the Grünwald-Letnikov (GL) definition, the Riemann-Liouville (RL), and the Caputo definition [16–18]. The GL definition is given by where means the integer part, and is fractional binomial coefficients. The RL definition is given as for and where is the Gamma function. The Caputo definition can be written as The initial conditions for the fractional order differential equations with the Caputo derivatives are in the same form as that for the integer-order differential equations. In this paper, a simple notation is used to replace .

#### 3. Problem Statement

Assume that multiagent system consists of autonomous agents then connected relations between the agents constitute a network topology . Assume represents a directed weighted graph, in which represents a collection of nodes, and its set of edges is . The node indexes belong to a finite index set , with adjacency matrix with weighted adjacency elements . An edge of the weighted diagraph is denoted by . We assume that the adjacency element when ; otherwise, . The set of neighbors of a node is denoted by .

Let be a weighted digraph without self-loops, that is, let , and matrix be the diagonal matrix with the diagonal elements representing the sum of the elements in the th row of matrix . The Laplacian matrix of the weighted digraph is defined as . For two nodes and , there is subscript set satisfying , and then there is a directed linked path between node and node which is used for the information transmission, also we can say that node can receive the information from node . If node can find a path to reach any node of the graph, then node is globally reachable from every other node in the digraph. In this paper, the directed graph and directed symmetrical graph for fractional-order multiagent systems will be considered.

Lemma 1 (see [5]). * is a simple eigenvalue of Laplacian matrix , and is corresponding right eigenvector, that is, , if and only if the digraph has a globally reachable node.*

Given that the dynamics of multiagent systems indicated with fractional derivative in the complex environments, the fractional dynamical equations are defined as where and represent the th agent’s state and control input, respectively, and represents the order fractional derivative. Assume that the following control protocols are used in multiagent systems: where represents the elements of adjacency matrix , is control gain, and represents the neighbors collection of the th agent.

Suppose that for any initial value of the system, the states of autonomous agents meet , for , , and then multiagent systems asymptotically reach consensus.

#### 4. Sampled Control of FOMAS

Suppose that the sampling period is ; then the discrete-time dynamics of multiagent systems with fractional derivative can be rewritten as we have where , , and is a unit matrix with -dimensions. If the norm of matrix is satisfying , the fractional-order discrete-time multiagent system (8) will asymptotically reach consensus.

Theorem 2. *Suppose that multiagent systems are composed of independent agents, whose connection network topology is directed, and there is a global reachable node. Then fractional-order multiagent system (7) with sampled data can asymptotically reach consensus, if and
**
where is the eigenvalue of the Laplacian matrix .*

* Proof. *Since the spectral radius of the matrix is satisfying , we will require the spectral radius . By the definition where is the characteristic value of the matrix , we should calculate the characteristic value of the matrix with .

For any matrix , there exists a unitary matrix satisfying
where conjugate matrix , is an upper triangular matrix, and its diagonal elements are the eigenvalues of matrix . From , we can obtain the characteristic values of matrix being
Suppose that the connection network topology of FOMAS is directed, and there is a global reachable node; then and is a single eigenvalue of Laplacian matrix . Suppose , we have . From the stability requirement of the system (7), we obtain .

For other characteristic values of Laplacian matrix with , the corresponding characteristic values of matrix are being , . Let (where is complex number unit), and then the corresponding characteristic values, for , are

From , we can obtain
It has

Then, the condition of the fractional-order multiagent system (7) is obtained. The proof is finished.

Corollary 3. *Suppose that multiagent systems are composed of independent agents, whose connection network topology is directed and symmetrical, and there is a global reachable node. Then FOMAS (7) can asymptotically reach consensus via sampled data, if and
**
where is the maximum eigenvalue of the Laplacian matrix .*

Corollary 4. *Suppose multiagent systems are composed of independent agents, whose connection network topology is directed and symmetrical, and there is a global reachable node. Then multiagent system (7) with can asymptotically reach consensus via sampled data, if
**
where is the maximum eigenvalue of the Laplacian matrix .*

*Remark 5. *The system of Corollary 4 for fractional-order becomes the first-order multiagent system. The consensus condition obtained in Corollary 4 is same as that in [9].

#### 5. Consensus of FOMAS with Sampled Data and Sampling Delay

In the practical application, the sampled-data transferring will result in the communication delays. The sampling delays will affect the control features of the system and sometimes may play a key role in the stability analysis of the network. In this section, we will study the consensus of multiagent systems with sampled data and sampling delay.

Suppose that land the sampling period is , the sampling delay is . The sampled control protocols are used in multiagent systems as follows:

Based on (7) and (17), the dynamics of FOMAS with sampled data and sampling delay can be rewritten as where and is a unit matrix with -dimensions. If the norm of matrix is satisfying , the discrete-time FOMAS (18) will asymptotically reach consensus.

Lemma 6 (see [23, Hermite-Biehler Theorem]). *Suppose the polynomial
**
Substituting into the polynomial yields
**
Then, the polynomial is Hurwitz stability if and only if the related pair and is interlaced, and .*

Theorem 7. *Suppose that multiagent systems are composed of independent agents, whose connection network topology is directed and symmetrical, and there is a global reachable node. Then FOMAS (18) with sampled data and sampling delay can asymptotically reach consensus, if and
**
where is the maximum eigenvalue of the Laplacian matrix .*

* Proof. *In order to prove the asymptotical consensus of discrete-time systems (18), the spectral radius of the matrix should be satisfied with . Since where is the characteristic value of the matrix , we should calculate the characteristic value of the matrix with .

Suppose that the network topology of FOMAS is directed and symmetrical, and there is a global reachable node; then and is a single eigenvalue of Laplacian matrix . There exists an orthogonal matrix satisfying where , is a diagonal matrix, and its diagonal elements are the characteristic values of matrix . Without loss of generality, we suppose . The characteristic equation of matrix will be calculated as follows:

Let . When and , we can obtain the characteristic values and . From the stability requirement of the system (18), we obtain .

When (), applying the bilinear transform , can be converted into as follows:

Let , and the we have
where and . Applying Lemma 6, we have the following.

By means of , we have

Based on (26), it has
Discussing (27), if , then (27) comes into existence. If , then it require is

When from (26), the solution of is . Since we have and from (27); then the solutions of are . Therefore, the solutions of the related pair and are interlaced.

By comparing the right parts of (28) and (29), we can obtain that when , ; otherwise, when , . Then, the consensus conditions of the multiagent system are obtained. The proof is finished.

*Remark 8. *Suppose that the fractional-order ; we can get the consensus condition when , and when , where is the maximum eigenvalue of matrix .

*Remark 9. *Suppose that the communication delay , we can get ; therefore, where is the maximum eigenvalue of matrix . This result is the same as the consensus condition in Corollary 3.

#### 6. Simulations

Suppose that the system is composed of four fractional-order dynamical agents (Figure 1). The connection weights between individuals are , , , and . Through the network topology of the system, we can get the adjacency matrix

Suppose that the order of the fractional multiagent dynamics is and the system control gain is ; then we can obtain the relationship between the sampling period and the upper bound of sampling delays (Figure 2) from the conditions in Theorem 7. In order to make the system meet the condition of reaching consensus, we can set the sampling period according to the sampling delay of the system or decide the stable fields of sampling delays by means of the sampling period. Suppose the order of the fractional multiagent dynamics is and the control gain ; then we can obtain that the upper bound of sampling period s corresponding delay s from Figure 2.

*Simulation 1. *Assume the sampling delay of multiagent system is s, we can obtain the upper bound of sampling period is 1.0272 s. In computer simulation, selecting the sampling period s, the consensus can be asymptotically reached (Figure 3) through fractional-order coordination algorithm.

*Simulation 2. *Assume the sampled delay of multiagent system is s, the upper bound of sampling period is 0.5054 in Figure 2. In computer simulation, selecting the sampling period s, the consensus can be asymptotically reached much more slowly with increasing of time delay (Figure 4).

*Simulation 3. *Assume the sampling delay of multiagent system is s, the upper bound of sampling period is 0.4928 in Figure 2. In computer simulation, selecting the sampling period s, the movement trajectories of the multiagent systems will be asymptotically diverged and the consensus cannot be reached (Figure 5) through fractional-order coordination algorithm.

*Simulation 4. *Let time delay continue increasing, suppose the sampling delay is s, the upper bound of sampling period will be 0.2739 in Figure 2. In computer simulation, selecting the sampling period s, the movement trajectories of the multiagent systems will be asymptotically converged and the consensus can be reached (Figure 6). Although the sampling period is less than the sampling delay, the consensus can be still achieved under the condition of Theorem 7.

#### 7. Conclusions

This paper studies distributed coordination of fractional-order multiagent system with sampled control and sampling delay. By applying the stability theory of discrete-time domain, sampled-data control of FOMAS with directed network topology is investigated, and the upper bound of the sampling period is obtained. Based on the Hermite-Biehler Theorem, the collaborative control of fractional-order multiagent systems with sampled data and sampling delay is studied. The relations between sampling delay and sampled period are obtained to ensure the consensus of FOMAS. Research of the robust stability of FOMAS will be carried out in the following work.

#### Disclosure

This paper has not been published previously and is not under consideration of publication elsewhere.

#### Acknowledgments

This research is supported in part by the State Key Development Program for Basic Research of China (Grant no. 2012CB720003), the National Natural Science Foundation of China (Grant nos. 61273152, 61127007, 61170161, and 61174085), the Natural Science Foundation of Shandong Province of China (no. ZR2011FM017) and the Science Foundation of China postdoctoral (under Grant no. 2011M500215).

#### References

- S. Li, H. Du, and X. Lin, “Finite-time consensus algorithm for multi-agent systems with double-integrator dynamics,”
*Automatica*, vol. 47, no. 8, pp. 1706–1712, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Lin and Y. Jia, “Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies,”
*Automatica*, vol. 45, no. 9, pp. 2154–2158, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Yu and L. Wang, “Group consensus in multi-agent systems with switching topologies and communication delays,”
*Systems and Control Letters*, vol. 59, no. 6, pp. 340–348, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Chen, Z. Chen, L. Xiang, Z. Liu, and Z. Yuan, “Reaching a consensus via pinning control,”
*Automatica*, vol. 45, no. 5, pp. 1215–1220, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - 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. View at Publisher · View at Google Scholar · View at Scopus - H. Yang, Z. Zhang, and S. Zhang, “Consensus of second-order multi-agent systems with exogenous disturbances,”
*International Journal of Robust and Nonlinear Control*, vol. 21, no. 9, pp. 945–956, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Meng, Y. Jia, J. Du, and F. Yu, “Tracking control over a finite interval for multi-agent systems with a time-varying reference trajectory,”
*Systems & Control Letters*, vol. 61, no. 7, pp. 807–818, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Sun and L. Wang, “${H}_{\infty}$ consensus of second-order multi-agent systems with asymmetric delays,”
*Systems & Control Letters*, vol. 61, no. 8, pp. 857–862, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. Xie, H. Liu, L. Wang, and Y. Jia, “Consensus in networked multi-agent systems via sampled control: fixed topology case,” in
*Proceedings of the American Control Conference (ACC '09)*, pp. 3902–3907, June 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Xie, H. Liu, L. Wang, and Y. Jia, “Consensus in networked multi-agent systems via sampled control: switching topology case,” in
*Proceedings of the American Control Conference (ACC '09)*, pp. 4525–4530, June 2009. View at Publisher · View at Google Scholar · View at Scopus - C.-L. Liu and F. Liu, “Stationary consensus of heterogeneous multi-agent systems with bounded communication delays,”
*Automatica*, vol. 47, no. 9, pp. 2130–2133, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Cao, W. Ren, and Y. Li, “Distributed discrete-time coordinated tracking with a time-varying reference state and limited communication,”
*Automatica*, vol. 45, no. 5, pp. 1299–1305, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Gao and L. Wang, “Sampled-data based consensus of continuous-time multi-agent systems with time-varying topology,”
*IEEE Transactions on Automatic Control*, vol. 56, no. 5, pp. 1226–1231, 2011. View at Publisher · View at Google Scholar · View at Scopus - Z.-J. Tang, T.-Z. Huang, J.-L. Shao, and J.-P. Hu, “Leader-following consensus for multi-agent systems via sampled-data control,”
*IET Control Theory & Applications*, vol. 5, no. 14, pp. 1658–1665, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - W. Yu, W. X. Zheng, G. Chen, W. Ren, and J. Cao, “Second-order consensus in multi-agent dynamical systems with sampled position data,”
*Automatica*, vol. 47, no. 7, pp. 1496–1503, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Das,
*Functional Fractional Calculus for System Identification and Controls*, Springer, Berlin, Germany, 2008. View at MathSciNet - A. A. Kilbas, H. M. Srivastava, and J. J. Trujillo,
*Theory and Applications of Fractional Differential Equations*, vol. 204 of*North-Holland Mathematics Studies*, Elsevier Science B.V., Amsterdam, The Netherlands, 2006. View at MathSciNet - J. Sabatier, O. P. Agrawal, and J. A. Tenreiro Machado,
*Advances in Fractional Calculus: Theoretical Developments and Applications in Physics and Engineering*, Springer, 2007. - I. Podlubny,
*Fractional Differential Equations*, vol. 198, Academic Press, San Diego, Calif, USA, 1999. View at MathSciNet - W. Ren and Y. C. Cao,
*Distributed Coordination of Multi-Agent Networks*, Springer, London, UK, 2011. - Y. Cao, Y. Li, W. Ren, and Y. Chen, “Distributed coordination of networked fractional-order systems,”
*IEEE Transactions on Systems, Man, and Cybernetics, Part B*, vol. 40, no. 2, pp. 362–370, 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Cao and W. Ren, “Distributed formation control for fractional-order systems: dynamic interaction and absolute/relative damping,”
*Systems and Control Letters*, vol. 59, no. 3-4, pp. 233–240, 2010. View at Publisher · View at Google Scholar · View at Scopus - K. Ogata,
*Discrete-Time Control Systems*, Prentice-Hall, Englewood Cliffs, NJ, USA, 1995.