Trading accuracy for speed in approximate consensus

@article{Beal2016TradingAF,
  title={Trading accuracy for speed in approximate consensus},
  author={Jacob Beal},
  journal={The Knowledge Engineering Review},
  year={2016},
  volume={31},
  pages={325 - 342}
}
  • J. Beal
  • Published 1 September 2016
  • Computer Science
  • The Knowledge Engineering Review
Abstract Approximate consensus is an important building block for distributed systems, used overtly or implicitly in applications as diverse as formation control, sensor fusion, and synchronization. Laplacian-based consensus, the current dominant approach, is extremely accurate and resilient, but converges slowly. Comparing Laplacian-based consensus to exact consensus algorithms, relaxing the requirements for accuracy and resilience should enable a spectrum of algorithms that incrementally… 
From Field-Based Coordination to Aggregate Computing
TLDR
The development and antecedents of field calculus are traced, the current state of aggregate computing theory and practice is reviewed, and a roadmap of current research directions are discussed that can significantly impact the agenda of coordination models and languages are discussed.
2 Coordination , Self-organisation , and Fields
TLDR
The development and antecedents of field calculus are traced, the current state of aggregate computing theory and practice is reviewed, and a roadmap of current research directions are discussed that can significantly impact the agenda of coordination models and applications are discussed.
Robot swarms need blockchain technology: A comparison of consensus protocols and their resilience to Byzantine robots
  • V., É., M.
  • Computer Science, Mathematics
  • 2019
TLDR
This work shows how a swarm of robots can achieve consensus even in the presence of Byzantine robots by exploiting blockchain technology, and compares it to state-of-the-art consensus protocols using a robot swarm simulator.
From distributed coordination to field calculus and aggregate computing
Blockchain Technology Secures Robot Swarms: A Comparison of Consensus Protocols and Their Resilience to Byzantine Robots
TLDR
This work shows how a swarm of robots can achieve consensus even in the presence of Byzantine robots by exploiting blockchain technology, and compares it to state-of-the-art consensus protocols using a robot swarm simulator.

References

SHOWING 1-10 OF 21 REFERENCES
Accelerating Approximate Consensus with Self-Organizing Overlays
TLDR
A new algorithm is presented, Power Law Driven Consensus, which uses a self-organizing virtual overlay network to accelerate convergence, at a cost of decreasing the predictability of the final converged value.
Consensus and Cooperation in Networked Multi-Agent Systems
This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in
Laplacian-based consensus on spatial computers
TLDR
This paper shows that the family of self-organizing protocols based on the graph Laplacian of a network are impractical as well, and finds that these protocols have an expected convergence time of O(diameter2) when the inputs are strongly correlated with location.
Consensus problems in networks of agents with switching topology and time-delays
TLDR
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Gossip Algorithms
  • D. Shah
  • Computer Science
    Found. Trends Netw.
  • 2009
TLDR
A systematic survey of many of the recent results on Gossip network algorithms, which utilize interdisciplinary tools from Markov chain theory, Optimization, Percolation, Random graphs, Spectral graph theory, and Coding.
Distributed Algorithms
  • N. Lynch
  • Computer Science
    Lecture Notes in Computer Science
  • 1994
TLDR
This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Fast Distributed Algorithms for Computing Separable Functions
TLDR
The main contribution of this paper is the design of a distributed randomized algorithm for computing separable functions that is shown to depend on the running time of a minimum computation algorithm used as a subroutine.
Infrastructure for engineered emergence on sensor/actuator networks
TLDR
This work has begun the process of transforming the science into an engineering discipline in the domain of sensor/actuator network applications, observing that in many applications the deployed network approximates a physical space and that the space, rather than the network, is being programmed.
Flocking for multi-agent dynamic systems: algorithms and theory
In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in free-space and presence of multiple obstacles are considered. We
Self-adapting modular robotics: A generalized distributed consensus framework
  • Chih-Han Yu, R. Nagpal
  • Computer Science
    2009 IEEE International Conference on Robotics and Automation
  • 2009
TLDR
A generalized distributed consensus framework for self-adaptation tasks in modular robotics is presented and it is demonstrated that a variety of modular robotic systems and tasks can be formulated within such a framework, including an adaptive column that can adapt to external force.
...
...