A decoupled designing approach for sampling consensus of multi‐agent systems

This paper introduces the motion‐planning approaches to solve the distributed consensus problems via sampling measurements. First, for first‐order multiagent systems, a class of sampled‐data–based algorithms are developed with arbitrary sampling periods, which solve the asymptotic consensus problem under both directed fixed and random switching topologies. Then, a new kind of distributed consensus algorithms is designed based on sampling measurements for second‐order multiagent systems. Under both the directed fixed and periodical switching topologies, asymptotic consensus problems of second‐order multiagent systems can be solved by using the proposed algorithms. Compared with existing continuous‐time consensus algorithms, one of remarkable advantages of proposed algorithms is that the sampling periods, communication topologies, and control gains are decoupled and can be separately designed, which relaxes many restrictions in controller designs. Finally, some numerical examples are given to illustrate the effectiveness of the analytical results.     

Observer‐based consensus control of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks

This article investigates the leader‐following consensus of nonlinear multiagent systems under semi‐Markovian switching topologies and cyber attacks. Unlike the related works, the communication channels considered herein are subjected to successful but recoverable attacks, and when the channels work well, the network topology is time‐varying and described by a semi‐Markovian switching topology. Due to the effect of attacks, the communication network is intermittently paralyzed. For the cases that the transition rates of semi‐Markovian switching topologies are completely known and partially unknown, observer‐based control protocols and sufficient conditions are proposed, respectively, to ensure the consensus of the systems in the mean square sense. Finally, simulation examples are given to illustrate the validity of the theoretical results.     

Formation control of singular multiagent systems with switching topologies

This paper is concerned with the time‐varying formation control problem for singular multiagent systems with switching topologies. First, in order to eliminate the pulse solution of singular systems and extend the formation function set, the distributed formation controller has been formulated based on the output information of the agents. Then, the explicit expression of formation position function is presented based on the impulse free and the equivalent transformation of singular multiagent systems. Next, the sufficient and necessary conditions of the feasibility of the formation function are provided. Moreover, the sufficient conditions of formation control of singular multiagent systems with switching topologies are presented and the algorithm is designed to solve the distributed controller. Finally, the validity of the proposed approaches is verified by numerical simulation in this paper.     

Disturbance observer–based consensus tracking for nonlinear multiagent systems with switching topologies

This paper considers the leader‐follower consensus tracking problem for nonlinear multiagent systems with external disturbances and switching topologies. A distributed disturbance observer is constructed to estimate the disturbances suffered by the followers. Then, a distributed consensus protocol is proposed for the consensus tracking problem with disturbance rejection under a fixed directed topology based on the disturbance observer. Next, this result is extended to the case in which the switching communication topology only frequently but not always contains a directed spanning tree. By selecting the parameters appropriately such that the communication time satisfies various preset conditions, it is theoretically proven that the consensus tracking with disturbance rejection can also be achieved by the multiagent systems. Finally, a simulation example is presented to demonstrate the performance of the proposed control scheme.     

Mean square leader-following consensus of heterogeneous multi-agent systems with Markovian switching topologies and communication delays

This article considers the mean square leader-following output consensus problem of heterogeneous multi-agent systems under randomly switching topologies and time-varying communication delays. By modeling the switching topologies as a time-homogeneous Markov process and taking the communication delays into consideration, a distributed observer is proposed to estimate the state of the leader. A novel distributed output feedback controller is then designed. By constructing a novel switching Lyapunov functional, an easily-verifiable sufficient condition to achieve the mean square leader-following output consensus is given. Finally, two simulation examples are presented to show the effectiveness of the proposed control scheme.     

Consensus of multiagent systems with random switching topologies and its application

