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 Output Consensus Regulation for State-Unmeasurable Discrete-Time Multiagent Systems with External Disturbances

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
He Jiang ◽  
Dongsheng Yang
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Consensus Protocol ◽  
External Disturbances ◽  
State Observers ◽  
Network Topologies ◽  
Dynamic Compensator ◽  
Design Protocol ◽  
The Mathematical Model

This paper deals with the output consensus regulation problem for discrete-time multiagent systems with state-unmeasurable agents and external disturbances under directed communication network topologies. Firstly, the mathematical model for the output consensus problem of discrete-time multiagent systems is deduced and formulated via making matrix transformation. Then, based on state observers, a novel output consensus protocol with dynamic compensator which is used as observer for the exosystem is proposed to solve this problem. Some knowledge of matrix theory and graph theory is introduced to design protocol parameters and the convergence of output consensus errors is proved. Finally, a numerical simulation example is shown to verify the effectiveness of the proposed protocol design.

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 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 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 Leader-Following Bounded Consensus and Multiconsensus of Multiagent Systems

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Chao Long ◽  
Chunxi Yang ◽  
Guangsong Han ◽  
Yingbo Huang ◽  
Shichang Han
Keyword(s):  
Multiagent Systems ◽  
Impulsive Control ◽  
Laplacian Matrix ◽  
Necessary And Sufficient Condition ◽  
Velocity Data ◽  
Consensus Protocol ◽  
Consensus Tracking ◽  
Multiagent Networks ◽  
Leader Following ◽  
Necessary And Sufficient

This paper investigates the problem of leader-following consensus and multiconsensus of multiagent systems. A leader-following and bounded consensus protocol via impulsive control for multiagent systems is proposed by using sampled position and velocity data. Consensus and multiconsensus commutative evolution stimulated by varying intelligence degrees of each agent can be achieved to avoid obstacles. Especially, the multiconsensus leader-following can be obtained without grouping the multiagent networks in advance. The necessary and sufficient condition is given to the leader-following bounded consensus tracking of the system by using the Hurwitz criterion and properties of the Laplacian matrix. A simulation is provided to verify the availability of the proposed impulsive control protocol. Furthermore, the result can be applied in obstacle avoidance and round up of target by regulating the intelligence degrees.

scholarly journals Consensus for Mixed-Order Multiagent Systems over Jointly Connected Topologies via Impulse Control

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-7 ◽  
Author(s):  
Fenglan Sun ◽  
Xiaogang Liao ◽  
Yongfu Li ◽  
Feng Liu
Keyword(s):  
Multiagent Systems ◽  
Impulse Control ◽  
Control Technique ◽  
Consensus Problem ◽  
Multiagent Networks ◽  
Mixed Order ◽  
Network Topologies ◽  
Simulation Results ◽  
Theoretical Results ◽  
Over Time

Because of the complexity of the environment, the dynamics of agents in the same system may be different. That is, the dynamics of some agents may be first ordered, and the others may be second ordered, even high ordered. In addition, the network topologies of systems are always varying over time. Because of these facts, this paper studies the consensus problem of the mixed-order multiagent networks over the jointly connected topologies. By adopting the impulse control technique, some control protocols are proposed based on the information of the agents themselves and their neighbors. Several simulation results are given to verify the correctness of the theoretical results.

scholarly journals Partial Component Consensus of Discrete-Time Multiagent Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-5
Author(s):  
Wenjun Hu ◽  
Gang Zhang ◽  
Zhongjun Ma ◽  
Binbin Wu
Keyword(s):  
Multiagent Systems ◽  
Discrete Time ◽  
Matrix Theory ◽  
Pinning Control ◽  
Directed Network ◽  
Strong Function ◽  
Partial Stability ◽  
Partial Component ◽  
The Matrix ◽  
Error System

The multiagent system has the advantages of simple structure, strong function, and cost saving, which has received wide attention from different fields. Consensus is the most basic problem in multiagent systems. In this paper, firstly, the problem of partial component consensus in the first-order linear discrete-time multiagent systems with the directed network topology is discussed. Via designing an appropriate pinning control protocol, the corresponding error system is analyzed by using the matrix theory and the partial stability theory. Secondly, a sufficient condition is given to realize partial component consensus in multiagent systems. Finally, the numerical simulations are given to illustrate the theoretical results.

Scaling Membership of Byzantine Consensus

2020 ◽  
Vol 38 (3-4) ◽  
pp. 1-31
Author(s):  
Burcu Canakci ◽  
Robbert Van Renesse
Keyword(s):  
Fault Tolerant ◽  
Initial Conditions ◽  
Low Latency ◽  
Energy Costs ◽  
Prior Work ◽  
Improve Performance ◽  
Consensus Protocol ◽  
Normal Case ◽  
Network Topologies ◽  
And Performance

Scaling Byzantine Fault Tolerant (BFT) systems in terms of membership is important for secure applications with large participation such as blockchains. While traditional protocols have low latency, they cannot handle many processors. Conversely, blockchains often have hundreds to thousands of processors to increase robustness, but they typically have high latency or energy costs. We describe various sources of unscalability in BFT consensus protocols. To improve performance, many BFT protocols optimize the “normal case,” where there are no failures. This can be done in a modular fashion by wrapping existing BFT protocols with a building block that we call alliance . In normal case executions, alliance can scalably determine if the initial conditions of a BFT consensus protocol predetermine the outcome, obviating running the consensus protocol. We give examples of existing protocols that solve alliance. We show that a solution based on hypercubes and MAC s has desirable scalability and performance in normal case executions, with only a modest overhead otherwise. We provide important optimizations. Finally, we evaluate our solution using the ns3 simulator and show that it scales up to thousands of processors and compare with prior work in various network topologies.

scholarly journals Eigenvalue Based Approach for Global Consensus in Multiagent Systems with Nonlinear Dynamics

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Wei Qian ◽  
Lei Wang
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Multiagent System ◽  
Symmetric Matrix ◽  
Algebraic Connectivity ◽  
Communication Graph ◽  
Consensus Protocol ◽  
Global Consensus ◽  
The Common ◽  
Analytical Result

This paper addresses the global consensus of nonlinear multiagent systems with asymmetrically coupled identical agents. By employing a Lyapunov function and graph theory, a sufficient condition is presented for the global exponential consensus of the multiagent system. The analytical result shows that, for a weakly connected communication graph, the algebraic connectivity of a redefined symmetric matrix associated with the directed graph is used to evaluate the global consensus of the multiagent system with nonlinear dynamics under the common linear consensus protocol. The presented condition is quite simple and easily verified, which can be effectively used to design consensus protocols of various weighted and directed communications. A numerical simulation is also given to show the effectiveness of the analytical result.

Sign in / Sign up

Export Citation Format

Share Document