Switched Dynamics with its ApplicationsView this Special Issue
Delay-Distribution-Dependent Consensus for Second-Order Leader-Follower Nonlinear Multiagent Systems via Pinning Control
This paper investigates the consensus problem for second-order leader-follower nonlinear multiagent systems with general network topologies. A pinning control algorithm is proposed, where it includes time-varying delay information. By using the information of delay-partition and delay-distribution and constructing an appropriate Lyapunov-Krasovskii functional, the consensus criteria are derived to achieve leader-follower consensus for multiagent systems, which are in the form of linear inequalities that can be solved by employing the semidefinite programme method. Moreover, this paper addresses what kind of agents and how many agents should be pinned. Two numerical examples are presented to further demonstrate the effectiveness of the proposed approach.
The coordinated and cooperative control of multiple autonomous vehicles is a problem which has been much researched in recent years due to its applications in the formation control of unmanned air vehicles, the cooperative control of mobile robots, the design of distributed sensor networks, and so on. Particularly, consensus in multiagent systems, which means all the agents can reach an agreement on certain concern or interest, has been extensively studied in the past few years [1–8].
A particularly interesting topic is the consensus of a group of agents with a leader, where the leader is a special agent whose motion is independent of all the other agents and thus is followed by all the other ones, and such a problem is commonly called leader-following consensus problem [9–13]. Leader-following consensus problem is investigated in , and the corresponding conclusion is that if all the agents are jointly connected with their leader, their states would converge to that of the leader. Reference  provides a rigorous proof for the consensus using an extension of LaSalle’s invariance principle. A neighbor-based observer design approach is proposed in  and discusses a group of mobile agents with an active leader moving with an unknown velocity. In , the leader-following consensus problem is considered by designing distributed controllers using local information to ensure that all the agents follow the leader. It is well known that time delay often causes undesirable dynamic behaviors such as oscillation, performance degradation, and instability of the network [14–16]; therefore, various approaches to consensus analysis for multiagent systems with time delay have been investigated in the literature [17, 18]. In , two different cases of coupling topologies are investigated for coordination problem of multiagent system with time-varying coupling delays. Reference  studies the leader-following consensus for a multiagent system with a varying-velocity leader and time-varying delays. However, less consideration has been paid to the delay-dependent consensus conditions for multiagent systems with time-varying delays. It is noted that all physical systems are nonlinear in nature  and that even different agents may have different dynamics. It is very challenging task to discuss consensus problem of nonlinear multiagent systems [20, 21]. Reference  proposes leader-following consensus algorithms based on pinning control for second-order nonlinear multiagent systems and provides a pinned-agent selection scheme to determine what kind of followers and how many followers should be pinned. Considering that it is practically impossible to apply control actions to all agents in a large-scale multiagent system, and some authors develop consensus algorithms based on pinning control [22–25]. It is well known that pinning control is an effective method to solve the problem of nonlinear system, it would be beneficial to apply these control techniques to study the consensus problem of multiagent system. In many practical systems, such as networked control systems, the probability distribution of the time delay in the interval is an important characteristic for the network conditions, and its probability distribution can be measured by the statistical method [26–28]. Therefore, the information of probability distribution of the delay should be employed in the model. To the best of the authors’ knowledge, no result has been reported for the consensus problem for second-order leader-follower nonlinear multiagent systems via pinning control, when both the information of variation range of the time delay and the information of variation probability of the time delay in an interval can be observed, which motivates the present study.
Motivated by the above discussions, in this paper, we investigate the consensus problem for second-order leader-follower nonlinear multiagent systems. Based on the probability distribution of delay, a new type of multiagent system model with stochastic parameters in the coefficient matrices is proposed. A pinning control algorithm is proposed, and the delay-partition-dependent and delay-distribution-dependent consensus criteria are derived by combining delay-partitioning method and Lyapunov-Krasovskii functional method. Moreover, this paper addresses what kind of agents and how many agents should be pinned.
The main contributions of this paper can be summarized as follows. (1) Based on the probability distribution of delay, a novel multiagent system model with stochastic parameters in the coefficient matrices is introduced. (2) The new pinning control algorithm is proposed, and this paper gives what kind of agents and how many agents should be pinned.
The rest of this paper is organized as follows. In Section 2, problem formulation and preliminaries are briefly outlined. In Section 3, the consensus criteria are derived to achieve leader-follower consensus for multiagent systems. In Section 4, two simulation examples are provided to show the advantages of the obtained results, and some conclusions are drawn in Section 5.
Notation. The notation used in the paper is fairly standard. denotes the -dimensional Euclidean space, and is a set of real matrices. The notation (resp., ), for , means that the matrix is real symmetric positive definite (resp., negative definite). stands for a block-diagonal matrix. denotes the Euclidean norm in . The superscript “” stands for matrix transposition. stands for mathematical expectation. The Kronecker product of matrices and is a matrix in and denoted as . In this paper, if not explicitly stated, matrices are assumed to have compatible dimensions.
Let be a weighted diagraph of order , with the set of nodes , an edge set , and a weighted adjacency matrix with nonnegative elements, directed edge in network , is denoted by the ordered pair of nodes , which means that node can receive information from node . The elements of the adjacency matrix are defined as if and only if there is a directed edge in ; otherwise . We assume that for all . The neighbor set of node is defined by , and the in-degree and out-degree of node are defined as A diagraph is called balanced if for all .
The Laplacian matrix associated with the adjacency matrix is defined as which ensures the diffusion property that .
A directed path from node to in is a sequence of edges in the directed graph which is strongly connected if for any two distinct nodes and , there exists a directed path form node to . A directed graph has a directed spanning tree if there exists at least one node called root which has a directed path to all other nodes.
The dynamics of the virtual leader is described by the following second-order nonlinear system: where and are the position and velocity states of the virtual leader, respectively. = is a nonlinear vector-valued continuous bounded function.
The second-order dynamics of multiagent systems consisting of -coupled autonomous agents is given as follows: where and are the position and velocity states of agent , respectively. and are the control inputs for agent to be designed.
Definition 1. The multiagent systems (4) are said to achieve second-order leader-following consensus if, for any initial conditions, the state of each following agent satisfies
Motivated by the coupling rule used in , the consensus algorithm is designed based on pinning control such that all agents in nonlinear multiagent systems (4) can asymptotically follow the virtual leader (3). Without loss of generality, rearrange the order of all agents, and the sort method will be given in Section 3. Let the first agents in multiagent systems (4) be controlled, and the controllers have the following form: where the local feedback gains satisfy and . Also is the bounded time-varying delay, and is a positive scalar.
For notational convenience, we define
Based on (8), the augment system can be obtained as follows:
Setting then the system (9) can be rewritten in the following compact form:
Remark 2. In many practical systems, such as networked control systems, the probability distribution of the delay in the interval is an important characteristic. Inspired by [26–28], in this paper, it is assumed that the probability of the delay appearing in some intervals can be observed. Then new multiagent systems with stochastic time-varying delays can be proposed.
For a given positive integer and a partition , we assume that the probabilities of are known. Define the set
It can easily be seen that , . Define
Assumption 3. Stochastic variable is a distributed sequence with
Remark 4. By some computations, we derived from Assumption 3 that
By using the new functions , system (11) can be rewritten as where
Let denote the family of continuous functions from to . It is not difficult to show that, given any , the system (16) has a unique continuous solution on . Clearly, is a continuous -valued stochastic process on . Let for . Then is a -valued Markov process. Its infinitesimal operator , acting on functional , is defined by
The following lemmas and assumption are needed to derive our main results.
Lemma 5. For matrices , , , and with appropriate dimensions and a positive scalar , by the definition of Kronecker product, the following properties can be proved:
Lemma 6. Let satisfy . If a -valued function is integral on the interval , then
Assumption 7. For the nonlinear function and for all , there exist nonnegative constants and , such that the following inequality holds:
3. Main Results
Theorem 8. Suppose that Assumption 7 holds. Second-order leader-following consensus is achieved under the pinning controllers (6), if for some given positive scalars and there exist some positive matrices , , and a positive such that the following linear matrix inequality holds:where
Proof. Consider the following Lyapunov function candidate:
Taking time derivative of along the trajectory (16) yields where
By Lemma 6, the following inequalities hold:
From (16) and (28), we can obtain
Taking the mathematical expectation on both sides of (30) yields
By Assumption 3, we can obtain the following inequality:
For a given , the following inequality holds based on (32):
It follows from (26)–(33) that where
Let , and the inequality (34) can further be written as where
From (22), we have . That is, , as . Therefore, the states of pinning-controlled multiagent systems (4) globally asymptotically approach state of virtual leader (3). That is, , as . So the second-order leader-following consensus in pinning-controlled multiagent systems (4) is achieved. The proof is completed.
Remark 9. It can be seen from Theorem 8 that the feasibility of (22) dependents on not only and but also the probability distribution of the delay , and more information of time delays is involved (22).
Let us consider one special case. When , then the virtual leader (3) reduces to which indicates that the reference velocity is constant.
Each agent in multiagent systems is described by
The pinning controllers are given as follows: where the parameters are defined in Section 2.
From Theorem 8 and its proof, we have the following corollary.
Corollary 10. For some given positive scalars , there exist some positive matrices , , such that the following linear matrix inequality holds: Then the second-order leader-following consensus is achieved under the adaptive pinning controllers (40). That is, and , as .
Proposition 11 (see ). For a diagraph , let and denote the node set of and the pinned-node set, respectively. All nodes in should have access to the pinned-node set . That is, for any node , one can always find node such that there exists a directed path from node to node .
According to Proposition 11, we give the following procedure to select a set of pinning-agents and to design the parameters .(1)Define a degree-difference vector .(2)Pick all agents with zero in-degrees as pinned agents, and rearrange the remaining agents in descending order according to their degree-differences.(3)Find the minimum number of agents which satisfies (22) or (42), and let .(4)From Theorem 8 and Corollary 10, by using LMI Toolbox in MATLAB, we can obtain .(5)If is not good enough for practical use, add more agents to the pinned-agent set, and repeat STEP (4) until we find proper .
4. Numerical Results
In this section, two numerical examples are given to verify the effectiveness of the proposed pinning control techniques.
Example 12. We consider multiagent systems consisting of six agents described by
where and are the position and velocity states of agent , respectively.
The interaction diagraph of multiagent systems (43) is shown in Figure 1. We examine what agents should be pinned, and note that agent 6 has zero in-degree and that the out-degree of agents 2 is bigger than their in-degree. According to Proposition 11, agent 6 should be pinned first. Because its state is not affected by others, agent 2 can be chosen as pinned candidates, furthermore. Based on the pinned-agent selection scheme, we rearrange six agents and the new order is 6, 2, 4, 5, 3, 1. By some calculation, we can obtain , , for given , and (when , let ; when , let , , , ; when , let , , , , , ). By employing the LMI Toolbox in Theorem 8, we can obtain Table 1, it can be seen that (1) the minimum number of pinned agents is three, and we chose agents 6, 2, and 4 as pinned agents; (2) the allowable upper bound increases with increasing . If we can obtain more information of time delay, it will lead to a larger allowable upper bound of time delay. When we chose agents 6, 2, and 4 as pinned agents, the evolutions of positions and velocities of six agents are shown in Figures 2, 3, 4, and 5.
Example 13. We consider the following multiagent systems consisting of six agents described by
where and are the position and velocity states of agent , respectively.
Similar to Example 12, by using the LMI Toolbox in Corollary 10, we can obtain Table 1. When we chose agents 6, 2, and 4 as pinned agents, the evolutions of positions and velocities of six agents are shown in Figures 6, 7, 8, and 9.
By employing the information of the probability distribution of the time delay, this paper investigates the consensus problem for second-order leader-follower nonlinear multiagent systems with general network topologies. Different from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delay is random and its probability distribution is known a prior. Based on graph theory, a pinning control algorithm is proposed, and the consensus criteria are derived to achieve leader-follower consensus for multiagent systems with nonlinear second-order dynamics. Moreover, this paper addresses what kind of agents and how many agents should be pinned.
This work was jointly supported by National Natural Science Foundation of China under Grant nos. 61272034 and 11301226 and Zhejiang Provincial Natural Science Foundation of China under Grant no. LY13F030012 and LQ13A010017.
F. Sun, Z.-H. Guan, X.-S. Zhan, and F.-S. Yuan, “Consensus of second-order and high-order discrete-time multi-agent systems with random networks,” Nonlinear Analysis: Real World Applications, vol. 13, no. 5, pp. 1979–1990, 2012.View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
H. K. Khalil and J. W. Grizzle, Nonlinear Systems, Prentice hall, 1992.