Search

In this article, the ${H_{\infty } }$ scaled consensus control problem for multiagent systems in the presence of external disturbances and mixed time delays in both input and Lipschitz nonlinearity is investigated. First, a state observer is introduced for each agent based on the output information of the agent. Then, a scaled consensus protocol is proposed via a truncated predictor output-feedback method, which can deal with the input delay. The integral terms with the mixed time delays that are contained in the transformed systems are analyzed by using the Lyapunov–Krasovskii functionals method, and sufficient conditions are obtained to achieve scaled consensus with guaranteed ${H_{\infty } }$ performance. An iterative procedure is utilized to calculate the linear matrix inequality. By this, the feedback gain and observer gain are then designed. Finally, a simulation example is provided to illustrate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

With the incentive to solve Nash equilibrium computation problems for networked games, this article tries to find answers for the following two problems: 1) how to accommodate hybrid games, which contain both continuous-time players and discrete-time players? and 2) are there any other potential perspectives for solving continuous-time networked games except for the consensus-based gradient-like algorithm established in our previous works? With these two problems in mind, the study of this article leads to the following results: 1) a hybrid gradient search algorithm and a consensus-based hybrid gradient-like algorithm are proposed for hybrid games with their convergence results analytically investigated. In the proposed hybrid strategies, continuous-time players adopt continuous-time algorithms for action updating, while discrete-time players update their actions at each sampling time instant and 2) based on the idea of consensus tracking, the Nash equilibrium learning problem for continuous-time games is reformulated and two new computation strategies are subsequently established. Finally, the proposed strategies are numerically validated. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

In this brief, we consider the consensus problem of a switched multiagent system composed of continuous-time (CT) and discrete-time (DT) subsystems. By combining the classical consensus protocols of CT and DT multiagent systems, we propose a linear consensus protocol for switched multiagent system. Based on the graph theory and the Lyapunov theory, we prove that the consensus of switched multiagent system is solvable under arbitrary switching with undirected connected graph, directed graph, and switching topologies, respectively. Simulation examples are also provided to demonstrate the effectiveness of the theoretical results. [ABSTRACT FROM PUBLISHER]