Consensus for multi‐agent systems under double integrator dynamics with time‐varying communication delays

In this paper, the consensus control problems for multi‐agent systems under double integrator dynamics with time‐varying communication delays are investigated. We assume that the interaction graphs among agents are directed. Two kinds of protocols are considered. One is an absolute damping protocol, and the other is a relative damping protocol. For the first protocol, Lyapunov–Razumikhin functional techniques are used. We derive sufficient conditions that guarantee that all agents asymptotically reach consensus under fixed topology and switching topology, respectively. Moreover, the allowable upper bound for communication delays is given. For the second protocol, Lyapunov–Krasovskii functional techniques are used. Linear matrix inequality (LMI)‐form sufficient conditions are obtained to guarantee the consensus problems to be solved under fixed topology and switching topology, respectively. The allowable upper bound for communication delays is given as well. The feasibilities of the demanded LMIs are also discussed. Finally, numerical simulations are provided to illustrate the effectiveness of our theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Group consensus control for double‐integrator dynamic multiagent systems with fixed communication topology

The problem of group consensus is investigated in this paper, where all agents possess double‐integrator dynamics. Two different kinds of consensus protocols are proposed for networks with fixed communication topology to reach group consensus for the agents’ positions and velocities. Convergence analysis is discussed, and necessary and/or sufficient conditions are presented for multiagent systems to achieve group consensus. The first protocol leads to dynamic consensus where positions of all agents reach time‐varying consensus values. By applying the second protocol, both the agents’ positions and their velocities reach constant consensus values. That is, static consensus is achieved. Simulation examples are given to show the effectiveness of the theoretical results.Copyright © 2012 John Wiley & Sons, Ltd.     

Consensus in multi‐agent systems with communication constraints

The problem of second‐order consensus is investigated in this paper for a class of multi‐agent systems with a fixed directed topology and communication constraints where each agent is assumed to share information only with its neighbors on some disconnected time intervals. A novel consensus protocol designed based on synchronous intermittent local information feedback is proposed to coordinate the states of agents to converge to second‐order consensus under a fixed strongly connected topology, which is then extended to the case where the communication topology contains a directed spanning tree. By using tools from algebraic graph theory and Lyapunov control approach, it is proved that second‐order consensus can be reached if the general algebraic connectivity of the communication topology is larger than a threshold value and the mobile agents communicate with their neighbors frequently enough as the network evolves. Finally, a numerical example is simulated to verify the theoretical analysis. Copyright © 2011 John Wiley & Sons, Ltd.     

Consensus of heterogeneous first‐ and second‐order multi‐agent systems with directed communication topologies

In this paper, we consider the consensus problem for heterogeneous multi‐agent systems composed of some first‐order and some second‐order dynamic agents in directed communication graphs. Consensus protocols are proposed for the second‐ and first‐order dynamic agents, respectively. Under certain assumptions on the control parameters, for fixed communication topologies, necessary and sufficient conditions for consensus are given, and the consensus values of all agents are established. For switching topologies, sufficient conditions are given for all agents to reach consensus. Finally, simulation examples are presented to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

This paper investigates the distributed scaled consensus problem of multiple agents with high‐order dynamics under the asynchronous setting, where each agent measures the neighbors' information at certain discrete time instants according to its own clock rather than the whole discrete process and all agents' clocks are independent of each other. Assume that the communication topology can be arbitrarily switched and the information transfer between agents has a time‐varying delay. Under the designed asynchronous distributed control protocol, it is shown that the agents with the same scale will reach a common final state, while the agents with different scales will reach different final states. Moreover, an effective parameters selection strategy is presented for a large number of gain parameters in high‐order multiagent systems based on novel model transformation techniques. Simulation examples are provided to demonstrate the high‐order scaled consensus performances for the agents in the presence of asynchronous setting.     

Distributed consensus of discrete‐time multi‐agent systems with multiplicative noises

In this paper, we consider the consensus problem of discrete‐time multi‐agent systems with multiplicative communication noises. Each agent can only receive information corrupted by noises from its neighbors and/or a reference node. The intensities of these noises are dependent on the relative states of agents. Under some mild assumptions of the noises and the structure of network, consensus is analyzed under a fixed topology, dynamically switching topologies and randomly switching topologies, respectively. By combining algebraic graph theory and martingale convergence theorem, sufficient conditions for mean square and almost sure consensus are given. Further, when the consensus is achieved without a reference, it is shown that the consensus point is a random variable with its expectation being the average of the initial states of the agents and its variance being bounded. If the multi‐agent system has access to the state of the reference, the state of each agent can asymptotically converge to the reference. Numerical examples are given to illustrate the effectiveness of our results. Copyright © 2014 John Wiley & Sons, Ltd.     

