- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Mathematical Problems in Engineering

Volume 2013 (2013), Article ID 587569, 6 pages

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

## Controllability of Second-Order Multiagent Systems with Multiple Leaders and General Dynamics

^{1}College of Science, North China University of Technology, Beijing 100144, China^{2}Beijing Key Lab of Urban Intelligent Traffic Control Technology, North China University of Technology, Beijing 100144, China^{3}Department of Applied Mathematical Sciences, Shanghai Finance University, Shanghai 201209, China^{4}College of Mathematical Science, University of Electronic Science and Technology of China, Chengdu 611731, China^{5}Department of Control Science and Engineering, Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China, Huazhong University of Science and Technology, Wuhan 430074, China^{6}Intelligent Control Laboratory, Center for Systems and Control, Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871, China

Received 3 April 2013; Accepted 3 June 2013

Academic Editor: Ming Cao

Copyright © 2013 Bo Liu 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

This paper proposes a new second-order discrete-time multiagent model and addresses the controllability of second-order multiagent system with multiple leaders and general dynamics. The leaders play an important role in governing the other member agents to achieve any desired configuration. Some sufficient and necessary conditions are given for the controllability of the second-order multiagent system. Moreover, the speed controllability of the second-order multiagent system with general dynamics is discussed. Particularly, it is shown that the controllability of the whole system relies on the number of leaders and the connectivity between the leaders and the members. Numerical examples illustrate the theoretical results.

#### 1. Introduction

Controllability is one of the fundamental issues for coordinated control of multiagent systems which is partly due to the wide applications in communication and computation, as well as cooperative control [1–19].

So far, the issue of controllability shows new features and difficulties, and is still lacking in studies. In [4], the issue of controllability was firstly investigated by the nearest neighbor rules. Tanner had obtained necessary and sufficient conditions of the controllability for first-order multiagent dynamic systems regarding an agent as a leader or the external input. In [5, 7], the controllability for multiagent systems was investigated by the graph theoretic characterization. Moreover, Ji et al. [17] analyzed the multiagent controllability using tree topology. Jafari et al. [18] studied the structural controllability of multiagent systems. In [9, 15, 16], the authors discussed the controllability of discrete-time multiagent systems with a single leader or multiple leaders on fixed networks and switching networks, respectively, and obtained the necessary or sufficient controllable conditions for multiagent systems. References [10, 14] studied the controllability of continuous-time multiagent systems with time-delay and switching topology, respectively.

However, most of the recent research work focuses on the controllability of single integrator or first-order multiagent dynamic systems, such as [4–19]. But the controllability of double integrator or second-order multiagent dynamic systems was seldom studied. Motivated by the works above, in this paper, we focus on discussing the controllability of second-order discrete-time multiagent systems with general dynamic topology. Some sufficient and necessary conditions for controllability are presented. The main contributions of our paper lie in the following. (1) A novel model of discrete-time multiagent system is a second-order. (2) The influence of leaders on the followers is investigated. (3) The controllability of such second-order discrete-time system with multiple leaders and general dynamics is considered, which cannot be found in the recent literatures. (4) The controllability and the speed controllability of the second-order multiagent system are discussed, respectively. (5) A sufficient and necessary condition for controllability of the second-order system is presented.

This paper is organized as follows. In Section 2, we present some concepts in graph theory. Section 3 gives the model to be studied. In Section 4, main results are presented. In Section 5, numerical examples and simulations are provided to illustrate the theoretical results. A conclusion is made in Section 6.

#### 2. Preliminaries

In this section, some basic definitions and concepts in graph theory [20] are first introduced.

Let be an undirected graph of order with the set of nodes and the set of edges . An edge of is denoted by , which is an unordered pair of distinct nodes of . If , and , then we say that is a neighbor of or and are adjacent. The neighborhood set of node is denoted by . , where , and is called the coupling weight of edge .

Any undirected graph can be represented by its adjacency matrix , which is a symmetric matrix. A diagonal matrix is a degree matrix of with its diagonal elements , .

Then, the Laplacian of the graph (or matrix ) is defined as

#### 3. Model

Consider a second-order multiagent system with agents, labeled the first agents from to as followers and the remainder agents from to as leaders, and each agent moves according to the following dynamics: with where is the state of agent () and is the state of agent (). presents the neighbor set of agent . , and . is a discrete-time index set. The coupling matrix with and represents the coupling strength among the followers, and with represents the coupling strength from the leaders to the followers. if there is information from leader to follower ; otherwise .

Throughout this paper, it is assumed that the leader can influence the member followers but cannot be influenced by its neighbors.

Suppose and be the state vector of all the followers and all the leaders, respectively. Then, (2) can be rewritten as where , is the identity matrix, For simplicity, we denote (6) as where and the matrix with

It can be easily seen that the matrix satisfies the following:(i)the off-diagonal elements are all negative or zero;(ii)the row sums are equal to the column sums with the value of zero.

#### 4. Main Results

In the following, we first give the definition of controllability in second-order discrete-time system and the classical criterion of controllability.

