Finite-Time Weighted Average Consensus and Generalized Consensus Over a Subset

Abstract

In this letter, the finite-time consensus for arbitrary undirected graphs is discussed. We develop a parametric distributed algorithm as a function of a linear operator defined on the underlying graph, and provide a necessary and sufficient condition guaranteeing weighted average consensus in K steps, where K is the number of distinct eigenvalues of the underlying operator. Based on the novel framework of generalized consensus meaning that consensus is reached only by a subset of nodes, we show that the finite-time weighted average consensus can always be reached by a subset corresponding to the non-zero variables of the eigenvector associated with a simple eigenvalue of the operator. It is interesting that the final consensus state is shown to be freely adjustable if a smaller subset of consensus is admitted. Numerical examples including synthetic and real-world networks are presented to illustrate the theoretical results. Our approach is inspired by the recent method of successive nulling of eigenvalues

An Invocation Chain Test and Evaluation Method for Fog Computing

“…Algorithm 3 is the description of constructing the invocation chain algorithm. The input of the algorithm is AA, which draws the attack graph automatically by calling function dot in Graphviz software [18], and the output of the algorithm is V.…”

A Method of Multiple Attribute Group Decision Making Based on 2-Tuple Linguistic Dependent Maclaurin Symmetric Mean Operators

“…, (r n , a n ). There is no doubt that assigning different weights will affect the final decision of the group [32]. However, for some object that decision-makers prefer or hate, some decision-making experts can assign too good or too bad preference values.…”

Finite‐Time Scaled Consensus in Discrete‐Time Networks of Agents

“…If we interpret x as a signal, the successive application of A t on it constructs a graph filter. For more details regarding graph filter and its relationship with consensus, we refer the reader to .…”

“…Finite‐time convergence has also been considered as one of the most important performance indicators for the design of consensus algorithms (see e.g. ). In this brief paper, we show that finite‐time scaled consensus can always be achieved for connected bidirectional graphs via linear iterations in a distributed fashion.…”