Research Article | Open Access

Jiangping Hu, Yulong Zhou, Yunsong Lin, "Second-Order Multiagent Systems with Event-Driven Consensus Control", *Abstract and Applied Analysis*, vol. 2013, Article ID 250586, 9 pages, 2013. https://doi.org/10.1155/2013/250586

# Second-Order Multiagent Systems with Event-Driven Consensus Control

**Academic Editor:**Pedro M. Lima

#### Abstract

Event-driven control scheduling strategies for multiagent systems play a key role in future use of embedded microprocessors of limited resources that gather information and actuate the agent control updates. In this paper, a distributed event-driven consensus problem is considered for a multi-agent system with second-order dynamics. Firstly, two kinds of event-driven control laws are, respectively, designed for both leaderless and leader-follower systems. Then, the input-to-state stability of the closed-loop multi-agent system with the proposed event-driven consensus control is analyzed and the bound of the inter-event times is ensured. Finally, some numerical examples are presented to validate the proposed event-driven consensus control.

#### 1. Introduction

Recently, synthesis and analysis of multi-agent systems have drawn great attention in many disciplines, such as mathematics, physics, computer science, systems biology, engineering, and social science. Roughly speaking, multi-agent systems are a class of networked dynamic systems consisting of a group of autonomous agents, which interact with each other locally and achieve an emergence behavior over a communication network. The controlled multi-agent systems have a broad range of applications including flocking and swarming in animal groups, vehicle formation, satellite reconfiguration, and unmanned aerial vehicles for rescue and surveillance.

Consensus problems have a long history originated from management science and statistics in 1960s [1]. In the context of multi-agent systems, consensus generally means to reach an agreement regarding a certain quantity of interest that depends on the state of all agents [2]. In the literature of consensus control of multi-agent systems, many works have been focused on an important issue, that is, to investigate the coordination behavior of agents governed by different order dynamics. Especially, first-order multi-agent systems are extensively considered as a representative multi-agent consensus model in, for example, [3–8] and references therein. More recently, the consensus problems of multi-agent systems with second-order dynamics (e.g., [9–14]) and high order dynamics (e.g., [15–19]) have been paid much attention, which is mainly because in many real applications mass-point models are invalid for agents and more complex dynamics should be considered. Generally, the dynamics of a second-order multi-agent system is described by a second-order differential equation or difference equation, which contains both the position and the velocity information.

One potential application of multi-agent control is to equip each autonomous agent with a small embedded micro-processor to collect information from neighboring agents for actuating the controller updates. However, micro-processors are generally resource- and energy-limited [20], which requires a time- or an event-triggered scheduling strategy to update the control. A time-triggered update scheduling involves sampling at predefined time instances while an event-triggered one executes the control task whenever a certain error becomes large compared with the state norm. Time-triggered consensus problems were studied in [14, 21, 22] via data-sampled method. However, event-triggered strategies seem more favorable in applications. A distributed event-triggered control was considered for a first-order multi-agent system in [23–25]. Up to date, there are few contributions devoted to designing an event-triggered consensus control for multi-agent systems with second-order dynamics.

In this paper, we consider an event-driven consensus problem of a second-order leaderless and leader-follower multi-agent system with a fixed directed communication network. Firstly, the event-driven consensus problem is formulated. Secondly, an event-driven consensus control is designed for each agent to achieve consensus. Then the closed-loop multi-agent system is proven to be input-to-state stable with respect to the measurement error and, simultaneously, a positive lower bound is found for the event-time between two consecutive actuation updates.

Throughout this paper, the following notations are used. denotes an identity matrix; denotes an zero matrix; denotes a column vector; . The norm of a vector is defined as . The spectral norm of matrix is defined as , where are eigenvalues of . For a matrix , and denote, respectively, its minimal and maximal eigenvalues.

#### 2. Preliminaries and Problem Formulation

##### 2.1. Some Preliminaries

Let be a weighted directed graph with a set of vertices , a set of arcs , and a weighted adjacency matrix . In the mapping of graph to the interconnection topology of a multi-agent system, vertex represents agent , and arc , which starts from vertex and ends on vertex , is in if and only if agent can receive information from agent . In this case, agent is called a neighbor of agent , and, accordingly, denotes the neighboring set of agent . The element in the adjacency matrix is associated with the arc , that is, if and only if . Moreover, we assume that for all . When a single leader-agent is involved in the multi-agent systems, a vertex is added to represent the leader-agent and the interconnection topology is denoted by with and .

