scholarly journals Consensus Analysis for Third-Order Multiagent Systems in Directed Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Yanfen Cao ◽  
Yuangong Sun
Keyword(s):  
Dynamical Systems ◽  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Consensus Problem ◽  
Third Order ◽  
Consensus Analysis ◽  
Necessary And Sufficient ◽  
The Relationship ◽  
Theoretical Results

We investigate consensus problem for third-order multiagent dynamical systems in directed graph. Necessary and sufficient conditions to consensus of third-order multiagent systems have been established under three different protocols. Compared with existing results, we focus on the relationship between the scaling strengths and the eigenvalues of the involved Laplacian matrix, which guarantees consensus of third-order multiagent systems. Finally, some simulation examples are given to illustrate the theoretical results.

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 Consensus Analysis for High-Order Multi-Agent Systems without or with Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Zhengxin Wang ◽  
Yang Cao
Keyword(s):  
Partial Information ◽  
Sufficient Conditions ◽  
High Order ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Agent Systems ◽  
Multi Agent ◽  
Necessary And Sufficient

This paper studies the consensus problem for a high-order multi-agent systems without or with delays. Consensus protocols, which only depend on the own partial information of agents and partial relative information with its neighbors, are proposed for consensus and quasi-consensus, respectively. Firstly, some lemmas are presented, and then a necessary and sufficient condition for guaranteeing the consensus is established under the consensus protocol without delays. Furthermore, communication delays are considered. Some necessary and sufficient conditions for solving quasi-consensus problem with delays are obtained. Finally, some simulations are given to verify the theoretical results.

scholarly journals Robust Leaderless Consensus of Uncertain Multiagent Systems with Fast Switching Topologies

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Wei Liu ◽  
Shaolei Zhou ◽  
Shi Yan ◽  
Gaoyang Yin
Keyword(s):  
Multiagent Systems ◽  
Special Property ◽  
Laplacian Matrix ◽  
Graph Laplacian ◽  
Consensus Problem ◽  
Time Intervals ◽  
Fast Switching ◽  
Switching Topologies ◽  
Directed Spanning Tree ◽  
Theoretical Results

This paper investigates the robust leaderless consensus problem of uncertain multiagent systems with directed fast switching topologies. The topologies are assumed to jointly contain a directed spanning tree. Based on a special property of the graph Laplacian matrix, the consensus problem is converted into a stabilization problem by performing a proper variable transformation. Averaging method is employed for analysis. It is proved that if the topologies switch sufficiently fast and the controllers are properly designed, the robust leaderless consensus can still be achieved even when all the possible topologies are unconnected in the switching time intervals. Finally, a numerical simulation is provided to illustrate the effectiveness of the theoretical results.

scholarly journals Average Consensus in Networks of Neutral Dynamical Agents with Fixed and Switching Topologies

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yingying Wu ◽  
Yuangong Sun
Keyword(s):  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Switching Topology ◽  
Linear Matrix ◽  
Switching Topologies ◽  
Average Consensus ◽  
Eigenvalues Of The Laplacian ◽  
Fixed Topology ◽  
Necessary And Sufficient ◽  
Theoretical Results

This paper addresses the average consensus problem of neutral multiagent systems in undirected networks with fixed and switching topologies. For the case of fixed topology, necessary and sufficient conditions to average consensus are established by decoupling the neutral multiagent system in terms of the eigenvalues of the Laplacian matrix. For the case of switching topology, sufficient conditions to average consensus are given in terms of linear matrix inequalities to determine the allowable upper bound of the time-varying communication delay. Finally, two examples are worked out to explain the effectiveness of the theoretical results.

Schooling for multi-agent systems via impulsive containment control algorithms with quantized information

2018 ◽  
Vol 41 (3) ◽  
pp. 828-841 ◽  
Author(s):  
Hong-Xiao Zhang ◽  
Li Ding ◽  
Zhi-Wei Liu
Keyword(s):  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Control Algorithms ◽  
Multi Agent Systems ◽  
Containment Control ◽  
Agent Systems ◽  
Eigenvalues Of The Laplacian ◽  
Multi Agent ◽  
Necessary And Sufficient ◽  
Theoretical Results

In the paper, schooling problems based on containment control in multi-agent systems that have static or dynamic leaders under directed and undirected communication topologies are investigated. We propose a periodic impulsive containment control algorithm to realize schooling in multi-agent systems. Both ideal and quantized relative state measurements are considered under this framework. Some necessary and sufficient conditions, which depend on the eigenvalues of the Laplacian matrix that is associated with the communication graph, the impulsive period as well as the gain parameters, are obtained to realize the containment control of schooling. Finally, some numerical simulations are illustrated to verify the theoretical results.

scholarly journals Collective Coordination of High-Order Dynamic Multiagent Systems Guided by Multiple Leaders

2011 ◽  
Vol 2011 ◽  
pp. 1-11
Author(s):  
Xin-Lei Feng ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Second Order ◽  
High Order ◽  
Necessary And Sufficient Conditions ◽  
Numerical Examples ◽  
Necessary And Sufficient ◽  
Multiple Leaders ◽  
Theoretical Results

For second-order and high-order dynamic multiagent systems with multiple leaders, the coordination schemes that all the follower agents flock to the polytope region formed by multiple leaders are considered. Necessary and sufficient conditions which the follower agents can enter the polytope region by the leaders are obtained. Finally, numerical examples are given to illustrate our theoretical results.

Generation of chaotic attractors without equilibria via piecewise linear systems

2017 ◽  
Vol 28 (01) ◽  
pp. 1750008 ◽  
Author(s):  
R. J. Escalante-González ◽  
E. Campos-Cantón
Keyword(s):  
Dynamical System ◽  
Dynamical Systems ◽  
Chaotic Attractor ◽  
Piecewise Linear ◽  
Equilibrium Points ◽  
Sufficient Conditions ◽  
Chaotic Attractors ◽  
Necessary And Sufficient ◽  
Switched Dynamical System ◽  
Theoretical Results

In this paper, we present a mechanism of generation of a class of switched dynamical system without equilibrium points that generates a chaotic attractor. The switched dynamical systems are based on piecewise linear (PWL) systems. The theoretical results are formally given through a theorem and corollary which give necessary and sufficient conditions to guarantee that a linear affine dynamical system has no equilibria. Numerical results are in accordance with the theory.

Necessary and Sufficient Conditions for Group Consensus of Agents With Third-Order Dynamics in Directed Networks

2020 ◽  
Vol 142 (4) ◽  
Author(s):  
Onur Cihan ◽  
Mehmet Akar
Keyword(s):  
Directed Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Group Consensus ◽  
Directed Networks ◽  
Third Order ◽  
Systematic Method ◽  
Necessary And Sufficient ◽  
The Given ◽  
Theoretical Results

Abstract In this paper, we investigate the group consensus problem in directed networks where agents have third-order dynamics. Necessary and sufficient conditions on the controller parameters are obtained to ensure K-equilibria group consensus where K is determined by the structure of the directed graph. It is theoretically shown that, for an arbitrary directed graph, there exist controller parameters that satisfy the given conditions. A systematic method for choosing the controller parameters to guarantee group consensus is suggested and theoretical results are verified by numerical examples.

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.

Sign in / Sign up

Export Citation Format

Share Document