This paper is concerned on the consensus problem of multiagent systems with random switching topologies, where the dwell time of each topology consists of fixed and random parts. Firstly, the consensus analysis of such multiagent systems is considered by a mode‐dependent Lyapunov function approach, whose conditions are developed in terms of linear matrix inequalities. Then, three kinds of consensus protocols based on random switching topologies are proposed, whose differences are also illustrated. Moreover, all the existence conditions of such consensus controllers are presented with solvable forms, where the dwell times and topology are both included and play important roles. Finally, the proposed consensus protocols are applied to a chemical process to demonstrate the effectiveness of the proposed methods.     

Distributed nonlinear control algorithms for network consensus

In this paper, we develop a thermodynamic framework for addressing consensus problems for nonlinear multiagent dynamical systems with fixed and switching topologies. Specifically, we present distributed nonlinear static and dynamic controller architectures for multiagent coordination. The proposed controller architectures are predicated on system thermodynamic notions resulting in controller architectures involving the exchange of information between agents that guarantee that the closed-loop dynamical network is consistent with basic thermodynamic principles.     

Sampled‐data consensus of multiagent systems with switching jointly connected topologies via time‐varying Lyapunov function approach

Consensus problem of multiagent systems with switching jointly connected topologies under sampled‐data control is studied in this article. The main contribution is that the consensus problem for such system is solved without the assumption that the system matrices are stable or critically stable. For this purpose, a time‐varying Lyapunov function method is utilized to describe the state characteristics with switching jointly connected topologies. Based on the time‐varying matrix of Lyapunov function, the “decline” characteristics at the switching instants is derived to compensate the divergence among the agents with disconnected topologies. Utilizing the “decline” characteristics, the overall consensus of such system can be guaranteed in the framework of dwell time. Finally, the effectiveness of the proposed result is illustrated by two numerical examples.     

Event‐triggered output consensus for heterogeneous multiagent systems with fixed and switching directed topologies

This paper studies the event‐triggered output consensus problem of heterogeneous linear multiagent systems characterized via fixed and switching directed graphs. With proper state‐dependent triggering functions, two new event‐triggered output consensus control schemes are proposed for each agent to achieve consensus. Notably, under the proposed control protocols, continuous communication among agents is not required in both controllers updating and triggering threshold detection, which means being completely continuous communication free. The communication instances are reduced significantly, and the periodic or high‐frequency communication is restrained. It is also ensured that events cannot be triggered infinitely in finite time (ie, the Zeno behavior is elegantly avoided). Meanwhile, the simulation examples are given to illustrate the theoretical analysis.     

Cooperative output regulation of heterogeneous multiagent systems based on event‐triggered control with fixed and switching topologies

This paper addresses the cooperative output regulation problem of multiagent systems with fixed and switching topologies. Each agent is a heterogeneous linear system, and the output of the exosystem can be available to only a subset of agents. For the agents that can directly access the exosystem, a common observer based on an event‐triggered strategy is constructed to estimate the exogenous signal for feedback control design. For the rest of the agents, estimators based on an event‐triggered mechanism to acquire the estimation value of the exogenous signal are designed under some essential assumptions. A decentralized event‐triggered formulation is considered first by applying a Lyapunov function for a fixed topology. Furthermore, a topology‐dependent triggering condition and the average dwell‐time switching law are deduced simultaneously by using multiple Lyapunov functions for switching topologies. Under communication constraints, we propose observer‐based and estimator‐based feedback controllers to solve the cooperative output regulation problem using available local information among agents. Two examples are finally provided to verify the effectiveness of the proposed theoretical results.     

Formation control for a class of nonlinear multiagent systems using model‐free adaptive iterative learning

In this paper, the problem of formation control is considered for a class of unknown nonaffine nonlinear multiagent systems under a repeatable operation environment. To achieve the formation objective, the unknown nonlinear agent's dynamic is first transformed into a compact form dynamic linearization model along the iteration axis. Then, a distributed model‐free adaptive iterative learning control scheme is designed to ensure that all agents can keep their desired deviations from the reference trajectory over the whole time interval. The main results are given for the multiagent systems with fixed communication topologies and the extension to the switching topologies case is also discussed. The feature of this design is that formation control can be solved only depending on the input/output data of each agent. An example is given to demonstrate the effectiveness of the proposed method.     