*Definition 1 (see [26]). *A path from vertex to vertex is a sequence of arcs , in the directed graph with distinct vertexes and , . A directed graph is strongly connected if there exists a path from vertex to vertex , for every .

*Definition 2 (see [26]). *Vertex is said to be reachable from vertex if there exists a path from vertex to vertex in the directed graph . Vertex is globally reachable if there exists a path from every other vertex to vertex in .

According to Definitions 1 and 2, a directed graph is strongly connected if and only if each vertex in is globally reachable, which shows that the global reachability of a directed graph is much weaker than the strong connectedness.

A diagonal matrix is a degree matrix of , whose diagonal elements for . Then the Laplacian matrix of a weighted directed graph is defined as

The next lemma shows an important property of Laplacian matrix associated with directed graph .

Lemma 3 (see [4]). *Laplacian matrix has least one zero eigenvalue with as its eigenvector, and all the non-zero eigenvalues of have positive real parts. has a simple zero eigenvalue if and only if has a globally reachable vertex. *

In the leader-follower consensus literature, it is always assumed that the leader-agent is self-active, that is, the leader does not need information feedback from other agents and thus, the adjacency coefficients for every follower-agent . For followers, we define a diagonal matrix to represent the leader-follower adjacency relationship. Let .

Lemma 4 (see [11]). *If vertex is globally reachable in , then all eigenvalues of have positive real-parts.*

A Schur-complement lemma will be used in the stability analysis of the close-loop multi-agent systems and is given to end this subsection.

Lemma 5 (see [27]). *Consider a symmetric matrix
**
where and are square. Then is positive definite if and only if both and are positive definite. *

##### 2.2. Problem Formulation

In a leaderless consensus problem, a group of identical agents are moving with a continuous-time dynamics described by a second-order differential equation as follows: where , , and are, respectively, the position, velocity, and control input of agent .

In a leader-follower consensus problem, the dynamics of follower-agents are given as (3) while the kinematics of the self-active leader is described by the following second-order differential equation: where , , and are, respectively, the position, velocity, and acceleration. Here for notation simplicity, let .

When agents are equipped with resource-limited micro-processors, it is preferable to design an event-driven consensus controls for all agents such that the consensus controls need no update in continuous-time. For agent , we define a state measurement error and let . Then an event-trigger condition is defined as , where are, respectively, the concatenation vector of the state variables in system (3). All agents update their consensus controls at a series of event-times which are implicitly defined by . Between control updates at two consecutive event-times, the event-driven consensus control is held constant until the next event is triggered, that is,

We say that the event-driven consensus problem of leaderless multi-agent system (3) is solved if an event-driven consensus control can be found to ensure that for . Similarly, the event-driven consensus problem of leader-follower multi-agent system (3)-(4) is solved if for .

#### 3. Control Design and Stability Analysis

##### 3.1. Leaderless Consensus Control

We assume that the consensus laws in system (3) are updated only at discrete event-times. Suppose that the event-times of all agents are modeled as a sequence for . For agent with dynamics (3), define two measurement errors , , . The event-times are defined by the function , which will be determined in sequel.

An event-driven consensus control of agent is proposed as follows: for . The control gain parameter will be determined in sequel.

Then a compact form of (3) using control (8) is given by where , is the Laplacian matrix.

Denote , . One has , . Furthermore, system (9) can be rewritten as or where

Now we will analyze the convergence of the closed-loop multi-agent system (11) under the event-driven consensus control (8). To facilitate the convergence analysis, we describe the following lemma. Its proof is quite obvious and omitted here.

Lemma 6. *For Laplacian matrix associated with the directed graph , there exists a non-singular matrix
**
such that
**
where , . *

From Lemma 6, the submatrix of is a full-rank matrix if and only if has a global reachable vertex. Moreover, the eigenvalues of have positive real-parts, or equivalently, is Hurwitz stable. Therefore, there exists a positive definite matrix such that

Take a coordinate transformation and then system (10) becomes

