scholarly journals Consensus of Heterogeneous Multiagent Systems with Arbitrarily Bounded Communication Delay

2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Xue Li ◽  
Huai Wu ◽  
Yikang Yang
Keyword(s):  
Multiagent Systems ◽  
Spanning Trees ◽  
High Order ◽  
Communication Delay ◽  
Consensus Problem ◽  
Nonnegative Matrices ◽  
Communication Delays ◽  
Communication Graphs

This paper focuses on the consensus problem of high-order heterogeneous multiagent systems with arbitrarily bounded communication delays. Through the method of nonnegative matrices, we get a sufficient consensus condition for the systems with dynamically changing topology. The results of this paper show, even when there are arbitrarily bounded communication delays in the systems, all agents can reach a consensus no matter whether there are spanning trees for the corresponding communication graphs at any time.

scholarly journals Consensus of High-Order Linear Multiagent Systems with Multitype Switching Topologies Based on the Dynamic Dwell Time Approach

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Yaxiao Zhang ◽  
Yangzhou Chen ◽  
Xiaojun Qu
Keyword(s):  
Multiagent Systems ◽  
Dwell Time ◽  
High Order ◽  
Sufficient Condition ◽  
Consensus Problem ◽  
Switching Rule ◽  
Switching Topologies ◽  
The Stability ◽  
Necessary And Sufficient ◽  
The Impact

This paper investigates the consensus problem of high-order continuous-time linear multiagent systems (LMASs) with multitype switching topologies which include both consensusable and unconsensusable communication topologies. A linear transformation is introduced, which equivalently transforms the consensus problem into the stability problem of a corresponding switched system, along with a necessary and sufficient condition to analyze the consensus problem. This paper is aimed at studying the impact of a switching rule on communication topologies for consensus of LMASs. Based on the dynamic dwell time method, a sufficient condition is derived for consensus of LMASs. It is shown that, with switching signals that satisfy this switching rule, LMASs can achieve consensus under directed switching communication topologies. A numerical example is provided to illustrate the effectiveness of the theoretical results.

scholarly journals Consensus of Second-Order Multiagent Systems with Directed Signed Networks and Communication Delays

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Huiqin Pei ◽  
Qiang Lai ◽  
Guang Li
Keyword(s):  
Multiagent Systems ◽  
Lyapunov Method ◽  
Second Order ◽  
Consensus Problem ◽  
Communication Delays ◽  
Consensus Control ◽  
Signed Networks ◽  
Signed Digraph ◽  
Strongly Connected ◽  
Barbalat Lemma

This paper is concerned with the consensus problem for second-order multiagent systems (MASs) with directed signed networks and local communication delays. First, under a strongly connected directed graph, some properties for signed digraph and the model of second-order MASs are provided. A distributed nonlinear consensus control protocol is proposed for implementing consensus of second-order MASs with signed digraph and communication delay. Then, for structurally balanced and unbalanced networks, the consensus of second-order MASs with directed signed networks and local delays is proved via the Lyapunov method and Barbalat lemma. Simulation examples are given to demonstrate the effectiveness of our results.

scholarly journals Consensus Problem of High-Order Multiagent Systems with Time Delays

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Jianhui Liu ◽  
Bin Zhang
Keyword(s):  
Multiagent Systems ◽  
Time Domain ◽  
Time Delays ◽  
High Order ◽  
The State ◽  
Consensus Problem ◽  
Lyapunov Approach ◽  
Numerical Example ◽  
Riccati Inequality

In this paper, we consider the consensus problem of high-order multiagent systems on both fixed and switching interaction topologies with time delays. A neighbor-based protocol is presented, under which we prove that the state errors converge to zero asymptotically if there is a solution to a given Riccati inequality. The proof of our theorem is shown in time domain based on a Lyapunov approach. A numerical example is introduced to indicate the correctness of our analysis.

scholarly journals Bipartite Consensus of High-Order Edge Dynamics on Coopetition Multiagent Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Yilong Yang ◽  
Zhijian Ji ◽  
Lei Tian ◽  
Huizi Ma ◽  
Qingyuan Qi
Keyword(s):  
Multiagent Systems ◽  
Line Graph ◽  
Sufficient Conditions ◽  
High Order ◽  
Third Order ◽  
Positive Weight ◽  
The Third ◽  
Initial Graph ◽  
Strongly Connected ◽  
Bipartite Consensus

The bipartite consensus of high-order edge dynamics is investigated for coopetition multiagent systems, in which the cooperative and competitive relationships among agents are characterized by positive weight and negative weight, respectively. By mapping the initial graph to a line graph, the distributed control protocol is proposed for the strongly connected, digon sign-symmetric structurally balanced line graph; and then we give sufficient conditions for the third-order multi-gent system to achieve both the bipartite consensus of edge dynamics and the final value of bipartite consensus. By transforming the coefficients of characteristic polynomial from complex domain to real number domain, the sufficient conditions for the bipartite consensus of high-order edge dynamics are also proposed, and the final values of the high-order edge dynamics on multiagent systems are obtained.

Sign in / Sign up

Export Citation Format

Share Document