scholarly journals Bipartite Consensus of Heterogeneous Multiagent Systems with Diverse Input Delays

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Hongtao Ye ◽  
Zhongqiu Chen ◽  
Wenguang Luo ◽  
Jiayan Wen ◽  
Kene Li
Keyword(s):  
Theoretical Analysis ◽  
Multiagent Systems ◽  
Matrix Theory ◽  
Frequency Domain Analysis ◽  
Upper Bounds ◽  
Consensus Problem ◽  
The Novel ◽  
First Order ◽  
Bipartite Consensus ◽  
Input Delays

This paper investigates the bipartite consensus problem of heterogeneous multiagent systems with diverse input delays. Based on the systems composed of first-order and second-order agents, the novel control protocols are designed. Using frequency-domain analysis and matrix theory, the corresponding upper bounds of the allowable delays are obtained under the undirected topology and directed topology, respectively. Finally, simulation examples are given to verify the theoretical analysis.

Multiconsensus of first-order multiagent systems with directed topologies

2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Multiple Agents ◽  
First Order ◽  
The Matrix ◽  
Directed Topologies ◽  
Necessary And Sufficient ◽  
Theoretical Results

The multiconsensus problem of first-order multiagent systems with directed topologies is studied. A novel consensus problem is introduced in multiagent systems — multiconsensus. The states of multiple agents in each subnetwork asymptotically converge to an individual consistent value in the presence of information exchanges among subnetworks. Linear multiconsensus protocols are proposed to solve the multiconsensus problem, and the matrix corresponding to the protocol is designed. Necessary and sufficient conditions are derived based on matrix theory, under which the stationary multiconsensus and dynamic multiconsensus can be reached. Simulations are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Bipartite Consensus of Heterogeneous Multiagent Systems Based on Distributed Event-Triggered Control

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Xiaoyu Wang ◽  
Kaien Liu ◽  
Zhijian Ji ◽  
Shitao Han
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Input Delay ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Control Scheme ◽  
Event Triggering ◽  
Bipartite Consensus ◽  
Theoretical Results ◽  
Event Triggered

In this paper, the bipartite consensus problem of heterogeneous multiagent systems composed of first-order and second-order agents is considered by utilizing the event-triggered control scheme. Under structurally balanced directed topology, event-triggered bipartite consensus protocol is put forward, and event-triggering functions consisting of measurement error and threshold are designed. To exclude Zeno behavior, an exponential function is introduced in the threshold. The bipartite consensus problem is transformed into the corresponding stability problem by means of gauge transformation and model transformation. By virtue of Lyapunov method, sufficient conditions for systems without input delay are obtained to guarantee bipartite consensus. Furthermore, for the case with input delay, sufficient conditions which include an admissible upper bound of the delay are obtained to guarantee bipartite consensus. Finally, numerical simulations are provided to illustrate the effectiveness of the obtained theoretical results.

scholarly journals Group Consensus for Discrete-Time Heterogeneous Multiagent Systems with Input and Communication Delays

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Yiliu Jiang ◽  
Lianghao Ji ◽  
Xingcheng Pu ◽  
Qun Liu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Time Delays ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Frequency Domain Analysis ◽  
Communication Delays ◽  
Group Consensus ◽  
Cooperative Relationships ◽  
Input Time

Group consensus seeking is investigated for a class of discrete-time heterogeneous multiagent systems composed of first-order and second-order agents with both communication and input time delays. Considering two types of system topologies, novel protocols based on the competitive and cooperative relationships among the agents are presented, respectively. By matrix theory and frequency domain analysis method, the sufficient conditions solving consensus problem are obtained. The results show that the achievement of group consensus is bound up with the input time delays, coupling weights between the agents and the system’s control parameters, but it is irrelevant to the communication delays. Finally, numerical simulations are presented to illustrate the correctness of the theoretical results.

scholarly journals Fast Consensus Tracking of Multiagent Systems with Diverse Communication Delays and Input Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Chun-xi Yang ◽  
Wei-xing Hong ◽  
Ling-yun Huang ◽  
Hua Wang
Keyword(s):  
Genetic Algorithm ◽  
Multiagent Systems ◽  
Frequency Domain Analysis ◽  
Convergence Speed ◽  
Sufficient Condition ◽  
Communication Delays ◽  
Tracking Problem ◽  
Consensus Tracking ◽  
Simulation Results ◽  
Input Delays

The consensus tracking problem for discrete-time multiagent systems with input and communication delays is studied. A sufficient condition is obtained over a directed graph based on the frequency-domain analysis. Furthermore, a fast decentralized consensus tracking conditions based on incrementPIDalgorithm are discussed for improving convergence speed of the multiagent systems. Based on this result, genetic algorithm is introduced to construct incrementPIDbased on genetic algorithm for obtaining optimization consensus tracking performance. Finally, a numerable example is given to compare convergence speed of three tracking algorithms in the same condition. Simulation results show the effectiveness of the proposed algorithm.