Essentially, system (17) can be regarded as a series interconnection of two subsystems: where and ,

Let , , then subsystem (19) becomes where

Now a main result is obtained for system (10).

Theorem 7. *Assume that the interconnection topology associated with multi-agent system (3) has a globally reachable vertex. If the control gain satisfies
**
with given in (15), then the event-driven consensus problem of the leaderless multi-agent system (3) is solved with the control (8), that is,
*

*Proof. *For system (19), or equivalently (21), take a Lyapunov function
where
where satisfies (15). Thus, is positive definite with given in (23).

Differentiating leads to
where
According to Schur complement Lemma 5, is positive definite with given in (23).

Therefore,
Due to the fact that , enforcing the measurement error to satisfy
with , one has
From (31), we conclude that , that is, as , , .

On the other hand, for system (18), let be the initial values of and take a variable change , . Then the solution can be described by the following integral equation:

Since the system (19) is exponentially stable, based on the event-triggered condition (30), solution (32) has an exponential decay term with respect to time . Consequently, the solution is convergent to as , and thus,
as . Furthermore, from the variable change (16), one has
Therefore, when the event-driven consensus control (8) is applied to each agent, one has , as . The proof is complete.

*Remark 8. *The gain in (23) can be taken without exact knowledge of the interconnection topology associated with the multi-agent system in real application of the control (8). In fact, the spectral norm of in (23) can be obtained by estimating the bound of the solution of Lyapunov equation (15) (see [28]), which is closely related with the Laplacian spectrum. Fortunately, there have been many results on the bounds of the eigenvalues of a Laplacian matrix [29].

Next, we show that the inter-event times have a lower bound for . It is noticed that, from (16), Define a matrix . Then, based on (35), one has For convenience of simplified calculation, let , and . Take the derivative of :

Assume that is the solution of Then, one has for . From the variable change (36) and the event-driven condition (30), satisfies and the inter-event times are bounded by the time it takes for to evolve from to . Solving the differential equation (38) leads to which is a positive bound due to the fact that .

Then a result is stated as follows.

Theorem 9. *When the event-driven consensus control (8) is applied to the multi-agent system (3), the inter-event times for , have a lower bound given by (40). *

##### 3.2. Leader-Follower Consensus Control

In the leader-following problem, we assume that the state information, that is, , , and of the leader can be measured in continuous-time by the followers. Thus, we propose the following event-driven consensus control of the follower : for .

*Remark 10. *For the leader-following problem (3)-(4) under investigation, the leader is assumed to be self-active, which means that the leader is moving according to its own (predesigned) policy and needs no feedback information from any other agent. In some sense, the leader plays the role of an external commander of all the followers. Thus, no event-driven strategy is applied to update the state of the leader. Though the followers are using the event-driven relative information from the neighboring followers, but they can obtain the real-time relative position and velocity measurements from the leader only if the followers are connected to the leader. Therefore, in the control (41), it would be preferable to assume that and are measured in continuous time.

Still denote the measurement errors , for , . Applying control (41) to system (3) leads to where . Define , and , . Based on the fact that , , one has where

Theorem 11. *Assume that the vertex is globally reachable in the leader-follower interconnection topology . If the control gain satisfies
**
where is the solution of the Lyapunov equation , then the event-driven consensus problem of the leader-follower multi-agent system (3)-(4) is solved with the control (41), that is,
*

*Proof. *For system (43), take a Lyapunov function
where
It is not difficult to show that is positive definite with given in (45).

Differentiating leads to
where
According to Schur complement Lemma 5, is positive definite with given in (45).

Therefore,
Due to the fact that , enforcing the measurement error to satisfy
with , one has
From (53), we conclude that , that is, as , . The proof is thus competed.

Similar to Theorem 9, a conclusion about the lower bound of the event-times can also be found true, which is omitted here.

#### 4. Simulations

*Example 12. *Consider four agents whose dynamics is described by (3). The interconnection topology is shown in Figure 1. Obviously, has a globally vertex ; however, it is not strongly connected.

Assume that the weighted adjacency matrix reduces to a matrix. Then the Laplacian matrix of is which is an asymmetric matrix. A non-singular matrix in Lemma 6 can be easily found as

