Mathematical Problems in Engineering

Volume 2018, Article ID 4635701, 13 pages

https://doi.org/10.1155/2018/4635701

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

^{1}Department of Electrical Engineering, Bahria University, Islamabad, Pakistan^{2}Department of Electrical Engineering, COMSATS Institute of IT, Attock, Pakistan^{3}Department of Computer Systems Engineering, University of Engineering and Technology, Peshawar, Pakistan

Correspondence should be addressed to Ali Mustafa; kp.ude.kcotta-tiic@afatsum.ila

Received 8 September 2017; Accepted 31 January 2018; Published 11 March 2018

Academic Editor: Ton D. Do

Copyright © 2018 Ali Mustafa et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

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.

#### 1. Introduction

Multiagent systems can be defined as a system that is distributed in nature; multiple agents in a network communicate with each other with their limited resources to achieve their local and global goal in a cooperative manner. It is important to mention here that agents are intelligent nodes and have some degree of independence to take their decisions to achieve their desired goals. Such coordination in multiagent system is referred to as a consensus, and it is considered as one the fundamental research activities in distributed control strategy. Study of multiagent systems attracted scientists and researchers from diverse fields of control theory, applied mathematical modelling, computer sciences, engineering, and so on to study the significance of distributed control of agents in a network, as distributed multiagents systems gain a lot of significance in various real time applications such as flocking [1–4], wireless sensor networks (WSN) [5, 6], coordination control of robots [7, 8], underwater vehicles, unmanned aerial vehicles [9, 10], intelligent transportation systems [11], robotics [12], formation control [13, 14], balancing of load in parallel computers [15], and intelligent decentralized mechanism for smart grids [16, 17].

Consensus problem was first investigated in late 1960s in the modelling of statistical theory and management science [18]. Moreover in the fields of control system theory, consensus problem was initially discussed by [19]. Computer sciences problem focusing on animal aggregation through consensus control is studied by the author in [20]. In latest research horizons of consensus control is pioneered by Olfati-Saber and Murray; they utilize the concepts of graph and matrix theories along with the different network topologies with directed and undirected graph connectivity [21, 22]. Later on authors in [23] implement the consensus control for dynamically changing topologies. Moreover, consensus in switching network topologies is addressed by [24, 25], filter designing for consensus is addressed by [26], optimized solution for large scale industry using distributed consensus algorithm is proposed by the authors in [27], and Kalman filtering design for distributed consensus approach is initially addressed in [28]. Impulsive control as an important mechanism is highlighted in [29]. Time synchronized algorithms for various application are discussed by authors in [30–32]. Likewise, concept of asynchronous consensus under different network environments is presented by authors in [33, 34].

After concisely discussing various theories and the existing approaches, we are suggesting a new control mechanism for attaining robust average consensus for asynchronous communication in distributed multiagent network centred on discrete time information sharing among the neighbours within the communication network. Practically such networks may suffer communication delays, information loss, broken communication links, unreliable switching network topology, and limitation in channel capacity. So in our proposed solution, we are considering resource constrained intelligent agents with limited communication abilities and also simulated the proposed network control mechanism under both reliable and unreliable random network topologies. Most importantly as mentioned above it is asynchronous in nature, which means that each agent communicating in a network is adjusting its dynamics independently with respect to other neighbouring agents. In proposed scheme starting time of each agent is common but the update time of each agent in a network is assigned randomly; in other words we can say update time of each agent is asynchronous and depending on upper and lower bound of the time. For designing of the proposed control algorithm we used the key concepts from the theory of graph and nonnegative matrix along with state space model to prove the convergence conditions. Proposed algorithm is compared with other existing protocols with a synchronous communication in four different scenarios under reliable and unreliable network topologies and results are compared it a tabular form consisting of various performance parameters. Structure of the paper is organised as follows. Key concepts from the matrix theory and algebraic graph theory are presented in Section 2, convergence analysis is proved in Section 3, and Section 4 is enriched with the proposed control algorithm. Numerical simulation and comparison analysis of performance parameters are presented in Section 5. Section 6 is devoted for concluding remarks.

#### 2. Preliminaries from Algebraic Graph and Matrix Theory

Algebraic graph theory and nonnegative matrix theory are considered as a preliminary tool for designing and convergence analysis in distributed algorithms in multiagent systems. In this segment significant fundamental concepts are concisely deliberated to enhance the understanding of the projected investigation.