A class of robust consensus algorithms with predefined‐time convergence under switching topologies

This paper addresses the robust consensus problem under switching topologies. Contrary to existing methods, the proposed approach provides decentralized protocols that achieve consensus for networked multiagent systems in a predefined time. Namely, the protocol design provides a tuning parameter that allows setting the convergence time of the agents to a consensus state. An appropriate Lyapunov analysis exposes the capability of the current proposal to achieve predefined‐time consensus over switching topologies despite the presence of bounded perturbations. Finally, this paper presents a comparison showing that the suggested approach subsumes existing fixed‐time consensus algorithms, which allows to provide extra degrees of freedom to obtain predefined‐time consensus protocols with improved convergence characteristics, for instance, to reduce the slack between the true convergence time and the predefined upper bound. Numerical results are given to illustrate the effectiveness and advantages of the proposed method.     

On time‐varying formation feasibility and reference function of time‐delayed linear multiagent systems with switching digraphs

Time‐varying formation feasibility and formation reference function of linear multiagent systems with both time‐varying delays and switching directed topologies are studied. For a given linear multiagent system, not all the time‐varying formations can be realized due to the dynamic restriction of each agent. The formation feasibility constraint reveals the requirement on the desired time‐varying formation to be compatible with the agent dynamics. Formation reference is a representation for the macroscopic movement of the whole multiagent system. Novel features of the formation feasibility constraint and the formation reference are the main focus of this paper. Firstly, a time‐delayed formation control protocol with switching directed topologies is constructed using local neighboring information. Then, a time‐varying formation feasibility constraint is derived based on nonsingular transformations. It is proven that the time‐varying formation feasibility constraint is independent of the time‐varying delays and the switching directed topologies. Moreover, an explicit expression of the formation reference function is proposed. It is shown that neither the time‐varying delays nor the switching directed topologies has influence on the obtained formation reference function. Finally, comparative examples are provided to demonstrate the obtained results.     

Consensus of output-coupled high-order linear multi-agent systems under deterministic and Markovian switching networks

Consensus problem for high-order multi-agent systems is considered under deterministic and Markovian switching topologies. Only relative output information of agents is assumed to be available through the networks. First, a necessary and sufficient condition for achieving a consensus under a fixed communication network is presented. Based on this result and the stability of switched systems, a high-order multi-agent system with the proposed low-gain controller is shown to reach a consensus under deterministic switching network if the total time when the network is disconnected is, in some senses, smaller than the total time of the network being connected. Furthermore, the conditions sufficient for a high-order multi-agent system to reach an almost sure and mean-square consensus, under Markovian switching networks, are presented. Finally, illustrative examples are given to demonstrate the results.     

Stable‐protocol output consensualization for high‐order swarm systems with switching topologies

Stable‐protocol (SP) output consensus analysis and design for high‐order linear time‐invariant swarm systems with switching topologies are dealt with. Firstly, on the basis of observability decomposition, a dynamic output feedback consensus protocol with switching topologies is given. Then, a necessary and sufficient condition for SP output consensus is shown, and an explicit expression of the output consensus function is presented, which is independent of switching topologies. Furthermore, necessary and/or sufficient conditions for SP output consensualization, which are independent of the number of agents, are shown respectively. Finally, a numerical example is shown to demonstrate theoretical results. Copyright © 2012 John Wiley & Sons, Ltd.     

Event‐triggered tracking control of heterogeneous multiagent systems based on two kinds of observers with asymmetric delay

