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.

scholarly journals Distributed Consensus of Semi-Markovian Jumping Multiagent Systems with Mode-Dependent Topologies

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Yidao Ji
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Mean Square ◽  
Sampled Data ◽  
Distributed Consensus ◽  
Consensus Protocol ◽  
Markov Jump ◽  
Markovian Jumping ◽  
Mean Square Stability

This paper investigates the distributed consensus problem of multiagent systems with semi-Markovian jumping dynamics in the mean-square sense. Moreover, the mode-dependent communication topologies and sampled-data consensus protocol over the networks are considered. By semi-Markov jump theory, the consensus problem is first transformed into a mean-square stability problem. Then, sufficient conditions are established with the designed mode-dependent consensus protocol. Finally, a numerical example is provided for verifying the effectiveness of our 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 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.

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 Distributed Node-to-Node Consensus of Multiagent Systems with Delayed Nonlinear Dynamics and Intermittent Communications

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Kexin Jia ◽  
Hongjie Li ◽  
Wenqiang Zheng ◽  
Qinyou Mou ◽  
Jiajun Shao
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Matrix Theory ◽  
Lyapunov Stability Theory ◽  
Threshold Value ◽  
Consensus Protocol ◽  
Time Duration ◽  
Communication Time ◽  
Intermittent Measurements ◽  
Intermittent Communications

The paper is concerned with the problem of distributed node-to-node consensus of multiagent systems with delayed nonlinear dynamics and communication constraints. A new kind of consensus protocol based only on the intermittent measurements of neighboring agents is proposed to make each follower track the corresponding leader asymptotically. Based on the Lyapunov stability theory andM-matrix theory, some novel and simple criteria are derived for node-to-node consensus of multiagent systems. It is shown that consensus can be reached if the communication time duration is larger than the corresponding threshold value. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.

scholarly journals Asynchronous Communication under Reliable and Unreliable Network Topologies in Distributed Multiagent Systems: A Robust Technique for Computing Average Consensus

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Ali Mustafa ◽  
Muhammad Najam ul Islam ◽  
Salman Ahmed ◽  
Muhammad Ahsan Tufail
Keyword(s):  
Multiagent Systems ◽  
Time Synchronization ◽  
Matrix Theory ◽  
Asynchronous Communication ◽  
Consensus Protocol ◽  
Basic Principles ◽  
Consensus Algorithms ◽  
Multiagent Networks ◽  
Asynchronous Communications ◽  
Network Topologies

Nearly all applications in multiagent systems demand precision, robustness, consistency, and rapid convergence in designing of distributed consensus algorithms. Keeping this thing in our sight, this research suggests a robust consensus protocol for distributed multiagent networks, continuing asynchronous communications, where agent’s states values are updated at diverse interval of time. This paper presents an asynchronous communication for both reliable and unreliable network topologies. The primary goal is to delineate local control inputs to attain time synchronization by processing the update information received by the agents associated in a communication topology. Additionally in order to accomplish the robust convergence, modelling of convergence analysis is conceded by commissioning the basic principles of graph and matrix theory alongside the suitable lemmas. Moreover, statistical examples presenting four diverse scenarios are provided in the end; produced results are the recognisable indicator to authenticate the robust effectiveness of the proposed algorithm. Likewise, a simulation comparison of the projected algorithm with the other existing approaches is conducted, considering different performance parameters are being carried out to support our claim.

scholarly journals Multiagent Consensus Control under Network-Induced Constraints

2013 ◽  
Vol 2013 ◽  
pp. 1-4
Author(s):  
Won Il Kim ◽  
Rong Xiong ◽  
Qiuguo Zhu ◽  
Jun Wu
Keyword(s):  
Multiagent Systems ◽  
Information Exchange ◽  
Design Procedure ◽  
Mean Square ◽  
Markov Jump ◽  
Consensus Control ◽  
Markov Jump System ◽  
System Method ◽  
Necessary And Sufficient ◽  
Mean Square Consensus

Mean consensus problem is studied using a class of discrete time multiagent systems in which information exchange is subjected to some network-induced constraints. These constraints include package dropout, time delay, and package disorder. Using Markov jump system method, the necessary and sufficient condition of mean square consensus is obtained and a design procedure is presented such that multiagent systems reach mean square consensus.

scholarly journals State Consensus Analysis and Design for High-Order Discrete-Time Linear Multiagent Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Yanrong Ge ◽  
Yangzhou Chen ◽  
Yaxiao Zhang ◽  
Zhonghe He
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
The State ◽  
Feedback Gain ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Consensus Function ◽  
Consensus Analysis ◽  
Analysis And Design ◽  
Time Linear

The paper deals with the state consensus problem of high-order discrete-time linear multiagent systems (DLMASs) with fixed information topologies. We consider three aspects of the consensus analysis and design problem: (1) the convergence criteria of global state consensus, (2) the calculation of the state consensus function, and (3) the determination of the weighted matrix and the feedback gain matrix in the consensus protocol. We solve the consensus problem by proposing a linear transformation to translate it into a partial stability problem. Based on the approach, we obtain necessary and sufficient criteria in terms of Schur stability of matrices and present an analytical expression of the state consensus function. We also propose a design process to determine the feedback gain matrix in the consensus protocol. Finally, we extend the state consensus to the formation control. The results are explained by several numerical examples.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document