Theoretical analysis of consensus for networked multi-agent systems with switching topologies was conducted.Supposing that information-exchange topologies of networked system are dynamic,a modified linear protocol is proffered which is more practical than existing ones.The definition of trajectory consensus is given and a new consensus protocol is exhibited such that multi-agent system achieves trajectory consensus.In addition,a formation control strategy is designed.A common Lyapunov function is proposed to analyze the consensus convergence of networked multi-agent systems with switching topologies.Simulations are provided to demonstrate the effectiveness of the theoretical results.
In this paper, a cooperative control problem was investigated for discrete-time linear multi-agent systems with fixed information structure and without communication delays. Based on the bilinear matrix inequality （BMI）, the sufficient condition was obtained for the stabilization of multi-agent systems composed of N agents. Then, the design problems of cooperative controllers were converted into the optimization problems with BMI constraints. To solve these problems, an optimization algorithm was proposed. Finally, numerical examples were provided to demonstrate the reduced conservatism of the proposed condition.
Consensus problems for discrete-time multi-agent systems were focused on. In order to design effective consensus protocols, which were aimed at ensuring that the concerned states of agents converged to a common value, a new consensus protocol for general discrete-time multi-agent system was proposed based on Lyapunov stability theory. For discrete-time multi-agent systems with desired trajectory, trajectory tracking and formation control problems were studied. The main idea of trajectory tracking problems was to design trajectory controller such that each agent tracked desired trajectory. For a type of formation problem with fixed formation structure, the formation structure set was introduced. According to the formation structure set, each agent can track its individual desired trajectory. Finally, simulations were provided to demonstrate the effectiveness of the theoretical results. The mlmerical results show that the states of agents converge to zero with consensus protocol, which is said to achieve a consensus asymptotically. In addition, through designing appropriate trajectory controllers, the simulation results show that agents converge to the desired trajectory asymptotically and can form different formations.
Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated. In order to design effective consensus tracking protocols for a more general class of networks, which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state, new consensus tracking protocols with a constant and time-varying reference state are proposed, respectively. Particularly, by contrast with spanning tree, an improved condition of switching interaction topology is presented. And then, convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory. Moreover, consensus tracking protocol with a time-varying reference state is extended to achieve the fbrmation control. By introducing formation structure set, each agent can gain its individual desired trajectory. Finally, several simulations are worked out to illustrate the effectiveness of theoretical results. The test results show that the states of agents can converge to a desired constant or time-varying reference state. In addition, by selecting appropriate structure set, agents can maintain the expected formation under random switching interaction topologies.
