Output containment analysis and design for high‐order linear time‐invariant swarm systems

Output containment analysis and design problems for high‐order linear time‐invariant swarm systems are dealt with. Firstly, output containment protocols are presented for leaders and followers, respectively, to partially assign the output motion modes of leaders and propel the outputs of followers to converge to the convex hull formed by the outputs of leaders. Then, output containment problems for swarm systems are transformed into stability problems, and sufficient conditions for swarm systems to achieve output containment are proposed. Moreover, an approach to determine the gain matrix in the protocol for swarm systems to achieve output containment is given, which has less calculation complexity. Finally, numerical simulations are presented to demonstrate theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.     

Containment analysis and design for high‐order linear time‐invariant singular swarm systems with time delays

Containment analysis and design problems for high‐order linear time‐invariant singular swarm systems on directed graphs with time delays are investigated. To eliminate impulse terms in singular swarm systems and ensure that the singular swarm systems can achieve containment, time‐delayed protocols are presented for leaders and followers, respectively. By model transformation, containment problems of singular swarm systems are converted into stability problems of multiple low‐dimensional time‐delayed systems. In terms of linear matrix inequality, sufficient conditions are presented for time‐delayed singular swarm systems to achieve containment, which are independent of the number of agents. By using the method of changing variables, an approach is provided to determine the gain matrices in the protocols. Numerical simulations are shown to demonstrate theoretical results. Copyright © 2012 John Wiley & Sons, Ltd.     

Containment control of multi‐agent systems by exploiting the control inputs of neighbors

This paper studies the containment control problem for multi‐agent systems consisting of multiple leaders and followers connected as a network. The objective is to design control protocols so that the leaders will converge to a certain desired formation while the followers converge to the convex hull of the leaders. A novel protocol is proposed by exploiting the control input information of neighbors. Both continuous‐time and discrete‐time systems are considered. For continuous‐time systems, it is proved that the protocol is robust to any constant delays of the neighbors' control inputs. For discrete‐time systems, a sufficient condition on the feedback gain for the containment control is given in terms of the time delay and graph information. Some numerical examples are given to demonstrate the results. Copyright © 2013 John Wiley & Sons, Ltd.     

Admissible consensus analysis for high‐order linear singular swarm systems with multiple time‐varying delays and topology variances

Admissible consensus analysis problems for high‐order linear time‐invariant singular swarm systems with multiple time delays and time‐varying interaction topologies are investigated. First, necessary and sufficient conditions for admissible consensus are presented, and admissible consensus problems are transformed into admissible problems of multiple lower dimensional singular systems. Then, on the basis of the first equivalent form, explicit expressions of consensus functions are given, where the impacts of initial states of agents and protocols, time delays and topology variances are determined, respectively. Moreover, it is shown that if interaction topologies are balanced, then swarm systems with the same initial states but different interaction topologies and different time delays have an identical consensus function. Finally, numerical simulations are given to demonstrate theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.     

Distributed containment control of multi‐agent systems with general linear dynamics in the presence of multiple leaders

This paper considers the containment control problems for both continuous‐time and discrete‐time multi‐agent systems with general linear dynamics under directed communication topologies. Distributed dynamic containment controllers based on the relative outputs of neighboring agents are constructed for both continuous‐time and discrete‐time cases, under which the states of the followers will asymptotically converge to the convex hull formed by those of the leaders if, for each follower, there exists at least one leader that has a directed path to that follower. Sufficient conditions on the existence of these dynamic controllers are given. Static containment controllers relying on the relative states of neighboring agents are also discussed as special cases. Copyright © 2011 John Wiley & Sons, Ltd.     

Practical time‐varying formation tracking for high‐order nonlinear multiagent systems with multiple leaders based on the distributed disturbance observer

