20 July 2020 in IEEE Transactions on Automatic Control
This paper considers the problem of solving linear algebraic equations of the form Ax=b among multi agents which seek a solution by using local information in presence of random communication topologies. The equation is solved by m agents where each agent only knows a subset of rows of the partitioned matrix [A,b]. The problem is formulated such that this formulation does not need the distribution of random interconnection graphs. Therefore, this framework includes asynchronous updates or unreliable communication protocols. The random Krasnoselskii-Mann iterative algorithm is applied that converges almost surely and in mean square to a solution of the problem for any matrices A and b and any initial conditions of agents' states. The algorithm is a totally asynchronous algorithm without requiring a priori B-connectivity and distribution dependency assumptions. The algorithm is able to solve the problem even if the weighted matrix of the graph is periodic and irreducible for synchronous protocol. It is demonstrated that the limit point to which the agents' states converge is determined by the unique solution of a convex optimization problem regardless of the distribution of random co
28 January 2013 in IEEE Transactions on Signal Processing
In this paper, we consider the problem of distributed average computation over communication networks whose channels are non-ideal, but noisy and/or intermittent. Channel intermittency captures randomness of network interconnections and packet-drop links. Based on input-output properties of feedback systems, we propose novel iterative algorithms that incorporate a networked feedback compensator to mitigate effects of the unreliable communication on distributed averaging. The new algorithms are time-invariant and do not suffer from the random walk behavior to additive noise of other average consensus algorithms. Moreover, the use of the link state information at the receiver leads to a new algorithm, which computes averages approximately correctly in the presence of intermittent communication and additive noise, under certain conditions.
1 January 2010 in International Journal of Systems, Control and Communications
In this paper, we investigate the consensus problem over communication networks where the communication channels are represented by stable Linear Time Invariant (LTI) systems. We give the necessary and sufficient condition to reach consensus under our protocol and show that the consensus value is not only determined by the agents' initial states and the network topology but also by the channels' dynamics. We further show that if the H
1 January 2005 in Communications in Information and Systems