Then the submatrices and . The positive definite matrix satisfying (15) is given by whose minimal and maximal eigenvalues are, respectively, . According to (23), take the gain .

The initial conditions of system (9) are , and . In the event triggered condition (30), we take . It can be seen that, from Figures 2 and 3, the four agents reach consensus on the position and velocity states with the proposed event-driven consensus control (8). Additionally, since the vertex has no link starting from it, the agent is moved according to its own dynamics and the initial conditions, as shown in Figures 2, 3, and 5. The evolution of the measurement error vector is depicted in Figure 4, which shows that the error is bounded by the specified threshold . In Figure 5, the consensus controllers are illustrated for the four agents, whose event-driven update frequencies are decreasing as time evolves.

*Example 13. *Consider four followers and one leader whose dynamics are, respectively, described by (3) and (4). The leader-follower interconnection topology is shown in Figure 6, which has a globally reachable vertex .

It is not difficult to obtain the Laplacian matrix as and the leader adjacency matrix . Since is a stable matrix, one solves the Lyapunov equation and has the positive definite solution as whose maximal eigenvalue . From (45), still take .

The acceleration of the active leader is assumed to be . The initial values of system (3) is same as those in Example 12 and the initial values of the leader is given as and . Figures 7 and 8 show that the followers and the self-active leader reach consensus on the position and velocity under the event-driven control (41). The evolution of is also presented in Figure 9.

#### 5. Conclusions

An event-driven consensus problem of second-order multi-agent systems with/without a self-active leader was considered in this paper. The consensus controllers have been proposed for all autonomous mobile agents based on an event-driven control update strategy. The input-to-state stability of the closed-loop multi-agent system has been analyzed by employing an ISS Lyapunov function. Some numerical examples have been presented to validate the proposed event-driven controls. However, it is noted that the event-driven condition depends on the states of the whole multi-agent group and all agents have identical event-times. The result is somewhat preliminary due to the centralized information gathering, so further work will be devoted to designing a decentralized event-driven consensus control for a second-order multi-agent system in the future.

#### Acknowledgments

This work is supported by the National Natural Science Foundation of China under Grant 61104104 and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry of China.

#### References

