scholarly journals H∞ Consensus Control for Heterogeneous Multi-Agent via Output under Markov Switching Topologies

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 453 ◽  
Author(s):  
Guoying Miao ◽  
Gang Li ◽  
Tao Li ◽  
Yunping Liu
Keyword(s):  
Markov Switching ◽  
Sufficient Conditions ◽  
Consensus Algorithm ◽  
Multi Agent Systems ◽  
Analysis Model ◽  
Consensus Control ◽  
Switching Topologies ◽  
Communication Time ◽  
Multi Agent ◽  
General Kind

The paper investigates H ∞ consensus problem of heterogeneous multi-agent systems including agents with first- and second-order integrators in the presence of disturbance and communication time delays under Markov switching topologies. Based on current messages, outdated information stored in memory and communication time delay information from neighbors, a more general kind of distributed consensus algorithm is proposed, which is faster consensus convergence. By applying stochastic stability analysis, model transformation techniques and graph theory, sufficient conditions of mean square consensus and H ∞ consensus are obtained, respectively. Finally, simulation examples are given to illustrate the effectiveness of obtained theoretical results.

scholarly journals Robust finite-time consensus subject to unknown communication time delays based on delay-dependent criteria

2021 ◽  
pp. 014233122110515
Author(s):  
Maryam Sharifi
Keyword(s):  
Finite Time ◽  
Time Delays ◽  
Sufficient Conditions ◽  
Consensus Algorithm ◽  
Multi Agent Systems ◽  
Razumikhin Theorem ◽  
Communication Time ◽  
Multi Agent ◽  
Delay Dependent ◽  
Time Invariant

In this paper, robust finite-time consensus of a group of nonlinear multi-agent systems in the presence of communication time delays is considered. In particular, appropriate delay-dependent strategies which are less conservative are suggested. Sufficient conditions for finite-time consensus in the presence of deterministic and stochastic disturbances are presented. The communication delays don’t need to be time invariant, uniform, symmetric, or even known. The only required condition is that all delays satisfy a known upper bound. The consensus algorithm is appropriate for agents with partial access to neighbor agents’ signals. The Lyapunov–Razumikhin theorem for finite-time convergence is used to prove the results. Simulation results on a group of mobile robot manipulators as the agents of the system are presented.

scholarly journals Fuzzy-based Dissipative Consensus for Multi-Agent Systems with Markov Switching Topologies

2020 ◽  
Vol 53 (2) ◽  
pp. 4127-4131
Author(s):  
Jiafeng Yu ◽  
Peng Shi ◽  
Qinsheng Li ◽  
Wen Xing ◽  
Mohammed Chadli ◽  
...  
Keyword(s):  
Markov Switching ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Switching Topologies ◽  
Multi Agent

scholarly journals Adaptive Guaranteed-Performance Consensus Control for Multi-Agent Systems with an Adjustable Convergence Speed

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Haiying Ma ◽  
Xiao Jia ◽  
Ning Cai ◽  
Jianxiang Xi
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Convergence Speed ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Control ◽  
Control Gain ◽  
Multi Agent ◽  
The Stability ◽  
Theoretical Results

In this paper, adaptive guaranteed-performance consensus control problems for multiagent systems with an adjustable convergence speed are investigated. A novel adaptive guaranteed-performance consensus protocol is proposed, where the communication weights can be adaptively regulated. By the state space decomposition method and the stability theory, sufficient conditions for guaranteed-performance consensus are obtained and the guaranteed-performance cost is determined. Moreover, the lower bound of the convergence coefficient for multiagent systems is deduced, which is linearly adjustable approximately by changing the adaptive control gain. Finally, simulation examples are introduced to demonstrate theoretical results.

Sign in / Sign up

Export Citation Format

Share Document