Formation Control For Discrete-Time Multi-Agent System With Input and Output Delays Under Network Attacks

Author(s):  
Yuan Jian ◽  
Liu Hailin ◽  
Zhang Wenxia

Abstract This paper addresses the mean square consensus-based formation control for multiple agent system (MAS) with input and output delays under network attacks, process noise, and measurement noise in MAS. Firstly, a time delay-free transformation approach for a multi-agent system with input and output delays is presented. The MAU system is transformed into a formal delay-free discrete-time system using the delay-free transformation method. Then a state observer based on Kalman filter is presented to estimate the states of agents. A distributed predictive consensus protocol based on the estimated states of each MAUS is proposed for the leader-following MAUS. The sufficient and necessary conditions of mean square consensus for MAUS under DoS attacks are derived. Finally, a numerical example of consensus-based formation control for Multi-agent systems is provided to verify the correctness and effectiveness of the proposed consensus control protocol.

2011 ◽  
Vol 128-129 ◽  
pp. 92-95 ◽  
Author(s):  
Bo Liu ◽  
Wei Na Hu ◽  
Jie Zhang

This paper investigates the controllability of discrete-time multi-agent systems with leaders via switching topology. The results show that a multi-agent system can be switching controllable even if each of its subsystem is not controllable, by appropriately selecting some agents as the leaders and suitably designing the neighbor-interaction rules via a switching topology. Meanwhile, the controllability of systems can be only determined by the information from the leaders to the followers. Example and simulations are given to illustrate the theoretical results.


2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772631 ◽  
Author(s):  
Lipo Mo ◽  
Yintao Wang ◽  
Tingting Pan ◽  
Yikang Yang

This article deals with the leader-following mean-square consensus problem of discrete-time general linear multi-agent systems with Markovian switching topologies and persistent disturbances. Assume that the communication topology is not connected at any time but the union topology is connected. First, the estimators are designed to calculate the states of agents when external disturbance not exists. Based on the error information between the truth-values and estimated-values of states, the compensators are proposed to subject to the effect of persistent disturbances. And then, a new mean-square consensus control protocol is proposed for each agent. Second, by using the property of permutation matrix, the original closed-loop system is transferred into an equivalent system. Third, sufficient conditions for mean-square consensus are obtained in the form of matrix inequalities. Finally, numerical simulations are given to illustrate the effectiveness of the theoretical results.


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 941
Author(s):  
Tianhao Sun ◽  
Huiying Liu ◽  
Yongming Yao ◽  
Tianyu Li ◽  
Zhibo Cheng

In this paper, the time-varying formation tracking problem of the general linear multi-agent system is discussed. A distributed formation tracking protocol based on Riccati inequalities with adaptive coupling weights among the follower agents and the leader agent is designed for a leader-following multi-agent system under fixed and switching topologies. The formation configuration involved in this paper is expressed as a bounded piecewise continuously differentiable vector function. The follower agents will achieve the desired formation tracking trajectory of the leader. In traditional static protocols, the coupling weights depend on the communication topology and is a constant. However, in this paper, the coupling weights are updated by the state errors among the neighboring agents. Moreover, the stability analysis of the MAS under switching topology is presented, and proves that the followers also could achieve pre-specified time-varying formation, if the communication graph is jointly connected. Two numerical simulations indicate the capabilities of the algorithms.


Sign in / Sign up

Export Citation Format

Share Document