Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies

By Shreyas Sundaram, Christoforos N. Hadjicostis. 2007

235 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays (2015, background): “A strand of research (see, for example, [26]–[29]) is based on the factorization of the averaging matrix to orchestrate 2325-5870 © 2015 IEEE.”
Decentralised minimal-time consensus (2011, methodology): “The principles for the computation of the asymptotic ﬁnal value of the network in ﬁnite time were introduced in [13].”
Finite-Time Consensus Problems for Networks of Dynamic Agents (2007, unknown): “In [7], Sundaram and Hadjicostis gave a ﬁnite-time consensus algorithm for discrete-time systems, by using the property of minimal polynomial of weight matrix.”
Privacy preserving average consensus (2014, background): “This may turn out to be desirable for some applications, such as malicious intrusion detection and identification [8] and finite-step consensus [9], [10].”
Multi‐surface sliding control for fast finite‐time leader–follower consensus with high order SISO uncertain nonlinear agents (2014, methodology): “The work in [33] discusses the finite-time consensus algorithm for discrete-time systems.”
A gossip algorithm for convex consensus optimization over networks (2010, background): “, [3]–[16]), including a line of research that focuses on solving problem (1) for an optimal consensus x [1], [2], [17]–[28].”
Distributed finite-time tracking control for multi-agent systems: An observer-based approach (2013, methodology): “In [17], a finite-time consensus algorithm for discrete-time systems was studied by using the property of minimal polynomial of weight matrix.”
Consensus in multi-agent systems: a review (2021, methodology): “Using the properties of the minimal polynomial of the weighted matrix, Sundaram and Hadjicostis (Sundaram and Hadjicostis 2007) presented a finite-time consensus algorithm for discrete-time systems.”
A survey of distributed optimization (2019, methodology): “Independently, for quadratic local objective functions, a different distributed algorithm based on the ﬁnite-time consensus technique ( Sundaram & Hadjicostis, 2007; Yuan, 2012; Yuan et al., 2013 ) and the ratio consensus algorithm proposed in Charalambous et al. (2015) ; Domínguez-García and…”