Decentralized Consensus Criteria of Linear Multiagent Systems via Directed-Spanning-Tree-Based Linear Transformation

2019 ◽  
Author(s):  
Yangzhou Chen ◽  
Bing Chen ◽  
Jingyuan Zhan
Keyword(s):  
Multiagent Systems ◽  
Linear Transformation ◽  
Spanning Tree ◽  
Directed Spanning Tree

scholarly journals Consensus of Heterogeneous Multiagent Systems with Switching Dynamics

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Wenshuai Wang ◽  
Juling Wang ◽  
Huaizhu Wang ◽  
Yuanshi Zheng
Keyword(s):  
Multiagent Systems ◽  
Spanning Tree ◽  
Matrix Theory ◽  
Nonnegative Matrix ◽  
Time Dynamics ◽  
Switching Dynamics ◽  
Directed Spanning Tree ◽  
Interaction Topology ◽  
Theoretical Results ◽  
Double Integrator

Heterogeneity is an important feature of multiagent systems. This paper addresses the consensus problem of heterogeneous multiagent systems composed of first-integrator and double-integrator agents. The dynamics of each agent switches between continuous-time and discrete-time dynamics. By using the graph theory and nonnegative matrix theory, we derive that the system can achieve consensus if and only if the fixed interaction topology has a directed spanning tree. For switching topologies, we get that the system can reach consensus if each interaction topology has a directed spanning tree. Simulation examples are provided to demonstrate the effectiveness of our theoretical results.

Distributed Consensus for Multiagent Systems via Directed Spanning Tree Based Adaptive Control

2018 ◽  
Vol 56 (3) ◽  
pp. 2189-2217 ◽  
Author(s):  
Zhiyong Yu ◽  
Da Huang ◽  
Haijun Jiang ◽  
Cheng Hu ◽  
Wenwu Yu
Keyword(s):  
Adaptive Control ◽  
Multiagent Systems ◽  
Spanning Tree ◽  
Distributed Consensus ◽  
Directed Spanning Tree

scholarly journals Consensus Analysis of Fractional-Order Multiagent Systems with Double-Integrator

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Chunde Yang ◽  
Wenjing Li ◽  
Wei Zhu
Keyword(s):  
Multiagent Systems ◽  
Fractional Order ◽  
Spanning Tree ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Consensus Analysis ◽  
Directed Spanning Tree ◽  
Necessary And Sufficient ◽  
Theoretical Results ◽  
Double Integrator

In nature, many phenomena can be explained by coordinated behavior of agents with fractional-order dynamics. In this paper, the consensus problem of fractional-order multiagent systems with double-integrator is studied, where the fractional-order satisfies0<α<2. Based on the fractional-order stability theory, Mittag-Leffler function, and Laplace transform, a necessary and sufficient condition is obtained under the assumption that the directed graph for the communication network contains a directed spanning tree. Finally, an example with simulation is presented to illustrate the theoretical results.

scholarly journals Random minimal directed spanning trees and Dickman-type distributions

2004 ◽  
Vol 36 (03) ◽  
pp. 691-714 ◽  
Author(s):  
Mathew D. Penrose ◽  
Andrew R. Wade
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Dirichlet Distribution ◽  
Maximal Length ◽  
Directed Path ◽  
Limiting Distributions ◽  
Limit Distributions ◽  
Tree Construction ◽  
Directed Spanning Tree ◽  
Westerly Direction

In Bhatt and Roy's minimal directed spanning tree construction fornrandom points in the unit square, all edges must be in a south-westerly direction and there must be a directed path from each vertex to the root placed at the origin. We identify the limiting distributions (for largen) for the total length of rooted edges, and also for the maximal length of all edges in the tree. These limit distributions have been seen previously in analysis of the Poisson-Dirichlet distribution and elsewhere; they are expressed in terms of Dickman's function, and their properties are discussed in some detail.

scholarly journals On a random directed spanning tree

2004 ◽  
Vol 36 (1) ◽  
pp. 19-42 ◽  
Author(s):  
Abhay G. Bhatt ◽  
Rahul Roy
Keyword(s):  
Spanning Tree ◽  
Poisson Point Process ◽  
Spanning Trees ◽  
Asymptotic Properties ◽  
Record Values ◽  
Extreme Value Statistics ◽  
Minimal Spanning Tree ◽  
Unit Square ◽  
Directed Spanning Tree ◽  
Number Of Branches

We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity n in the unit square.

scholarly journals On a random directed spanning tree

2004 ◽  
Vol 36 (01) ◽  
pp. 19-42 ◽  
Author(s):  
Abhay G. Bhatt ◽  
Rahul Roy
Keyword(s):  
Spanning Tree ◽  
Poisson Point Process ◽  
Spanning Trees ◽  
Asymptotic Properties ◽  
Record Values ◽  
Extreme Value Statistics ◽  
Minimal Spanning Tree ◽  
Unit Square ◽  
Directed Spanning Tree ◽  
Number Of Branches

We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity n in the unit square.

Sign in / Sign up

Export Citation Format

Share Document