*Definition 1. *A nonzero state of system (4) is controllable at the initial time if there exists a finite time , and a control input , such that and . If any nonzero state of system (4) is controllable, then system (4) is said to be controllable. If and , then system (4) is position controllable, and if and , then system (4) is speed controllable.

*Definition 2 (controllability matrix). *The controllability matrix of system (4) is given by
where matrix .

Lemma 3 (Rank test for controllability). *System (4) is controllable if .*

Lemma 4 (PBH rank test for discrete-time systems). *System (4) is controllable if (4) satisfies one of the following conditions:*(i)*, for all ;*(ii)*, where , for all , is the eigenvalue of matrix .*

In general, for second-order multiagent systems, the controllable matrix is too hard to calculate. Therefore, we can use the PBH rank rest to justify the controllability of such system. In the following, we will give a more simple and convenient theorem using the PBH rank rest.

Theorem 5. *System (4) is controllable if .*

*Proof. *By Lemma 4, system (4) is controllability if , where , for all , is the eigenvalue of matrix . Then, it is obvious to see that
if .

*Remark 6. *From Theorem 5, we can find that the second-order multiagent system (4) is controllable if ( is the number of leaders and the number of followers); otherwise, the system is always uncontrollable.

*Remark 7. *Notice that the direct consequence of Theorem 5 is that the controllability of the network (4) of a group of agents relies only on the connectivity between the leaders and members, regardless of the connectivity of the members in the network.

Corollary 8. *If , system (4) is speed controllable.*

Under the symmetry condition of the adjacent matrix , we can have the following result.

Theorem 9. *System (4) is speed controllable if and only if the following conditions hold.*(i)*The eigenvalues of are all distinct.*(ii)*All the eigenvectors of are not orthogonal to at least one column in simultaneously.*

The proof of Lemma 3 is similar to that of [15, Theorem 1], here omitted.

*Remark 10. *From Corollary 8 and Theorem 9, it can be easily seen that even though system (4) is speed controllable, system (4) cannot be completely controllable.

#### 5. Numerical Examples and Simulations

This section presents some numerical examples and simulations to illustrate the theoretical results.

*Example 1. *Consider a seven-agent network with agents 4–7 as the leaders, where the topology of the network is described by Figure 1. From Figure 1, we can see that the number of the leaders is more than that of the followers. For simplicity, let for and . According to Figure 1, the second-order multiagent system (4) is defined by
with

By computing, and , then system (4) is indeed controllable.

Figures 2 and 3 show the simulation results of formation control of the second-order network. The follower agents (the black star dots) move from a random initial configuration to desired ones: aligning in a straight line (the black circles) with controllable speed as shown in Figures 2 and 3, respectively.

*Example 2. *A five-agent network with agents 4 and 5 as the leaders and with fixed topology described by the graph in Figure 4. From Figure 4, we can see that the number of the leaders is less than that of the followers.

From Figure 1, the second-order multiagent system (4) is given by
with

Using Matlab calculation, the eigenvalues of are
It is obvious that the eigenvalues of are all different, and the elements of are all nonzero. Therefore, system (4) is speed controllable. However, and , then system (4) is uncontrollable.

Figure 5 shows the simulation results of the second-order network. It is easily seen that the speeds of the system are controllable, but the positions of the system are uncontrollable. Therefore, the whole second-order system is uncontrollable.

#### 6. Conclusion

This paper has studied the controllability of discrete-time second-order multiagent systems with multiple leaders and general dynamic topology. By applying the PBH rank test technique, some effective sufficient and necessary conditions for the controllability of the multiagent discrete-time systems are obtained. The results in this paper show that the controllability of discrete-time second-order multiagent systems can only depend on the information from the leaders to the followers, regardless of the connectivity of the members in the network. These studies are helpful in understanding the dynamics of interconnected systems. However, for discrete-time second-order multiagent systems, as in cases often encountered in practice, it is usually difficult to deal with the controllability problem due to complexity of the topology and lack of theoretical tools. Our main result shows an advantage of the second-order topology scheme. We anticipate that our solutions to the above-described problems will offer a theoretical basis and valuable ideas for future applications of networked multiagent systems in the field of coordination control, including formation control and tracking problems.

#### Acknowledgments

This work was supported by National Natural Science Foundation (61170113, 61203150, 61104141, 60774089, 10972003, 61174116), Science and Technology Development Plan Project of Beijing Education Commission (no. KM201310009011), the Funding Project for Academic Human Resources Development in Institutions of Higher Learning Under the Jurisdiction of Beijing Municipality (PHR201108055), the Program for New Century Excellent Talents in University from Chinese Ministry of Education under Grant NCET-12-0215, the National High Technology Research and Development Program of China 863 (no. 2012AA112401), and the Research Fund for the Doctoral Program of Higher Education (RFDP) under Grant no. 20100142120023. This work was also supported by the Foundation Grant of Guangxi Key Laboratory of Automobile Components and Vehicle Technology (13-A-03-01) and the Opening Project of Guangxi Key Laboratory of Automobile Components and Vehicle Technology (2012KFZD03).

