Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Filters

2013 - 20143

Settings

Subject: search.filters.subject.Consensus Dynamics

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Towards a unified theory of consensus
    (2014-10-12) Somarakis, Christoforos; Baras, John
    We revisit the classic multi-agent distributed consensus problem under mild connectivity assumptions and non-uniformly bounded weights. The analysis is based on a novel application of the standard results from the non-negative matrix theory. It is a simple, yet unifying, approach that yields generalized results. We apply these results to a wide variety of linear, non-linear consensus and flocking algorithms proposed in the literature and we obtain new conditions for asymptotic consensus. Our framework is developed in both discrete and continuous time. Furthermore we extend the discussion to stochastic settings.
  • Thumbnail Image
    Item
    Stability by Fixed Point Theory in Consensus Dynamics
    (2014-08-22) Somarakis, Christoforos; Baras, John; Paraskevas, Evripidis; Baras, John
    We study the stability of linear time invariant distributed consensus dynamics in the presence of multiple propagation and processing delays. We employ fixed point theory (FPT) methods and derive sufficient conditions for asymptotic convergence to a common value while the emphasis is given in estimating the rate of convergence. We argue that this approach is novel in the field of networked dynamics as it is also flexible and thus capable of analyzing a wide variety of consensus based algorithms for which conventional Lyapunov methods are either too restrictive or unsuccessful.
  • Thumbnail Image
    Item
    A Fixed Point Theory Approach to Multi-Agent Consensus Dynamics With Delays
    (2013-01-01) Somarakis, Christoforos; Baras, John
    The classic linear time-invariant multi-agent consensus scheme is revisited in the presence of constant and distributed bounded delays. We create a fixed point argument and prove exponential convergence with specific rate that depends both on the topology of the communication graph and the upper bound of the allowed delay.