• Corpus ID: 65220600

Distributed Finite Time Termination of Consensus in the Presence of Delays

@inproceedings{Prakash2016DistributedFT,
  title={Distributed Finite Time Termination of Consensus in the Presence of Delays},
  author={Mangal Prakash and Saurav Talukdar and Sandeep Attree and Vikas Yadav and Murti V. Salapaka},
  year={2016}
}
Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and communication resources. In this article, an algorithm is proposed which enables each node to detect in a distributed manner and in finite number of iterations, when every agent in the network is within a user specified threshold of the consensus value… 
View PDF on arXiv
2 Citations
Background Citations
1

Figures and Tables from this paper

2 Citations

Distributed apportioning in a power network for providing demand response services

A distributed scheme is proposed that enables a DER in a network to arrive at viable power reference commands that satisfies the DERs local constraints on its generation and loads it has to service, while, the aggregated behavior of multiple DDERs in the network and their respective loads meet the ancillary services demanded by the grid.

Physics Informed Topology Learning in Networks of Linear Dynamical Systems

References

SHOWING 1-10 OF 30 REFERENCES

Convergence rate for consensus with delays

This work considers a widely studied consensus algorithm, in which at each time step, every agent forms a weighted average of its own value with values received from the neighboring agents, and provides a bound on the time required to reach the consensus.

The Impact of Communication Delays on Distributed Consensus Algorithms

The analysis of the fixed delay model shows that convergence to a consensus is guaranteed and the rate of convergence is reduced by no more than a factor O(B^2) where B is the maximum delay on any link.

Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays

This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number of steps on interconnection topologies described by strongly connected directed graphs (digraphs).

Average Consensus in the Presence of Delays in Directed Graph Topologies

A protocol is proposed that ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links, and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices.

Distributed protocol for determining when averaging consensus is reached

In this paper a method is developed to distributively determine when the consensus has reached within a given error margin, which takes finite time and occurs at each node simultaneously.

Distributed consensus and optimization under communication delays

Two ways to model delays are proposed, assuming each edge of a communication network has a fixed delay and a novel way to model random delays per edge is proposed.

From Simplicity to Complexity Based on Consensus: A Case Study

Counter-intuitively, it is shown for the first time that the complexity of shortest path planning can emerge from a perturbed version of min-consensus protocl, which as a case study may shed lights to researchers in the field of distributed control to re-think the nature of complexity and the distance between control and intelligence.

A scheme for robust distributed sensor fusion based on average consensus

  • Lin XiaoStephen P. BoydS. Lall
  • Computer Science, Mathematics
    IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005.
  • 2005
This work proposes a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters, and shows that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs are jointly connected.

Problems in decentralized decision making and computation

A scheme whereby a set of decision makers (processors) exchange and update tentative decisions which minimize a common cost function, given information they possess is considered; it is shown that they are guaranteed to converge to consensus.

Convergence in Multiagent Coordination, Consensus, and Flocking

We discuss an old distributed algorithm for reaching consensus that has received a fair amount of recent attention. In this algorithm, a number of agents exchange their values asynchronously and form…