In this paper, we consider the output tracking problem of a multiagent system with asymmetric delays and a switching topology. The multiagent system contains a leader and some followers, the dynamics of which are heterogeneous, and the output of the leader is available to only a subset of followers. We propose two types of observers to estimate states of the leader and reduce communication cost. For the informed followers that can directly obtain information of the leader, a common observer is given to reduce the complexity of observer design. Meanwhile, for the rest of the followers, a distributed observer with asymmetric communication delays for each follower is designed. The observer error system is transformed into a switched system. Through designing the average dwell‐time switching law and constructing multiple Lyapunov functionals, some sufficient conditions for stability of the observer error system are obtained. Furthermore, a distributed controller for followers based on the relative information is developed to track the output of the leader. Finally, an example is given to validate the effectiveness of the proposed results.     

Guaranteed‐performance consensus tracking of singular multiagent systems with Lipschitz nonlinear dynamics and switching topologies

In this paper, the problem of guaranteed‐performance consensus tracking of continuous‐time singular multiagent systems with Lipschitz nonlinearities and switching topologies is investigated. Consideration is that the interaction of the concerned agent network is described by a set of directed graphs with the union graph having a directed spanning tree rooted at the leader. To establish the guaranteed‐performance criterion, a quadratic performance function is constructed by utilizing the consensus errors among all agents. Then, a consensus protocol that collects the local information from neighboring agents is proposed to achieve consensus tracking and to guarantee the consensus regulation performance of the multiagent systems. On the basis of nonsingular transformation approach, singular systems theory, and Lyapunov stability analysis, the concerned guaranteed‐performance consensus tracking problem is cast into the admissibility analysis for an equivalent kind of switched singular consensus error system. Furthermore, sufficient conditions on the guaranteed‐performance consensus tracking protocol design are formulated in terms of linear matrix inequalities. Finally, numerical examples are employed to demonstrate the effectiveness of the theoretical results.     

Bounded consensus for multiagent systems by event‐triggered data transmission,time delay,and predictor‐based control

This paper investigates the consensus issue of multiagent systems with data transmission time delay. The state measurement of each local agent is directly sent to a private event‐trigger and further authorized to be broadcasted to its neighbors via communication network only when the threshold of the event‐trigger is violated. Since the controller always receives discrete‐time neighbor information with data transmission time delay, a predictor is employed to estimate the continuous‐time neighbor state. Based on the estimated state, a novel consensus protocol is mainly proposed for achieving the bounded consensus of the multiagent systems. By the proposed method, the asynchronous neighbor information is allowed and the margin of data transmission time delay is also given. Furthermore, it has been proved that the unwanted Zeno phenomena can be naturally excluded. Numerical example is provided to demonstrate the effectiveness of the proposed method.     

Distributed fixed‐time consensus for multiagent systems with unknown control directions

This paper investigates the consensus problem for high‐order multiagent systems with unknown control directions and directed communication constraints. To handle the problem of unknown control directions, a logic switching rule is established in the framework of fixed‐time stability. Then, the consensus is achieved in two steps. A group of distributed fixed‐time observers is designed to estimate the reference signals first. Based on these estimates and the designed logic switching rule, a novel control protocol is proposed for each follower system. Different from the existing results, the consensus is achieved with a fixed‐time convergence rate, and the unknown control directions are allowed to be nonidentical for each agent. Finally, simulation results are given to exhibit the validity of the proposed method.     

Guaranteed‐cost consensus for multiagent networks with Lipschitz nonlinear dynamics and switching topologies

Guaranteed‐cost consensus for high‐order nonlinear multiagent networks with switching topologies is investigated. By constructing a time‐varying nonsingular matrix with a specific structure, the whole dynamics of multiagent networks is decomposed into the consensus and disagreement parts with nonlinear terms, which is the key challenge to be dealt with. An explicit expression of the consensus dynamics, which contains the nonlinear term, is given and its initial state is determined. Furthermore, by the structure property of the time‐varying nonsingular transformation matrix and the Lipschitz condition, the impacts of the nonlinear term on the disagreement dynamics are linearized, and the gain matrix of the consensus protocol is determined on the basis of the Riccati equation. Moreover, an approach to minimize the guaranteed cost is given in terms of linear matrix inequalities. Finally, the numerical simulation is shown to demonstrate the effectiveness of theoretical results.