Formation-containment control for general linear multi-agent systems with time-varying delays and switching topologies

Author(s):  
Shiyu Zhou ◽  
Yongzhao Hua ◽  
Xiwang Dong ◽  
Qingdong Li ◽  
Zhang Ren
2019 ◽  
Vol 07 (01) ◽  
pp. 3-13 ◽  
Author(s):  
Wei Xiao ◽  
Jianglong Yu ◽  
Rui Wang ◽  
Xiwang Dong ◽  
Qingdong Li ◽  
...  

Time-varying formation analysis and design problems for general linear multi-agent systems with switching interaction topologies and time-varying delays are studied. Firstly, a consensus-based formation control protocol is constructed using local information of the neighboring agents. An algorithm with three steps is presented to design the proposed formation control protocol. Then, based on linear matrix inequality technique and common Lyapunove–Krasovskii stability theory, sufficient conditions for general linear multi-agent systems with switching topologies and time-varying delays to achieve time-varying formation are given together with a time-varying formation feasibility condition. Finally, a numerical simulation is given to demonstrate the effectiveness of the obtained 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