In algebraic graph theory, graph is fundamentally a group of linked agents communicating with each other through communication links. Mathematically it can be represented as . Agents set in a graph are called vertex set and they can be written as , where are the number of agents in a graph. Moreover, connection links between vertices are referred to as an edge set = . Graph can be classified into two types, directed graph and undirected graph. In directed communication between the agents is one way demonstrating data flowing from vertex to and vice versa. Similarly in undirected graph the communication between vertices is bidirectional. Furthermore, edge set consists of order pairs of vertices representing the information flow. Directly connected vertices which are directly communicating with each other through edges are known as neighbour and algebraically notated as for agent . In graph theory connectivity of the agents in a network is represented by matrix, known as adjacency matrix . Degree matrix delivers the information about the total neighbours connected with any agent in a communication network. Additionally if one vertex in a network has the direct path to all the vertices in a network, then the connectivity graph is supposed to procedure a spanning tree. Spanning tree is considered as one vital convergence condition for consensus in reliable communication but not considerably enough for the systems with time varying delays [35]. If edges in a graph have weights then the matrix is called weighted matrix and summation of the weights coming towards the vertex is called in-degree and alike sum of outward weight is said to be out-degree [36, 37]. Few other matrices which are considered to be of prime importance in convergence analysis for the distributed consensus algorithms are named Laplacian matrix , rank 1 matrix, stochastic matrix , and SIA matrix [38].

Furthermore, when designing the weighting matrix to validate the convergence condition towards a targeted value, then there are multiple approaches available to design such matrices. Local degree weight matrix is one of the popular methodologies, which states that the highest out-degree of any two incident agents is assigned as weight on each edge [39]. It is significant to mention here that it is compulsory that each agent in a network must possesses the knowledge of out-degrees of all of its neighbors. Mathematically we can express

Similarly one of the popular techniques is for designing weigh matrix as metropolis hasting weights. It can be defined as the fact that all agents must know the out-degree of all of its neighbors but it is essential to mention here that the graph topology is changing at all instants of time. It can be algebraically expressed as [40, 41]

Moreover, while in designing process of distributed consensus algorithm, some useful lemmas and facts from the theory of controls play a very significant role to produce desire results to achieve convergence.

Lemma 1. *Assume a collection of stochastic matrices . The final graph which is produced after performing the union operation of all the graphs in matrices set must possess the spanning tree; afterwards the produced matrix outcome is called a SIA matrix [23].*

Lemma 2. *Stochastic matrix is supposed to be a SIA, if and only if a spanning tree in is present [42].*

#### 3. Convergence Condition

This section will deal with the convergence analysis of the proposed algorithm based on the given below distributed iteration:where ranges between , and similarly .

is the weight on at agent , where . By assigning for , we can write (3) in a vector form asby utilizing the concept of a -step transition matrix, we can state thatwhere in (4) represents the sparsity design of the matrix with restraint, whereAfter defining the sparsity pattern of the matrix, we can now transform (4) asHere it is important to highlight that (8) is valid for all :Now the primary goal is to achieve a consensus and to select a weighting matrix in such a way that the convergence condition is satisfied and converge to the average vector, with any initial value :where represents the number of participating agents in communication network and a 1 is a vector of ones:

If we now compare (10) with (11), we will attainHere we compare the terms in (12), and we will come up withFrom (13) we can compute the equations for different performance parameters for convergence analysis; the asymptotic convergence factor [26] is calculated aswhere .

Generally convergence is mentioned as a degree of error reduction with refinement towards zero for finite elements with grid spacing. Similarly asymptotic convergence is defined as a convergence behaviour of the system when grid arrangement is considered very trivial in a matrix and error between two states ranges towards zero.

From (14), the convergence time can be computed as

Convergence time of any system is defined as a computation time, exactly how speedily different agents in a network touch a state of consistent convergence. It is considered to be one of the foremost goals and vital performance indicators in designing of distributed algorithms.

One of the other important performance indicators used for network convergence is matrix spectral radius and it is denoted by . It is a biggest absolute value of its eigenvalues in the matrix spectrum. Mathematically it can be expressed as

#### 4. Proposed Algorithm