Practical time‐varying formation tracking analysis and design problems for high‐order nonlinear multiagent systems with directed interaction topologies are investigated by using the distributed disturbance observer, where the time‐varying formation tracking error can be controlled within an arbitrarily small bound. Different from the previous work, there exists a predefined time‐varying formation formed by the states of the followers and the formation tracks the convex combination of the states of the leaders with unknown control inputs. Besides, the leaders can be multiple, and the dynamics of each follower has heterogeneous nonlinearity and disturbance. First, a distributed disturbance observer‐based practical time‐varying formation tracking protocol is constructed using neighboring relative information, where only a part of the followers, which are named as well‐informed ones, are required to obtain the information of the multiple leaders. The proposed protocol can process the heterogeneous nonlinearity, the disturbance of each follower, and the unknown control inputs of the leaders simultaneously. Then, an algorithm with 2 steps is presented to design the practical time‐varying formation tracking protocol by solving an algebraic Riccati equation and an algebraic equation, where the time‐varying formation tracking feasibility condition is introduced. Moreover, the stability of the closed‐loop multiagent system under the proposed protocol is proved by using the properties of the Laplacian matrix and the Lyapunov stability theory. Finally, a numerical simulation example is provided to illustrate the effectiveness of the obtained theoretical results.     

Output containment control for swarm systems with general linear dynamics: A dynamic output feedback approach

Output containment control problems for high-order linear time-invariant swarm systems under directed interaction topologies are investigated using a dynamic output feedback approach. Firstly, to propel the outputs of followers to converge to the convex hull formed by the outputs of leaders, a dynamic output containment protocol is presented. Then necessary and sufficient conditions for swarm systems to achieve output containment are proposed. To ensure the scalability of the criteria, a sufficient condition which only includes two linear matrix inequality constraints independent of the number of agents is further presented. Moreover, an approach independent of the number of agents is proposed to determine the gain matrices in the dynamic output containment protocols. Finally, numerical simulations are presented to demonstrate theoretical results.     

Distributed adaptive formation tracking for heterogeneous multiagent systems with multiple nonidentical leaders and without well‐informed follower

This paper studies the time‐varying output formation tracking (OFT) problems for linear heterogeneous multiagent systems with multiple leaders, where both the followers and the leaders can have nonidentical dynamics and dimensions. The existing results on formation tracking with multiple leaders depend on the assumption that each follower is well‐informed or uninformed, where the well‐informed follower has all the leaders as its neighbor. To remove this assumption, a novel OFT approach is presented using a distributed observer scheme. Firstly, based on the local estimation and the interaction with neighboring followers, a fully distributed observer is designed for each follower to estimate the dynamical matrices and the states of multiple leaders without requiring the well‐informed follower assumption. The convergence of the distributed observer is proved by using Lyapunov theory. Then, an adaptive algorithm is proposed to solve the regulator equations in finite time based on the estimation of the leaders' dynamical matrices. Furthermore, the desired time‐varying output formation of each follower is generated by a local active exosystem. A time‐varying OFT protocol is presented using the estimated states of multiple leaders, the online solutions of the regulator equations, and the desired formation vector generated by the local exosystem. It is proved that the outputs of the followers can not only realize the expected formation shape but also track the predefined convex combination of multiple leaders. Finally, a simulation example is given to verify the theoretical results.     

Formation‐containment control of networked collision‐free Lagrangian systems

The distributed formation‐containment (DFC) problem under a directed graph is addressed for networked Euler‐Lagrange systems. First, using a leader‐follower framework, the DFC problem is properly defined. For the leaders and the followers, respectively, a DFC control law is next proposed without using velocity information. Based on the artificial potential function, all the agents can achieve the control objective satisfactorily while avoiding collisions with others as well as the obstacles in the environment. By the Lyapunov stability theory, the boundedness of the error signals is guaranteed. Simulations are finally given to show the feasibility of this approach.     

Distributed Containment Control for Nonlinear Multi‐Agent Systems with Time‐Delayed Protocol

In this paper, the containment control problem is considered for nonlinear multi‐agent systems with directed communication topology. Under the guidance of designed distributed communication protocols with/without previous state information, the followers are expected to converge to a dynamic convex hull spanned by multiple leaders. Two multi‐step algorithms are proposed to construct the corresponding protocols, the state feedback protocol and the delay‐coupled protocol, under which the containment control can be achieved asymptotically. Furthermore, it is found that the delay‐coupled protocol is rather sensitive to time delays. That is, real‐time tracking will become impossible by only using long‐dated previous state information. Finally, a numerical example is given to demonstrate the applicability and efficiency of the proposed schemes.     

Distributed finite‐time containment control for multiple Euler‐Lagrange systems with communication delays

