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.

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 Consensus of Multiagent Systems with Packet Losses and Communication Delays Using a Novel Control Protocol

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Zheping Yan ◽  
Di Wu ◽  
Wei Zhang ◽  
Yibo Liu
Keyword(s):  
Spanning Tree ◽  
Multiagent System ◽  
Matrix Theory ◽  
High Order ◽  
Communication Delays ◽  
Packet Losses ◽  
Control Protocol ◽  
Directed Spanning Tree ◽  
Communication Topology ◽  
Double Integrator

This paper studies the consensus problem of multiagent system with packet losses and communication delays under directed communication channels. Different from previous research results, a novel control protocol is proposed depending only on periodic sampling and transmitting data in order to be convenient for practical implementation. Due to the randomicity of transmission delays and packet losses, each agent updates its input value asynchronously at discrete time instants with synchronized time stamped information and evolves in continuous time. Consensus conditions for multiagent system consists of three typical dynamics including single integrator, double integrator, and high-order integrator that are all discussed in this paper. It is proved that, for single integrator agents and double integrator systems with only communication delays, consensusability can be ensured through stochastic matrix theory if the designed communication topology contains a directed spanning tree. While, for double integrator agents and high-order integrator agents with packet losses and communication delays, the interval system theory is introduced to prove the consensus of multiagent system under the condition that the designed communication topology is a directed spanning tree. Finally, simulations are carried out to validate the effectiveness of the proposed solutions.

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 Group Consensus with a Dynamic Leader for Multiagent Systems via Sampled-Data Control

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Hong Xia ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao ◽  
Jun-Yan Yu
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sampling Period ◽  
Group Consensus ◽  
Sampled Data ◽  
Ultimate Boundedness ◽  
Tracking Errors ◽  
Data Control ◽  
Sampled Data Control ◽  
Theoretical Results

This paper considers a group consensus problem with a dynamic leader for multiagent systems in a sampled-data setting. With the leader’s state available to only a fraction of the followers, a distributed linear protocol based on sampled-data control is proposed for group consensus under fixed directed topology. On basis ofM-matrix theory, we derive a sufficient condition on the sampling period and the control parameter for ultimate boundedness of the tracking errors. Furthermore, simulation examples are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Reaching a Group-Agreement in Finite Time Under Acyclic Interaction Topology

2021 ◽  
Author(s):  
Xinru Ma ◽  
Hengyu Li ◽  
Tiehui Zhang ◽  
Jun Liu ◽  
Shaorong Xie ◽  
...  
Keyword(s):  
Finite Time ◽  
Multiagent System ◽  
Matrix Theory ◽  
Structural Characteristics ◽  
Mathematical Induction ◽  
Time Required ◽  
Interaction Topology ◽  
Theoretical Results ◽  
Group Agreement ◽  
Agreement Problem

Abstract This paper discusses the finite time agreement problem of networks with acyclic partition topology. In view of the structural characteristics of such network topology, mathematical induction is particularly suitable to prove the main conclusions in the paper. In addition, for the consideration of the finite time consensus problem, in addition to using basic matrix theory to verify the solution of the problem, this brief also has a more detailed analysis of the time required to reach consensus. Based on these two points, it is observed that the solution of this problem is due to the features of acyclic partition interactions and the continuity of the related finite time protocol and contributes to the research on the grouping consensus of multiagent system. Furthermore, simulation examples are presented 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 A New Algorithm for Distributed Control Problem with Shortest-Distance Constraints

2016 ◽  
Vol 2016 ◽  
pp. 1-6
Author(s):  
Yu Zhou ◽  
Wenfeng Zheng ◽  
Zhixi Shen
Keyword(s):  
Distributed Control ◽  
Multiagent Systems ◽  
Local Information ◽  
Common Point ◽  
Consensus Algorithm ◽  
Time Dynamics ◽  
Shortest Distance ◽  
Distributed Control Problem ◽  
Distance Problem ◽  
Theoretical Results

This paper investigates the distributed shortest-distance problem of multiagent systems where agents satisfy the same continuous-time dynamics. The objective of multiagent systems is to find a common point for all agents to minimize the sum of the distances from each agent to its corresponding convex region. A distributed consensus algorithm is proposed based on local information. A sufficient condition also is given to guarantee the consensus. The simulation example shows that the distributed shortest-distance consensus algorithm is effective for our theoretical results.

scholarly journals Robust Consensus for Nonlinear Multiagent Systems with Uncertainty and Disturbance

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Zhiqiang Li ◽  
Chengjie Xu ◽  
Chen Liu ◽  
Haichuan Xu
Keyword(s):  
Numerical Simulation ◽  
Multiagent Systems ◽  
Lyapunov Stability ◽  
Matrix Theory ◽  
Lyapunov Stability Theory ◽  
Consensus Protocol ◽  
Evolution Behavior ◽  
Robust Consensus ◽  
Theoretical Results ◽  
Relative States

This paper investigates robust consensus for nonlinear multiagent systems with uncertainty and disturbance. The consensus evolution behavior is studied under general consensus protocol when each node is disturbed by the relative states between the node and its neighbors. At first, the robust consensus condition is obtained and the convergency analysis is given by using Lyapunov stability theory and matrix theory. Then, the practical consensus is investigated and the bound of the error states is presented. Finally, two numerical simulation examples are given to illustrate the proposed theoretical results.

scholarly journals On the Observability of Leader-Based Multiagent Systems with Fixed Topology

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Bo Liu ◽  
Ningsheng Xu ◽  
Housheng Su ◽  
Licheng Wu ◽  
Jiahui Bai
Keyword(s):  
Multiagent Systems ◽  
Second Order ◽  
High Order ◽  
Numerical Examples ◽  
First Order ◽  
Leader Following ◽  
Fixed Topology ◽  
Agreement Protocols ◽  
Theoretical Results ◽  
Double Integrator

This paper investigates the observability of first-order, second-order, and high-order leader-based multiagent systems (MASs) with fixed topology, respectively. Some new algebraic and graphical characterizations of the observability for the first-order MASs are established based on agreement protocols. Moreover, under the same leader-following framework with the predefined topology and leader assignment, the observability conditions for systems of double-integrator and high-integrator agents are also obtained. Finally, the effectiveness of the theoretical results is verified by numerical examples and simulations.

scholarly journals Mean Square Consensus for Uncertain Multiagent Systems with Noises and Delays

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Yuangong Sun
Keyword(s):  
Multiagent Systems ◽  
Stochastic Analysis ◽  
Matrix Theory ◽  
Time Varying ◽  
Mean Square ◽  
Numerical Examples ◽  
Measurement Noises ◽  
Approximation Type ◽  
Theoretical Results ◽  
Mean Square Consensus

This paper investigates the consensus problem in mean square for uncertain multiagent systems with stochastic measurement noises and symmetric or asymmetric time-varying delays. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the convergence of a class of distributed stochastic approximation type protocols with time-varying consensus gains. Numerical examples are also given to illustrate the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document