In the field of distributed multiagent systems, its primary impression that consensus algorithms enforce the network agents communicating in a network towards a common value by information exchange by their neighbourhood if the communication is reliable; network topology is considered fixed. But achieving consensus for the cases in which network connectivity is unreliable, communication is asynchronous and update time for the network agents varying time to time is really challenging.

In this section we are proposing a consensus algorithm for distributed network consisting of autonomous agents (i.e., ), whose directed graph topology is considered as a fixed (reliable) and for switching topology (unreliable). Agents are sharing a common state space with asynchronous communication in terms of different update time for each agent. Initial start time for all agent is considered the same but later on each agent adjusts its current state value, depending on the information received from other set of defined neighbors at a particular instance of time. Let represents the initial state of an agent and let . We can represent designed discrete time multiagent system as , where is a state feedback controller which needs to be designed as well with the help of weighting matrix. If we suppose as an initial value and it converges to a stable value , in such away that for all as , then it is said to achieve consensus. If agent receives the state information of its neighbors at , then agent is assumed to take the following dynamics in time interval :where .

We assume that agent receives its neighbors states at update times which can be denoted as . In proposed model we are considering the following condition, which presumed to be essentially contented by .

*Condition. *For any , where , .

The core intention behind the update times is to acquire an information of neighbours state value by an agent to apprise its dynamic consequently. Two time bounds are presented in the proposed algorithm, upper bound and lower bound . Both have their own importance and significance in convergence analysis under asynchronous time update communication. Lower bound of time interval among any two consecutive update time offers assurance to the authentication of the consensus algorithm, while on the other hand upper bound ; of supports the dissimilar states of an agents to assemble themselves on a common value.

While designing a proposed algorithm, primary goals are to achieve quick convergence, reduce the iterations for bounded convergence, and also meet the best of performance indicators as mentioned in the previous section.

Proposed algorithm can be mathematically expressed aswe can write

In the above equation is the degree of agent or we can say the total neighbors of an agent .

*Proof of an Algorithm. *SupposeSimilarly At this point it is significant to articulate a global state equation for a system, which is intended for average convergence in the given form as Global input vector can be formulated asFor unreliable network topology the weighting matrix is not fixed, so for the particular case we used the following symbolization in (23). After deputizing (23) in (22), we will getWe can additionally write the following after applying the concept of Laplacian matrix:Distributed linear iteration in (26) designates for :Now equating (11) and (28), Now referring to (13)Therefore,If we consider a system, with infinite number of agents, that is, , then we can writeThe concluding outcome of (32) will develop as

#### 5. Numerical Examples and Simulation Results

In this section stimulation results are presented for various numerical examples. All examples are simulated in Matlab environment for generating results. This section also validate the efficiency of projected algorithm in four different scenarios for asynchronous time update communication under reliable and unreliable communication. To compare the benchmarks of proposed algorithm, a detailed simulation comparison with other existing approaches is performed. For that particular purpose four different performance parameters, that is, total number of iterations, CPU time, asymptotic convergence factor, and convergence time, have been considered to compute the results for each scenario. Total number of iterations is basically the iteration count in which the consensus is achieved using Matlab software and similarly CPU time is the processing time of the machine on which all the simulation are carried out with same computational resources. Error graphs of proposed method and other existing approaches are also produced in this section for better understanding. Initial values are assigned to agents as and in all four numerical examples. For any is evenly distributed between and , lower time bound is , and upper time bound is . Additionally error tolerance considered is , in which the total number of iterations is represented by , where

*Example 1 (fixed network topology with asynchronous time update). *In this example, a case of reliable communication among multiagents with asynchronous time update is considered (Figure 1). Communication topology remains fixed throughout the simulation but the update times of agents are diverse and independent of each others. Each agent can get all of its neighbour states only at its update times. For any is evenly distributed between and . A network of 30 agents is considered which are communicating with each other under reliable conditions. All agents have to develop an average consensus on the value of . To evaluate the performance of proposed algorithm, the comparison results of Example 1, simulated by proposed and existing methods are shown in Table 1. An error graph is generated in Figure 2, which evaluates how fast a method converges to its consensus value. It also helps us to graphically evaluate the performance of different methods. The consensus graphs of proposed method, Metropolis method, and local degree method are shown in Figures 3, 4, and 5 respectively.