scholarly journals Multiconsensus of Second-Order Multiagent Systems with Input Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Jie Chen ◽  
Ming Chi ◽  
Zhi-Hong Guan ◽  
Rui-Quan Liao ◽  
Ding-Xue Zhang
Keyword(s):  
Hopf Bifurcation ◽  
Theoretical Analysis ◽  
Multiagent Systems ◽  
Upper Bound ◽  
Multiagent System ◽  
Second Order ◽  
Matrix Analysis ◽  
Simulation Results ◽  
Input Delays ◽  
Double Integrator

The multiconsensus problem of double-integrator dynamic multiagent systems has been investigated. Firstly, the dynamic multiconsensus, the static multiconsensus, and the periodic multiconsensus are considered as three cases of multiconsensus, respectively, in which the final multiconsensus convergence states are established by using matrix analysis. Secondly, as for the multiagent system with input delays, the maximal allowable upper bound of the delays is obtained by employing Hopf bifurcation of delayed networks theory. Finally, simulation results are presented to verify the theoretical analysis.

scholarly journals Dynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Wen-Min Zhou ◽  
Jiang-Wen Xiao
Keyword(s):  
Multiagent Systems ◽  
Information Exchange ◽  
Matrix Theory ◽  
Weighted Graph ◽  
General Linear ◽  
Packet Dropout ◽  
Consensus Problem ◽  
Mean Square ◽  
Consensus Protocol ◽  
Random Packet Dropout

This paper is concerned with the consensus problem of general linear discrete-time multiagent systems (MASs) with random packet dropout that happens during information exchange between agents. The packet dropout phenomenon is characterized as being a Bernoulli random process. A distributed consensus protocol with weighted graph is proposed to address the packet dropout phenomenon. Through introducing a new disagreement vector, a new framework is established to solve the consensus problem. Based on the control theory, the perturbation argument, and the matrix theory, the necessary and sufficient condition for MASs to reach mean-square consensus is derived in terms of stability of an array of low-dimensional matrices. Moreover, mean-square consensusable conditions with regard to network topology and agent dynamic structure are also provided. Finally, the effectiveness of the theoretical results is demonstrated through an illustrative example.

Consensus Analysis for a Class of Heterogeneous Multi-Agent Systems in Directed Graph

2014 ◽  
Vol 599-601 ◽  
pp. 1930-1933
Author(s):  
Yi Jie Sun ◽  
Guo Liang Zhang ◽  
Jing Zeng
Keyword(s):  
Directed Graph ◽  
Matrix Theory ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Agent Systems ◽  
First Order ◽  
Multi Agent

This paper investigates the consensus problem for heterogeneous multi-agent systems in directed graph. The system includes first-order and second-order agents. A linear consensus protocol is proposed for solving such a consensus problem. A sufficient condition for the consensus problem is established by applying graph theory and matrix theory. Finally, a numerical simulation is provided to illustrate the effectiveness of the theoretical result.

scholarly journals Consensus Problem of Second-order Dynamic Agents with Heterogeneous Input and Communication Delays

2010 ◽  
Vol 5 (3) ◽  
pp. 325 ◽  
Author(s):  
Cheng-Lin Liu ◽  
Fei Liu
Keyword(s):  
Frequency Domain Analysis ◽  
Second Order ◽  
Consensus Problem ◽  
Communication Delays ◽  
Symmetric Graph ◽  
Multi Agent Systems ◽  
Damping Term ◽  
Agent Systems ◽  
Multi Agent ◽  
Input Delays

Consensus problem of second-order multi-agent systems with velocity damping term in agent’s dynamics is investigated. Based on frequency-domain analysis, decentralized consensus condition, which depends on the input delays, is obtained for the system based on undirected and symmetric graph with heterogeneous input delays. For the system based on directed graph with both heterogeneous input delays and communication delays, decentralized consensus condition, which is dependent on the input delays but independent on the communication delays, is also obtained. Simulations illustrate the correctness of the results.

scholarly journals Couple-Group Consensus for Multiagent Systems via Time-Dependent Event-Triggered Control

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Huiyang Liu ◽  
Xiaoshuang Wang
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Time Dependent ◽  
Communication Delays ◽  
Group Consensus ◽  
First Order ◽  
Zeno Behavior ◽  
The Matrix ◽  
Second Order Systems ◽  
Event Triggered

This paper investigates couple-group consensus problems for multiagent first-order and second-order systems. Several consensus protocols are proposed based on the time-dependent distributed event-triggered control. For the case of no communication delays, the time-dependent event-triggered strategies are applied to couple-group consensus problems. Based on the matrix theory, algebraic conditions for couple-group consensus are established. For the system with communication delays, based on event-triggered strategies, a Lyapunov-Krasovskii functional is constructed to prove the input-to-state stability of the systems. Moreover, Zeno behavior is excluded. Finally, numeral examples are given to illustrate the effectiveness of these results.

scholarly journals Partial Component Consensus of Discrete-Time Multiagent Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-5
Author(s):  
Wenjun Hu ◽  
Gang Zhang ◽  
Zhongjun Ma ◽  
Binbin Wu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Pinning Control ◽  
Directed Network ◽  
Strong Function ◽  
Partial Stability ◽  
Partial Component ◽  
The Matrix ◽  
Error System

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document