In this paper, distributed finite‐time containment control for multiple Euler‐Lagrange systems with communication delays and general disturbances is investigated under directed topology by using sliding‐mode control technique. We consider that the information of dynamic leaders can be obtained by only a portion of the followers. Firstly, a nonsingular fast terminal sliding surface is selected to achieve the finite‐time convergence for the error variables. Then, a distributed finite‐time containment control algorithm is proposed where the neural network is utilized to approximate the model uncertainties and external disturbances of the systems. Furthermore, considering that error constraint method can improve the performance of the systems, a distributed finite‐time containment control algorithm is developed by transforming the error variable into another form. It is demonstrated that the containment errors are bounded in finite time by using Lyapunov theory, graph theory, and finite‐time stability theory. Numerical simulations are provided to show the effectiveness of the proposed methods.     

Adaptive Leader‐Following Consensus for Uncertain Nonlinear Multi‐Agent Systems

This paper is concerned with the adaptive leader‐following consensus for first‐ and second‐order uncertain nonlinear multi‐agent systems (NMASs) with single‐ and double‐integrator leader, respectively. Remarkably, the control coefficients of the followers need not belong to any known finite interval, which makes the systems in question essentially different from those in the related works. Moreover, parameterized unknowns exist in the nonlinearities of the followers, and unknown control input is imposed on the leader, which make the problems difficult to solve. To compensate for these uncertainties/unknowns, the leader‐following consensus protocols are constructed by employing adaptive technique for the first‐order and the second‐order NMASs. Under the designed adaptive consensus protocols and the connected graph, the leader‐following consensus is achieved. Finally, two examples are given to show the effectiveness of the proposed leader‐following consensus protocols.     

Consensus analysis for leader‐following multi‐agent systems with second‐order individual dynamics and arbitrary sampling

This paper performs a consensus analysis of leader‐following multi‐agent systems with multiple double integrators in the framework of sampled‐data control. Both single‐leader and multiple‐leader scenarios are considered under the assumption of networks with detectable position‐like state information. The coordination tasks are accomplished by a given protocol with the robustness against the change of sampling periods. The sampling periods can be chosen to be of an arbitrary fixed length or large time‐varying length. Under the proposed protocol, we achieve two objectives: (i) in the single leader‐subgroup case, all followers reach an agreement with leaders on states asymptotically and (ii) in the multiple leader‐subgroup case, each follower converges to some convex combination of the final states of all leaders. It is shown that the final state configuration of the convex combination is uniquely determined by the underlying interaction topology, which can be any weakly connected graph. Compared with the existing results on leader‐following networks, the consensus problem and the containment problem are solved in a unified framework with large sampling periods. Some numerical experiments are conducted to illustrate the dynamic behavior of all agents with this protocol. Copyright © 2017 John Wiley & Sons, Ltd.     

Containment control of linear multi‐agent systems with multiple leaders of bounded inputs using distributed continuous controllers

This paper considers the containment control problem for multi‐agent systems with general linear dynamics and multiple leaders whose control inputs are possibly nonzero and time varying. Based on the relative states of neighboring agents, a distributed static continuous controller is designed, under which the containment error is uniformly ultimately bounded and the upper bound of the containment error can be made arbitrarily small, if the subgraph associated with the followers is undirected and, for each follower, there exists at least one leader that has a directed path to that follower. It is noted that the design of the static controller requires the knowledge of the eigenvalues of the Laplacian matrix and the upper bounds of the leaders’ control inputs. In order to remove these requirements, a distributed adaptive continuous controller is further proposed, which can be designed and implemented by each follower in a fully distributed fashion. Extensions to the case where only local output information is available and to the case of multi‐agent systems with matching uncertainties are also discussed. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive fault‐tolerant time‐varying formation tracking for multiagent systems with multiple leaders

In this paper, an adaptive fault‐tolerant time‐varying formation control problem for nonlinear multiagent systems with multiple leaders is studied against actuator faults and state‐dependent uncertainties. Simultaneously, the followers form a predefined formation while tracking reference signal determined by the convex combination of the multiple leaders. Based on the neighboring relative information, an adaptive fault‐tolerant formation time‐varying control protocol is constructed to compensate for the influences of actuator faults and model uncertainties. In addition, the updating laws can be adjusted online through the adaptive mechanism, and the proposed control protocol can guarantee that all the signals in the closed‐loop systems are bounded. Lyapunov‐like functions are addressed to prove the stability of multiagent systems. Finally, two examples are provided to demonstrate the effectiveness of the theoretical results.     

Adaptive iterative learning control for coordination of second‐order multi‐agent systems