#### References

- W. Ren and R. W. Beard, “Consensus seeking in multiagent systems under dynamically changing interaction topologies,”
*Institute of Electrical and Electronics Engineers*, vol. 50, no. 5, pp. 655–661, 2005. View at Publisher · View at Google Scholar · View at MathSciNet - H. Su, X. Wang, and Z. Lin, “Flocking of multi-agents with a virtual leader,”
*Institute of Electrical and Electronics Engineers*, vol. 54, no. 2, pp. 293–307, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - H. Su, G. Chen, X. Wang, and Z. Lin, “Adaptive second-order consensus of networked mobile agents with nonlinear dynamics,”
*Automatica*, vol. 47, no. 2, pp. 368–375, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. G. Tanner, “On the controllability of nearest neighbor interconnections,” in
*Proceedings of the 43rd IEEE Conference on Decision and Control (CDC '04)*, pp. 2467–2472, December 2004. View at Scopus - M. Ji and M. Egerstedt, “A graph theoretic characterization of controllability for multi-agent systems,”
*IEEE Transactions on Robotics*, vol. 23, no. 4, pp. 693–703, 2007. - B. Liu, G. Xie, T. Chu, and L. Wang, “Controllability of interconnected systems via switching networks with a leader,” in
*Proceedings of the IEEE International Conference on Systems, Man and Cybernetics*, vol. 5, pp. 3912–3916, October 2006. View at Publisher · View at Google Scholar · View at Scopus - Z. Ji, H. Lin, and T. H. Lee, “A graph theory based characterization of controllability for multi-agent systems with fixed topology,” in
*Proceedings of the 47th IEEE Conference on Decision and Control (CDC '08)*, pp. 5262–5267, Cancun, Mexico, December 2008. View at Publisher · View at Google Scholar · View at Scopus - M. Zamani and H. Lin, “Structural controllability of multi-agent systems,” in
*Proceedings of the American Control Conference (ACC '09)*, pp. 5743–5748, St. Louis, Mo, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus - B. Liu, T. Chu, L. Wang, and G. Xie, “Controllability of a leader-follower dynamic network with switching topology,”
*Institute of Electrical and Electronics Engineers*, vol. 53, no. 4, pp. 1009–1013, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - Z. Ji, Z. Wang, H. Lin, and Z. Wang, “Controllability of multi-agent systems with time-delay in state and switching topology,”
*International Journal of Control*, vol. 83, no. 2, pp. 371–386, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Lozano, M. W. Spong, J. A. Guerrero, and N. Chopra, “Controllability and observability of leader-based multi-agent systems,” in
*Proceedings of the 47th IEEE Conference on Decision and Control (CDC '08)*, pp. 3713–3718, Cancun, Mexico, December 2008. View at Publisher · View at Google Scholar · View at Scopus - L. Wang, F. Jiang, G. Xie, and Z. Ji, “Controllability of multi-agent systems based on agreement protocols,”
*Science in China F*, vol. 52, no. 11, pp. 2074–2088, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Jiang, L. Wang, G. Xie, Z. Ji, and Y. Jia, “On the controllability of multiple dynamic agents with fixed topology,” in
*Proceedings of the American Control Conference (ACC '09)*, pp. 5665–5670, St. Louis, Mo, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus - B. Liu, T. Chu, L. Wang, Z. Zuo, G. Chen, and H. Su, “Controllability of switching networks of multi-agent systems,”
*International Journal of Robust and Nonlinear Control*, vol. 22, no. 6, pp. 630–644, 2012. View at Publisher · View at Google Scholar · View at MathSciNet - B. Liu, N. Hu, J. Zhang, and H. Su, “Controllability of discrete-time multi-agent systems with multiple leaders on fixed networks,”
*Communications in Theoretical Physics*, vol. 58, pp. 856–862, 2012. - B. Liu, W. Hu, and Z. Jie, “Controllability of discrete-time multi-agent systems with leaders via switching topology,”
*Applied Mechanics and Materials*, vol. 128-129, pp. 92–95, 2012. View at Publisher · View at Google Scholar · View at Scopus - Z. Ji, H. Lin, T. H. Lee, and Q. Ling, “Multi-agent controllability with tree topology,” in
*Proceedings of the American Control Conference (ACC '10)*, pp. 850–855, Baltimore, Md, USA, July 2010. View at Scopus - S. Jafari, A. Ajorlou, A. G. Aghdam, and S. Tafazoli, “On the structural controllability of multi-agent systems subject to failure: a graph-theoretic approach,” in
*Proceedings of the 49th IEEE Conference on Decision and Control (CDC '10)*, pp. 4565–4570, Atlanta, Ga, USA, December 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Liu, J. Slotine, and A. Barabási, “Controllability of complex networks,”
*Nature*, vol. 473, no. 7346, pp. 167–173, 2011. View at Publisher · View at Google Scholar · View at Scopus - C. Godsil and G. Royle,
*Algebraic Graph Theory*, vol. 207, Springer, New York, NY, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet