Fixed-time consensus of first-order multi-agent systems over signed directed graphs

Author(s):  
Zhentao Li ◽  
Zhengxin Wang ◽  
Yuanzhen Feng

This paper studies the fixed-time consensus problems of first-order multi-agent systems over signed directed graphs. Fixed-time consensus protocols are designed for first-order multi-agent systems without/with disturbances and first-order nonlinear multi-agent systems with disturbances, respectively. With proposed protocols, it is proved that multi-agent systems with strongly connected topologies will achieve consensus in a fixed time if the control parameters satisfy certain conditions. Finally, simulation examples are provided to verify the effectiveness of the theoretical results.

2017 ◽  
Vol 20 (2) ◽  
pp. 646-658 ◽  
Author(s):  
Boda Ning ◽  
Zongyu Zuo ◽  
Jiong Jin ◽  
Jinchuan Zheng

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1412
Author(s):  
Xue Li ◽  
Zhiyong Yu ◽  
Haijun Jiang

In this paper, the leader-following consensus problem of first-order nonlinear multi-agent systems (FONMASs) with external disturbances is studied. Firstly, a novel distributed fixed-time sliding mode manifold is designed and a new static event-triggered protocol over general directed graph is proposed which can well suppress the external disturbances and make the FONMASs achieve leader-following consensus in fixed-time. Based on fixed-time stability theory and inequality technique, the conditions to be satisfied by the control parameters are obtained and the Zeno behavior can be avoided. In addition, we improve the proposed protocol and propose a new event-triggering strategy for the FONMASs with multiple leaders. The systems can reach the sliding mode surface and achieve containment control in fixed-time if the control parameters are designed carefully. Finally, several numerical simulations are given to show the effectiveness of the proposed protocols.


Author(s):  
Tingruo Yan ◽  
Xu Xu ◽  
Zongying Li ◽  
Eric Li

The fixed-time flocking of multi-agent systems with a virtual leader is investigated in this paper. The motion dynamics of the agents are assumed to be unknown and only satisfy the boundedness, which does not need to be modelled by the Lipschitz condition. To achieve the flocking and collision avoidance for all agents in the fixed time, a control protocol in the high-dimensional space is developed by using the graph theory and the theoretical properties of differential equations. Moreover, the upper bound of the settling time only depending on the control protocol and the topology of network is estimated. Numerical examples are used to verify the theoretical results, and show that the proposed method provides an applicable method for the control of the nonlinear dynamic systems.


Sign in / Sign up

Export Citation Format

Share Document