- M. H. DeGroot, “Reaching a consensus,”
*Journal of the American Statistical Association*, vol. 69, no. 345, pp. 118–121, 1974. View at: Google Scholar - R. Olfati-Saber, J. A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,”
*Proceedings of the IEEE*, vol. 95, no. 1, pp. 215–233, 2007. View at: Publisher Site | Google Scholar - A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,”
*IEEE Transactions on Automatic Control*, vol. 48, no. 6, pp. 988–1001, 2003. View at: Publisher Site | Google Scholar | MathSciNet - 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. View at: Publisher Site | Google Scholar | MathSciNet - J. Hu and G. Feng, “Distributed tracking control of leader-follower multi-agent systems under noisy measurement,”
*Automatica*, vol. 46, no. 8, pp. 1382–1387, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - L. Moreau, “Stability of multiagent systems with time-dependent communication links,”
*IEEE Transactions on Automatic Control*, vol. 50, no. 2, pp. 169–182, 2005. View at: Publisher Site | Google Scholar | MathSciNet - J. Lorenz and D. A. Lorenz, “On conditions for convergence to consensus,”
*IEEE Transactions on Automatic Control*, vol. 55, no. 7, pp. 1651–1656, 2010. View at: Publisher Site | Google Scholar | MathSciNet - Z.-J. Tang, T.-Z. Huang, and J.-L. Shao, “Containment control of multiagent systems with multiple leaders and noisy measurements,”
*Abstract and Applied Analysis*, vol. 2012, Article ID 262153, 9 pages, 2012. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - P. Lin, K. Qin, Z. Li, and W. Ren, “Collective rotating motions of second-order multi-agent systems in three-dimensional space,”
*Systems & Control Letters*, vol. 60, no. 6, pp. 365–372, 2011. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - K. D. Do, “Formation control of multiple elliptical agents with limited sensing ranges,”
*Automatica*, vol. 48, no. 7, pp. 1330–1338, 2012. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - J. Hu and Y. Hong, “Leader-following coordination of multi-agent systems with coupling time delays,”
*Physica A*, vol. 374, no. 2, pp. 853–863, 2007. View at: Publisher Site | Google Scholar - Y. Cao, D. Stuart, W. Ren, and Z. Meng, “Distributed containment control for multiple autonomous vehicles with double-integrator dynamics: algorithms and experiments,”
*IEEE Transactions on Control Systems Technology*, vol. 19, no. 4, pp. 929–938, 2011. View at: Publisher Site | Google Scholar - Y. Hong, G. Chen, and L. Bushnell, “Distributed observers design for leader-following control of multi-agent networks,”
*Automatica*, vol. 44, no. 3, pp. 846–850, 2008. View at: Publisher Site | Google Scholar | MathSciNet - Z. Wu, L. Peng, L. Xie, and J. Wen, “Stochastic bounded consensus tracking of second-order multi-agent systems with measurement noises and sampled-data,”
*Journal of Intelligent & Robotic Systems*, vol. 68, no. 3-4, pp. 261–273, 2012. View at: Google Scholar - 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. View at: Publisher Site | Google Scholar | MathSciNet - Y. Tian, “High-order consensus of heterogeneous multi-agent systems,” in
*Proceedings of the 8th Asian Control Conference*, pp. 341–346, Kaohsiung, Taiwan, 2011. View at: Google Scholar - X. Wang, Y. Hong, J. Huang, and Z.-P. Jiang, “A distributed control approach to a robust output regulation problem for multi-agent linear systems,”
*IEEE Transactions on Automatic Control*, vol. 55, no. 12, pp. 2891–2895, 2010. View at: Publisher Site | Google Scholar | MathSciNet - J. Hu and G. Feng, “Quantized tracking control for a multi-agent system with high-order leader dynamics,”
*Asian Journal of Control*, vol. 13, no. 6, pp. 988–997, 2011. View at: Publisher Site | Google Scholar | MathSciNet - Z. Li, Z. Duan, and G. Chen, “Dynamic consensus of linear multi-agent systems,”
*IET Control Theory & Applications*, vol. 5, no. 1, pp. 19–28, 2011. View at: Publisher Site | Google Scholar | MathSciNet - P. Tabuada, “Event-triggered real-time scheduling of stabilizing control tasks,”
*IEEE Transactions on Automatic Control*, vol. 52, no. 9, pp. 1680–1685, 2007. View at: Publisher Site | Google Scholar | 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 Site | Google Scholar | MathSciNet - 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 Site | Google Scholar | MathSciNet - D. V. Dimarogonas, E. Frazzoli, and K. H. Johansson, “Distributed event-triggered control for multi-agent systems,”
*IEEE Transactions on Automatic Control*, vol. 57, no. 5, pp. 1291–1297, 2012. View at: Publisher Site | Google Scholar | MathSciNet - Z. Liu, Z. Chen, and Z. Yuan, “Event-triggered average-consensus of multi-agent systems with weighted and direct topology,”
*Journal of Systems Science & Complexity*, vol. 25, no. 5, pp. 845–855, 2012. View at: Publisher Site | Google Scholar | MathSciNet - J. Hu, G. Chen, and H.-X. Li, “Distributed event-triggered tracking control of leader-follower multi-agent systems with communication delays,”
*Kybernetika*, vol. 47, no. 4, pp. 630–643, 2011. View at: Google Scholar | Zentralblatt MATH | MathSciNet - C. Godsil and G. Royle,
*Algebraic Graph Theory*, vol. 207 of*Graduate Texts in Mathematics*, Springer, New York, NY, USA, 2001. View at: Publisher Site | MathSciNet - R. A. Horn and C. R. Johnson,
*Matrix Analysis*, Cambridge University Press, Cambridge, UK, 1985. View at: MathSciNet - T. Mori and I. A. Derese, “A brief summary of the bounds on the solution of the algebraic matrix equations in control theory,”
*International Journal of Control*, vol. 39, no. 2, pp. 247–256, 1984. View at: Publisher Site | Google Scholar | MathSciNet - R. Merris, “Laplacian matrices of graphs: a survey,”
*Linear Algebra and Its Applications*, vol. 197-198, pp. 143–176, 1994. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet

#### Copyright

Copyright © 2013 Jiangping Hu 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.