Stabilization of Heterogeneous Multiagent Systems via Harmonic Control
Stabilizing multiagent systems including unstable agents shows the advantage of cooperation. This paper addresses the problem of stabilization of heterogeneous multiagent systems. Under cycle graphs, a sufficient condition for the stabilization problem via harmonic control is provided and an algorithm of designing the interconnection gains is presented. Furthermore, a sufficient and necessary condition for stabilization problem via harmonic control under cycle graphs is first given when the graph contains less than 5 nodes.
In recent years, multiagent systems have broad applications in science and engineering areas such as consensus [1–11], controllability [12–22], and optimal control [23–25]. Multiagent systems are concerned chiefly with structures of networks and local information feedback including self-state feedback and neighbor-state feedback. Designing decentralized controller with local information to realize stability is a basic problem in large-scale systems and multiagent systems [26–38]. Kim et al.  proposed a problem of stabilizability for multiagent systems with single-integrator dynamics by using external control inputs. Guan et al. extended the study to multiagent systems with general linear dynamics . It is noted that [27, 28] only consider the identical agents. But in practice, many multiagent systems have different subsystems. These systems are called heterogeneous multiagent systems. For example, agents of flocks or satellite clusters might have different dynamic equations from each other due to their different masses or different structures . In , a sufficient algebraic condition was provided for stabilization of heterogeneous multiagent systems in the case of static topology. The basic requirement of the sufficient condition in  is that each agent is stable or can be stabilized through self-state feedback. In the case where there exists an unstable agent which cannot be stabilized via self-state feedback, how to use neighbor-state feedback to stabilize multiagent systems is an important issue. Designing the gains of neighbor-state feedback has been applied in the plague control of some power networks [31, 35]. However, there are rarely interesting results on such problems until recent years. To this day, the results for stabilization of heterogeneous multiagent systems are limited to cycle topologies, and only sufficient conditions are obtained. Reference  presented a sufficient condition for the stabilization problem, in which designing interconnection gains is called harmonic control and the system studied is composed of two subsystems. In , Zhu provided a sufficient condition for the stabilization of heterogeneous multiagent systems under directed cycle graphs. It will be challenging to explore necessary and sufficient conditions for stabilization of heterogeneous multiagent systems. The main reason is that heterogeneousness and complicated interconnections make the problem tricky. Therefore, what conditions can stabilize heterogeneous multiagent systems via harmonic control is still an open problem.
This paper studies the stabilization of heterogeneous multiagent systems under directed communication topologies. The graphs include not only cycles but also paths, stars, and trees. We extended the results of . The contributions are twofold: (i)A sufficient condition for the stabilization problem via harmonic control is provided under cycle graphs. This condition is more general than the sufficient condition given in . Besides, an approach is introduced to design the interconnection gains(ii)When the multiagent system contains less than 5 agents, a necessary and sufficient algebraic condition is presented for this stabilization problem under cycle graphs. To the best of our knowledge, it is the first time to provide necessary and sufficient condition for stabilization problem of heterogeneous multiagent systems via harmonic control under cycle graphs
The structure of this paper is as follows. Section 2 presents some preliminaries and formulates the stabilization problem of multiagent systems. Section 3 provides the main results. Two numerical examples are given in Section 4 to show the applicability of the obtained results. Finally, conclusion is summarized in Section 5.
Throughout this paper, the set of integers is denoted by . With vertices representing agents and edges indicating the interconnections between them, graph theory proves to be a natural framework for modeling and treatment of multiagent systems. We consider directed graph rather than undirected graph. A directed graph is denoted by , where and represent the vertex and edge set, respectively. An edge is represented by an arrow tailed at the node and headed toward the node , which means node can receive information from . The set of neighbors of node is denoted by . The indegree of a vertex is the number of edges with head . And the outdegree of a vertex is the number of edges with tail . If every possible edge exists, the graph is said to be complete. A path of length from to is an ordered set of distinct vertices such that for all . An -cycle is a path except for which , meaning the path rejoins itself. is the adjacency matrix whose entry is 1 if is one of ’s edges and 0 otherwise. A tree graph with root is a graph that for each node other than , there exists one and only one path from to this node. A node is called a leaf if its outdegree is zero, and two nodes are said to be in different branches when there is no path from any one of them to the another. A graph is said to contain a spanning tree if there exists a tree whose nodes are all those in and edges in the tree are also in . A star graph is a kind of special tree graph whose root is a neighbor of all nodes rest.
Let us consider a group of linear agents with information flow among them described by graph with , whose linear dynamics is where is the state vector of the th agent, and , , and are real matrices. is the self-state feedback law described by where . is the neighbor-state feedback law described by where . The closed loop system is , where , where is the entry of the adjacent matrix of the graph .
In order to investigate more deeply the influence of neighbor-state feedback on the stabilization problem, the heterogeneous multiagent system (1) without self-state feedback gains is simplified to
Lemma 1 (Routh-Hurwitz criterion) . A necessary and sufficient condition for polynomial to be stable is that the determinants are all positive, where it is being understood that in each determinant, all the with subscripts that are either negative or greater than are to be replaced by zero. is named as the Hurwitz determinant.
3. Main Results
In the section, we mainly investigate how to use neighbor-state feedback to solve the stabilization problem when the multiagent systems are still unstable after using their self-state feedback.
3.1. The Case without Self-State Feedback
Directed paths and directed cycles are basic ingredients for the investigation of stabilization of directed graphs. The analysis on path and cycle graphs is expected to provide insights for that of more complex structures. According to Appendix, for path graphs, star graphs, and tree graphs, the stabilizability is not affected by the neighbor-state feedback. That is to say, for path graphs, star graphs, or tree graphs, the stabilization problem is solvable if and only if each individual is stable or can be stabilized by its self-state feedback. Now, we consider the directed cycle graphs. The following assumption will be taken into account for the cycle graphs.
Assumption 1. is controllable, where .
For the cycle graph which is shown in Figure 1, the system matrix of the closed loop is where , .
For convenience, we address the definition of harmonic polynomial of a diagonal block matrix .
Definition 2. For a diagonal block matrix , if its characteristic polynomial is , where , then the harmonic polynomial of is where is the corresponding coefficients of the polynomial .
Theorem 1. Consider the heterogeneous multiagent system (5) depicted by a cycle graph shown in Figure 1 with Assumption 1. The stabilization problem via harmonic control is solvable if the harmonic polynomial of is stable.
Proof 1. Since is controllable, it is assumed, without loss of generality, that is in the controllable canonical form. Design the general decentralized controllers as Then, we obtain the closed loop system as where is of the form as (8), where The characteristic polynomial of is After a series of column-addition transformations, can be written as where is the characteristic polynomial of matrix , and stands for the number of no interest. when , otherwise . Denote by . Using Laplace expansion along the rows including −1, then Let . Then, Since is not fixed, if is stable, there exist appropriate values of s which can make stable. For example, one can take small enough positive real numbers , where and . Let Using polynomial long division, the result of dividing by is quotient and remainder . Since , it is obvious that as . Consequently, as , where . That is to say, as . It follows that if is stable, then is stable. Let the characteristic polynomial be , accordingly is stable. Using polynomial factorization, can be assigned by the coefficients of the factors of .
In the following, we propose an algorithm to obtain in which case is in the controllable standard form. The algorithm is described as follows:
Step 1. If is controllable, then calculate the characteristic polynomial of .
Step 2. Get the polynomial .
Step 3. Take small enough positive real numbers to obtain the polynomial .
Step 4. Divide by to obtain the remainder .
Step 5. Factorize the polynomial and can be assigned by the coefficients of the factors of .
Theorem 1 provides a sufficient condition for the stabilization via harmonic control under cycle graphs. To the best of our knowledge, sufficient and necessary conditions for stabilization via harmonic control under cycle graphs have not yet been studied in detail. Due to the difficulty of the problem, we only provide sufficient and necessary conditions for the stabilization via harmonic control under cycle graphs with less than 5 nodes.
Lemma 2. If the polynomial (6) is stable, then the polynomial is stable, where and .
Proof 2. (i)If , then . Equation (6) is stable; it follows that . Hence, is stable.(ii)If , then . Since (6) is stable, it follows that . Thus, , . By Routh-Hurwitz criterion, is stable.(iii)If , then . Since (6) is stable, it follows that , and , . For , , , andHence, is stable.
Theorem 2. Consider the heterogeneous multiagent system (5), , depicted by a cycle graph with Assumption 1. The stabilization problem via harmonic control is solvable if and only if the harmonic polynomial of is stable.
Corollary 1. If , then the stabilization problem via harmonic control is solvable if and only if , where denotes the trace of matrix .
Proof 4. (Necessity) According to Theorem 2, if the system composed of two agents can be stabilized, then . Since and , it follows that .
(Sufficiency) If , then . According to Theorem 1, for the system composed of two agents, if is stable, i.e., , then the system can be stabilized via harmonic control.
Remark 1. When , if , according to Corollary 1, we can choose such that . Then, the characteristic polynomial . Consequently, . Using polynomial factorization, can be assigned by the coefficients of the factors of .
Remark 2. It is challenging to obtain the sufficient and necessary condition for the stabilization problem via harmonic control under cycle graph, although we solved the stabilization problem where . If , then the sufficient and necessary conditions will be difficult to obtain. For example, suppose that and the characteristic polynomial of is . is stable. However, the harmonic polynomial is not stable. Consequently, when , it is difficult to explore the necessary condition for the stabilization problem via harmonic control under cycle graph.
3.2. The Case with Self-State Feedback
In case the graph with self-state feedback does not contain cycles, the above discussion implies that the stabilization problem is solvable if each pair is stabilizable. For the cycle graph, even if the pair is unstable, the stabilization problem is solvable as long as the harmonic polynomial of the matrix is stable.
Example 1. Given a system with two agents whose state matrices are as follows:
Clearly, every agent is unstable. is controllable, and . According to Corollary 1, the system can be stabilized by constructing and . Assume is the eigenvalue of , it only needs to satisfy that , then the overall system can be stabilized. So, we can take , and then
Assume that and , then one can get , and .
The decentralized controller can be designed as Figure 2 shows the asymptotical stability of the closed loop system.
Example 2. Consider the heterogeneous multiagent system composed of three agents, and Apparently, every agent is unstable. According to Theorem 2 of , is unstable. In this case, Theorem 2 of  becomes invalid. But the harmonic polynomial, , is stable; according to Theorem 1, the system can be stabilized via harmonic control. Taking , then the decentralized controller can be designed as Figure 3 shows the asymptotical stability of the closed loop system.
In this paper, we have demonstrated the problem of stabilization of heterogeneous multiagent systems via harmonic control. The framework puts emphasis on the ability of systems to stabilize themselves when each agent only uses its neighbors’ state information as feedback. For the overall interconnected system including unstable agents, we have presented that its stabilizability is affected by the structure of the interconnection topology and the interaction of its agents. Under cycle graphs, a sufficient condition and the design of harmonic control interconnection gains are provided. When the graph contains less than 5 nodes, the sufficient and necessary condition for stabilization problem via harmonic control under cycle graph can be given. In future work, the general graphs and the sufficient and necessary condition for stabilization via harmonic control will be considered.
Stabilization without Self-State Feedback of Path, Star and Tree Graphs
Proposition A.1. For a path or star graph, the stabilization problem only via neighbor-state feedback is solvable if and only if each agent is stable.
Proof 5. For a path graph, which is showed in Figure 4(a), the system matrix of the closed loop is
Therefore, the characteristic polynomial of is .
Obviously, the roots of cannot be changed only by neighbor-state feedback. If the path graph has an unstable agent , the roots of are also the roots of . Consequently, the stabilization problem only via neighbor-state feedback is solvable if and only if each agent is stable.
For a star graph, which is showed in Figure 4(b), the system matrix of the closed loop is Similar to the proof of the path graph, if the star graph has an unstable agent, the stabilization problem only via neighbor-state feedback is solvable if and only if each agent is stable.
Proposition A.2. If a graph has at least one unstable node whose indegree or outdegree is equal to zero, then the stabilization problem only via neighbor-state feedback is unsolvable.
Proof 6. Without loss of generality, assume that the indegree of the first vertex is equal to zero and is not stable. Then, is in the form of
where and . Obviously, the roots of are also the roots of . Consequently, the stabilization problem only via neighbor-state feedback is unsolvable.
The case of outdegree is equal to zero can be similarly obtained.
Proposition A.3. For a tree graph, the stabilization problem only via neighbor-state feedback is solvable if and only if each agent is stable.
Proof 7. If the root or one leaf is unstable, by Proposition A.2, the stabilization problem only via neighbor-state feedback is unsolvable.
Suppose that the root and all leaves are stable. Every time we remove a leaf from the tree, what remains is still a tree whose stabilizability is equivalent to the original one. So long as an unstable leaf appears after removing the leaves, the stabilization problem only via neighbor-state feedback is unsolvable by Proposition A.2. Thus, the proof is achieved.
The data used to support the findings of this study are included within the article.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This work was supported by the National Natural Science Foundation of China under Grant nos. 61873136, 61374062, 61603288, and 61673013, the Natural Science Foundation of Shandong Province for Distinguished Young Scholars under Grant no. JQ201419, and the Natural Science Foundation of Shandong Province under Grant no. ZR2016JL022. We would like to thank the referees of this paper for their perceptive and helpful comments.
N. Cai, M. He, Q. Wu, and M. J. Khan, “On almost controllability of dynamical complex networks with noises,” Journal of Systems Science and Complexity, 2017.View at: Google Scholar
H. Kim, H. Shim, J. Back, and J. H. Seo, “Stabilizability of a group of single integrators and its application to decentralized formation problem,” in 2011 50th IEEE Conference on Decision and Control and European Control Conference, pp. 4829–4834, Orlando, FL, USA, 2011.View at: Publisher Site | Google Scholar
Z. S. Duan, L. Huang, J. Z. Wang, and L. Wang, “Harmonic control between two systems,” Acta Automatica Sinica, vol. 29, no. 1, pp. 14–22, 2003.View at: Google Scholar
S. Loizu, D. Dimarogonas, and K. Kyriakopoulos, “Decentralized feedback stabilization of multiple nonholonomic agents,” in IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA ‘04. 2004, vol. 3, pp. 3012–3017, New Orleans, LA, USA, 2004.View at: Publisher Site | Google Scholar
G. James, Advanced Modern Engineering Mathematics, Pearson, Harlow, UK, 3rd edition, 2004.