Bounded consensus tracking for sampled‐data second‐order multi‐agent systems with fixed and Markovian switching topology

This paper studies the bounded consensus tracking problems of second‐order multi‐agent systems with fixed and Markovian switching topology in a sampling setting. It is assumed that all the agents can only obtain the approximative value of the leader's acceleration instead of the actual value. Moreover, only a portion of agents can have the access to the leader and obtain the leader's position and velocity directly. By virtue of matrix analysis and perturbation theory, we present necessary and sufficient conditions for boundedness of tracking error system and show the ultimate bound of tracking errors under fixed and Markovian switching topology, respectively. Finally, a simulation example is given to illustrate the effectiveness of the results. Copyright © 2013 John Wiley & Sons, Ltd.     

Finite‐Time Consensus Problem for Second‐Order Multi‐Agent Systems Under Switching Topologies

This paper investigates the finite‐time consensus problem for multi‐agent systems with second‐order individual dynamics under switching topologies. A distributed continuous‐time protocol is designed to guarantee finite‐time consensus for homogeneous agents without predetermined leaders, i.e., it ensures agents asymptotically converge to an average consensus within finite time, even if the interaction topology among them is time‐varying but stepwise jointly‐connected. In particular, it introduces a distributed continuous‐time protocol to reach consensus in finite time and reduce the chattering together. Finally, the simulation results are also given to validate the proposed approach.     

Robust and nonfragile consensus of positive multiagent systems via observer‐based output‐feedback protocols

This article investigates the consensus problem for positive multiagent systems via an observer‐based dynamic output‐feedback protocol. The dynamics of the agents are modeled by linear positive systems and the communication topology of the agents is expressed by an undirected connected graph. For the consensus problem, the nominal case is studied under the semidefinite programming framework while the robust and nonfragile cases are investigated under the linear programming framework. It is required that the distributed state‐feedback controller and observer gains should be structured to preserve the positivity of multiagent systems. Necessary and/or sufficient conditions for the analysis of consensus are obtained by using positive systems theory and graph theory. For the nominal case, necessary and sufficient conditions for the codesign of state‐feedback controller and observer of consensus are derived in terms of matrix inequalities. Sufficient conditions for the robust and nonfragile consensus designs are derived and the codesign of state‐feedback controller and observer can be obtained in terms of solving a set of linear programs. Numerical simulations are provided to show the effectiveness and applicability of the theoretical results and algorithms.     

Gain‐scheduled leader‐follower tracking control for interconnected parameter varying systems

This paper considers the gain‐scheduled leader‐follower tracking control problem for a parameter varying complex interconnected system with directed communication topology and uncertain norm‐bounded coupling between the agents. A gain‐scheduled consensus‐type control protocol is proposed and a sufficient condition is obtained, which guarantees a suboptimal bound on the system tracking performance under this protocol. An interpolation technique is used to obtain a protocol schedule, which is continuous in the scheduling parameter. The effectiveness of the proposed method is demonstrated using a simulation example. Copyright © 2015 John Wiley & Sons, Ltd.     

Distributed Consensus of Third‐order Multi‐agent Systems with Communication Delay

This paper studies the consensus problem for a class of general third‐order multi‐agent systems on an undirected connected network. By employing a variables transformation, the consensus control problem can be turned into a asymptotical stability problem. Then we present a necessary and sufficient condition for guaranteeing consensus by using Routh‐Hurwitz stability criterion. And this result can be applied to a special case of third‐order integrator systems. Also we will present a tolerable communication time delay for third‐order integrator systems under the assumption that multi‐agent systems can reach consensus without communication delay.     

Distributed consensus of multi‐agent systems with general linear node dynamics and intermittent communications

Without assuming that the mobile agents can communicate with their neighbors all the time, the consensus problem of multi‐agent systems with general linear node dynamics and a fixed directed topology is investigated. To achieve consensus, a new class of distributed protocols designed based only on the intermittent relative information are presented. By using tools from matrix analysis and switching systems theory, it is theoretically shown that the consensus in multi‐agent systems with a periodic intermittent communication and directed topology containing a spanning tree can be cast into the stability of a set of low‐dimensional switching systems. It is proved that there exists a protocol guaranteeing consensus if each agent is stabilizable and the communication rate is larger than a threshold value. Furthermore, a multi‐step intermittent consensus protocol design procedure is provided. The consensus algorithm is then extended to solve the formation control problem of linear multi‐agent systems with intermittent communication constraints as well as the consensus tracking problem with switching directed topologies. Finally, some numerical simulations are provided to verify the effectiveness of the theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.     

Controllability of switching networks of multi‐agent systems

