In this brief, we consider the consensus problem of hybrid multiagent systems. First, the hybrid multiagent system is proposed, which is composed of continuous-time and discrete-time dynamic agents. Then, three kinds of consensus protocols are presented for the hybrid multiagent system. The analysis tool developed in this brief is based on the matrix theory and graph theory. With different restrictions of the sampling period, some necessary and sufficient conditions are established for solving the consensus of the hybrid multiagent system. The consensus states are also obtained under different protocols. Finally, simulation examples are provided to demonstrate the effectiveness of our theoretical results.

In this paper, we consider the containment control problem for a group of autonomous agents modelled by heterogeneous dynamics. The communication networks among the leaders and the followers are directed graphs. When the leaders are first-order integrator agents, we present a linear protocol for heterogeneous multi-agent systems such that the second-order integrator agents converge to the convex hull spanned by the first-order integrator agents if and only if the directed graph contains a directed spanning forest. If the leaders are second-order integrator agents, we propose a nonlinear protocol and obtain a necessary and sufficient condition that the heterogeneous multi-agent system solves the containment control problem in finite time. Simulation examples are also provided to illustrate the effectiveness of the theoretical results.

This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.

This article focuses on scaled consensus tracking for a class of high-order nonlinear multiagent systems. Different from the existing results, for high-order nonlinear multiagent systems with time delays and external disturbances, a fully distributed consensus protocol is designed to drive all agents to achieve scaled consensus with preassigned ratios. The control gains are varying and updated by distributed adaptive laws. As a result, the presented protocol is independent of any global information, and thus, could be implemented in a fully distributed manner. Simultaneously, the fully distributed control protocol using an adaptive $\sigma$ -modification technique is presented to deal with external disturbances, which can guarantee the tracking errors and coupling weights of all following agents are uniformly ultimately bounded. To tackle with the derivatives of the functionals with time delays, the Lyapunov–Krasovskii functional is employed to analyze and compensate them by introducing multiintegral terms. Finally, simulation examples are included to verify the effectiveness of the theoretical results.

This paper deals with the consensus problem in network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic quantizer accuracy under connected and structurally balanced topology and the states of all agents asymptotically converge to zero under connected and structurally unbalanced topology. In addition, finite-time bipartite consensus is considered for single-integrator agents with binary quantized information. The simulation results are given to demonstrate the effectiveness of the theoretical results.

This article considers the consensus problem of heterogeneous multi-agent system composed of first-order and second-order agents, in which the second-order integrator agents cannot obtain the velocity (second state) measurements for feedback. Two different consensus protocols are proposed. First, we propose a consensus protocol and discuss the consensus problem of heterogeneous multi-agent system. By applying the graph theory and the Lyapunov direct method, some sufficient conditions for consensus are established when the communication topologies are undirected connected graphs and leader-following networks. Second, due to actuator saturation, we propose another consensus protocol with input constraint and obtain the consensus criterions for heterogeneous multi-agent system. Finally, some examples are presented to illustrate the effectiveness of the obtained criterions.