Data-driven tracking consensus for a class of unknown nonlinear multi-agent systems

2021 ◽  
pp. 107754632110340
Author(s):  
Jia Wu ◽  
Ning Liu ◽  
Wenyan Tang

This study investigates the tracking consensus problem for a class of unknown nonlinear multi-agent systems A novel data-driven protocol for this problem is proposed by using the model-free adaptive control method To obtain faster convergence speed, one-step-ahead desired signal is introduced to construct the novel protocol Here, switching communication topology is considered, which is not required to be strongly connected all the time Through rigorous analysis, sufficient conditions are given to guarantee that the tracking errors of all agents are convergent under the novel protocol Examples are given to validate the effectiveness of results derived in this article

2016 ◽  
Vol 40 (2) ◽  
pp. 504-513 ◽  
Author(s):  
Lei Chen ◽  
Kaiyu Qin ◽  
Jiangping Hu

In this paper, we investigate a tracking control problem for second-order multi-agent systems. Here, the leader is self-active and cannot be completely measured by all the followers. The interaction network associated with the leader–follower multi-agent system is described by a jointly connected topology, where the topology switches over time and is not strongly connected during each time subinterval. We consider a consensus control of the multi-agent system with or without time delay and propose two categories of neighbour-based control rules for every agent to track the leader, then provide sufficient conditions to ensure that all agents follow the leader, and meanwhile, the tracking errors can be estimated. Finally, some simulation results are presented to demonstrate our theoretical results.


2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Cui-Qin Ma ◽  
Yun-Bo Zhao ◽  
Wei-Guo Sun

Event-triggered bipartite consensus of single-integrator multi-agent systems is investigated in the presence of measurement noise. A time-varying gain function is proposed in the event-triggered bipartite consensus protocol to reduce the negative effects of the noise corrupted information processed by the agents. Using the state transition matrix, Ito^ formula, and the algebraic graph theory, necessary and sufficient conditions are given for the proposed protocol to yield mean square bipartite consensus. We find that the weakest communication requirement to ensure the mean square bipartite consensus under event-triggered protocol is that the signed digraph is structurally balanced and contains a spanning tree. Numerical examples validated the theoretical findings where the system shows no Zeno behavior.


Sign in / Sign up

Export Citation Format

Share Document