This paper addresses the controllability of a switching network of multi‐agent systems with a leader obeying nearest‐neighbor communication rules. The leader is a particular agent acting as an external input to control other member agents. Some computationally efficient sufficient conditions for such multi‐agent systems to be controllable are derived. The results show that a multi‐agent system can be controllable even if each of its subsystem is not controllable, by appropriately selecting one of the agents as the leader and suitably designing the neighbor‐interaction rules via a switching topology. The fixed topology case is analyzed and new controllability conditions and formula of inputs for the desired formation of the network are presented. The controllability of a switching network of multi‐agent systems in the presence of communication delay is also investigated. Examples with numerical simulations are given to illustrate the theoretical results. Copyright © 2011 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.     

Consensus of Fractional‐Order Uncertain Multi‐Agent Systems Based on Output Feedback

This paper is devoted to the consensus protocol design for a set of agents with fractional‐order uncertainty dynamics where the fractional order α satisfies 0 < α < 2. For multi‐agent systems (MASs) with fixed undirected topology, a distributed static output feedback protocol is proposed with an undetermined system matrix. Based on model transformation and fractional‐order stability theory, sufficient conditions are derived to ensure the consensus of MASs in terms of linear matrix inequalities (LMIs). Finally, a simulation example is employed to validate the effectiveness of the proposed consensus protocol.     

Coordination of discrete‐time multi‐agent systems via relative output feedback

This paper investigates the joint effects of agent dynamic and network topology on the consensusability of linear discrete‐time multi‐agent systems via relative output feedback. An observer‐based distributed control protocol is proposed. A necessary and sufficient condition for consensusability under this control protocol is given, which explicitly reveals how the intrinsic entropy rate of the agent dynamic and the eigenratio of the undirected communication graph affect consensusability. As a special case, multi‐agent systems with discrete‐time double integrator dynamics are discussed where a simple control protocol directly using two‐step relative position feedback is provided to reach a consensus. Finally, the result is extended to solve the formation and formation‐based tracking problems. The theoretical results are illustrated by simulations. Copyright © 2010 John Wiley & Sons, Ltd.     

“Kronecker Basis” Based Average Consensus Analyses for High‐Order Linear Multi‐Agent Systems with Multiple Time Delays

This paper investigates the average consensus for multi‐agent systems governed by high‐order linear dynamics with multiple time delays. Necessary and sufficient conditions for high‐order average consensus under balanced communication topology are provided by using a newly defined mathematical concept – the Kronecker basis. Furthermore, previous studies for average consensus governed by first‐order, or high‐order integrator can be regarded as special cases of our results. Simulation results are employed to demonstrate the effectiveness of our results for high‐order average consensus.     

Social Learning in Networks with Time‐Varying Topologies

Recently, Jadbabaie et al. presented a social learning model, where agents update beliefs by combining Bayesian posterior beliefs based on personal observations and weighted averages of the beliefs of neighbors. For a network with a fixed topology, they provided sufficient conditions for all of the agents in the network to learn the true state almost surely. In this paper, we extend the model to networks with time‐varying topologies. Under certain assumptions on weights and connectivity, we prove that agents eventually have correct forecasts for upcoming signals and all the beliefs of agents reach a consensus. In addition, if there is no state that is observationally equivalent to the true state from the point of view of all agents, we show that the consensus belief of agents eventually reflects the true state.     

Fixed‐time output‐feedback consensus tracking control for second‐order multiagent systems

This paper is concerned with the problem of fixed‐time consensus tracking control for a class of second‐order multiagent systems under an undirected communication graph. A distributed output‐feedback fixed‐time consensus tracking control scheme is proposed to make the states of all individual agents simultaneously track a time‐varying reference state even when the reference state is available only to a subset of the group members and only output measurements are available for feedback. Homogeneous Lyapunov function and homogeneity property are employed to show that the control scheme can guarantee the consensus tracking errors converging the origin in finite time which is bounded by a fixed constant independent of initial conditions. Numerical simulations are carried out to demonstrate the effectiveness of the proposed control law.     

A New Observer‐Type Consensus Protocol for Linear Multi‐Agent Dynamical Systems

The consensus problem is investigated in this paper for a class of multi‐agent systems with general linear node dynamics and directed communication topologies. A new distributed observer‐type consensus protocol is designed based only on the relative output measurements of neighboring agents. Compared with existing observer‐type protocols, the one presented here does not require information about the relative states of the observers. Tools from small gain theory and matrix analysis, some sufficient conditions are obtained for achieving consensus in such multi‐agent systems where the underlying network topology contains a directed spanning tree. Finally, some numerical examples including an application in low‐Earth‐orbit satellite formation flying are provided to illustrate the theoretical results.