In this paper, an efficient framework is proposed to the consensus and formation control of distributed multi‐agent systems with second‐order dynamics and unknown time‐varying parameters, by means of an adaptive iterative learning control approach. Under the assumption that the acceleration of the leader is unknown to any follower agents, a new adaptive auxiliary control and the distributed adaptive iterative learning protocols are designed. Then, all follower agents track the leader uniformly on [0,T] for consensus problem and keep the desired distance from the leader and achieve velocity consensus uniformly on [0,T] for the formation problem, respectively. The distributed multi‐agent coordinations performance is analyzed based on the Lyapunov stability theory. Finally, simulation examples are given to illustrate the effectiveness of the proposed protocols in this paper.Copyright © 2013 John Wiley & Sons, Ltd.     

Distributed Fixed‐Time Coordinated Tracking for Nonlinear Multi‐Agent Systems Under Directed Graphs

This paper is concerned with the fixed‐time coordinated tracking problem for a class of nonlinear multi‐agent systems under detail‐balanced directed communication graphs. Different from conventional finite‐time coordinated tracking strategies, the fixed‐time approach developed in this paper guarantees that a settling time bound is prescribed without dependence on initial states of agents. First, for the case of a single leader, a distributed protocol based on fixed‐time stability techniques is proposed for each follower to accomplish the consensus tracking in a fixed time. Second, in the presence of multiple leaders, a new distributed protocol is proposed such that states of followers converge to the dynamic convex hull spanned by those of leaders in a fixed time. In addition, for a class of linear multi‐agent systems, sufficient conditions that guarantee the fixed‐time coordinated tracking are provided. Finally, numerical simulations are given to demonstrate the effectiveness of the theoretical results.     

Admissible Consensus of Multi‐Agent Singular Systems

Consensus problems are studied for both continuous‐time and discrete‐time multi‐agent singular systems with time‐invariant and directed communication topologies. Under restricted system equivalence of singular agents, sufficient and necessary conditions are obtained for admissible consensus ability with static protocols, which are based on both the relative information of the dynamic states and the absolute information of the static states. For a network of continuous‐time singular systems, the existence of admissible consensualization can be cast into strong stabilizability of the agent dynamics. Once discrete‐time multi‐agent singular systems satisfy the condition of reaching nontrivial final consensus states, strong stabilizability is a sufficient condition to achieve admissible consensualization. Two algorithms are proposed to construct two protocols, which are based on a linear matrix inequality and a modified Riccati equation, respectively. Finally, the algorithms are illustrated by two simulation examples.     

A low‐complexity design for distributed containment control of networked pure‐feedback systems and its application to fault‐tolerant control

This paper addresses a low‐complexity distributed containment control problem and its extension to fault‐tolerant control for networked nonlinear pure‐feedback systems under a directed graph. The multiple dynamic leaders are neighbors of only a subset of the followers described by completely non‐affine multi‐input multi‐output pure‐feedback dynamics. It is assumed that all followers' nonlinearities are heterogeneous and unknown. The proposed containment controller is implemented by using only error surfaces integrated by performance bounding functions and does not require any differential equations for compensating uncertainties and faults. Thus, compared with the previous containment control approaches for multi‐agent systems with unknown non‐affine nonlinearities, the distributed containment control structure is simplified. In addition, it is shown that the proposed control scheme can be applied to the fault‐tolerant containment control problem in the presence of unexpected system and actuator faults, without reconstructing any control structure. It is shown from Lyapunov stability theorem that all followers nearly converge to the dynamic convex hull spanned by the dynamic leaders and the containment control errors are preserved within certain given predefined bounds. Copyright © 2016 John Wiley & Sons, Ltd.     

Exponential Consensus for Nonlinear Multi‐Agent Systems with Communication and Input Delays via Hybrid Control

This paper aims to investigate the exponential leader‐following consensus for nonlinear multi‐agent systems with time‐varying communication and input delays by using hybrid control. Based on the Lyapunov functional method, impulsive differential equation theory and matrix analysis, we show that all the followers can achieve leader‐following consensus with the virtual leader exponentially even if only a fraction of followers can obtain the leader's information. Two classes of exponential consensus criteria as well as the convergence rates for the controlled multi‐agent systems are presented under very relaxed interaction topology conditions, i.e., the directed interaction topology among the followers is only required to have p(p>1) disjoint strong components. Finally, two numerical examples are given to validate the proposed theoretical results.