The optimal leaderless and leader-following time-varying formation (TVF) control problems for second-order multiagent systems (MASs) are investigated, where two optimal TVF control protocols are proposed to achieve the desired formations as well as minimize the comprehensive optimization function that contain the cooperative performance index and the control energy index. For leaderless case, the optimal formation control problem is reformulated as an infinite-time state regulator problem by employing the state space decomposition method, which is subject to specified constraints on energy and performance indices, and the analytic criterion for optimal TVF achievability is subsequently proposed. Then, the results of optimal leaderless TVF control are extended to the leader-following case with switching topologies, where the main challenge is changed to find the optimal controller rather than the optimal gain matrix, and the optimal value of the comprehensive index is accurately determined.
View Article and Find Full Text PDFIn recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm.
View Article and Find Full Text PDFThis paper proposes a new induced attack strategy against multiagent systems from the perspective of the attacker. It is noted that the induced attack can drive multiagent systems as a whole to follow a specific trajectory prescribed by the attacker, which cannot be achieved by denial-of-service attacks or deception attacks. Firstly, the induced attack signal is produced by establishing an attack generation exosystem, whose dynamics can be regulated to generate the prescribed consensus trajectory.
View Article and Find Full Text PDFThe minimum-energy formation strategy for interconnected networks with distributed formation protocols is persented, where the impacts of the total energy restriction and the interaction silence are analyzed, respectively. The critical feature of this article is that the distributed formation and the minimum-energy restriction are realized simultaneously, and the total energy restriction is minimum in the sense of the linear matrix inequality. However, the guaranteed-cost formation strategy and the limited-budget formation strategy cannot guarantee that the energy restriction is minimum.
View Article and Find Full Text PDFThis article considers consensus of first-order/second-order hybrid multiagent systems (MASs) based on game modeling. In the first-order hybrid MAS (HMAS), a subset of agents select the Nash equilibrium of a multiplayer game as their states at each game time and the others update their states with first-order continuous-time (C-T) dynamics. By graph theory and matrix theory, we establish sufficient and necessary conditions for consensus of the first-order HMAS with two proposed protocols.
View Article and Find Full Text PDFThis paper studies the resilient group consensus of continuous-time second-order multi-agent systems (MASs) with malicious agents. Adopting the idea that each normal agent ignores the most extreme values from neighbors, synchronous resilient impulsive algorithm based on sampled data is proposed for normal agents with bounded communication delays to achieve group consensus. Meanwhile, asynchronous resilient impulsive algorithm is also proposed for MASs where each agent has its own time clock.
View Article and Find Full Text PDFIEEE Trans Neural Netw Learn Syst
May 2022
In this article, we consider the cooperative output regulation for linear multiagent systems (MASs) via the distributed event-triggered strategy in fixed time. A novel fixed-time event-triggered control protocol is proposed using a dynamic compensator method. It is shown that based on the designed control scheme, the cooperative output regulation problem is addressed in fixed time and the agents in the communication network are subject to intermittent communication with their neighbors.
View Article and Find Full Text PDFThis article develops a robust packetized predictive control framework to deal with the quantized-feedback control problem of networked systems subject to Markovian packet dropouts and input saturation. In the proposed framework, the Markov chain model of packet dropout is established from the link of the controller to the actuator. To deal with the quantized measurements, a robust packetized predictive control method is presented with a quantized-feedback law.
View Article and Find Full Text PDFIn this article, we focus on the problems of consensus control for nonlinear uncertain multiagent systems (MASs) with both unknown state delays and unknown external disturbances. First, a nonlinear function approximator is proposed for the system uncertainties deriving from unknown nonlinearity for each agent according to adaptive radial basis function neural networks (RBFNNs). By taking advantage of the Lyapunov-Krasovskii functionals (LKFs) approach, we develop a compensation control strategy to eliminate the effects of state delays.
View Article and Find Full Text PDFIEEE Trans Neural Netw Learn Syst
February 2022
This article considers iterative learning control (ILC) for a class of discrete-time systems with full learnability and unknown system dynamics. First, we give a framework to analyze the learnability of the control system and build the relationship between the learnability of the control system and the input-output coupling matrix (IOCM). The control system has full learnability if and only if the IOCM is full-row rank and the control system has no learnability almost everywhere if and only if the rank of the IOCM is less than the dimension of system output.
View Article and Find Full Text PDFWith 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.
View Article and Find Full Text PDFIn this article, the H 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.
View Article and Find Full Text PDFIn 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.
View Article and Find Full Text PDFIEEE Trans Neural Netw Learn Syst
November 2017
In this paper, we study the consensus problem of discrete-time and continuous-time multiagent systems with distance-dependent communication networks, respectively. The communication weight between any two agents is assumed to be a nonincreasing function of their distance. First, we consider the networks with fixed connectivity.
View Article and Find Full Text PDF