Browsing by Subject "Average consensus"
Now showing items 1-15 of 15
-
Conference Object
Asynchronous coordination of distributed energy resources for the provisioning of ancillary services
(2011)This paper analyzes the stability of asynchronous coordination protocols and studies their application to energy resource provisioning of ancillary services in power grids. First, we consider and analyze a protocol that ...
-
Article
Average consensus in the presence of delays in directed graph topologies
(2014)Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not ...
-
Conference Object
Decentralised minimum-time average consensus in digraphs
(Institute of Electrical and Electronics Engineers Inc., 2013)Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on ...
-
Article
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
(2015)Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
-
Article
Distributed finite-time average-consensus with limited computational and storage capability
(2017)Consensus is a fundamental feature of distributed systems, and it is the prerequisite for several complex tasks, such as flocking of mobile robots, localization in wireless-sensor networks, or decentralized control of smart ...
-
Article
Distributed matrix scaling and application to average consensus in directed graphs
(2013)We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic form. We also demonstrate the ...
-
Conference Object
Distributed stopping for average consensus in directed graphs via a randomized event-triggered strategy
(IEEE Computer Society, 2014)We consider how an iterative strategy for asymptotic average consensus in a directed graph (digraph) can be adapted so that the nodes can determine, in a distributed manner, a stopping criterion that allows them to terminate ...
-
Article
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
(2016)We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed stopping for average consensus using double linear iterative strategies
(Institute of Electrical and Electronics Engineers Inc., 2014)We consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite ...
-
Conference Object
Distributed stopping in average consensus via event-triggered strategies
(IEEE Computer Society, 2013)We develop and analyze a distributed event-triggered linear iterative algorithm that enables the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...
-
Conference Object
Distributed strategies for average consensus in directed graphs
(2011)We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...
-
Conference Object
Privacy-preserving asymptotic average consensus
(2013)In this paper, we develop and analyze a distributed privacy-preserving average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to asymptotically reach average ...
-
Conference Object
Resilient average consensus in the presence of heterogeneous packet dropping links
(2012)We address the average-consensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We ...
-
Conference Object
Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity
(2012)We consider a networked system in which each component (node) iteratively exchanges information with its neighbors according to an arbitrary, possibly directed topology. Based on an iterative exchange of (local and possibly ...
-
Article
Robust Distributed Average Consensus via Exchange of Running Sums
(2016)We consider a multi-component system in which each component (node) can send/receive information to/from sets of neighboring nodes via communication links (edges) that form a fixed strongly connected, possibly directed, ...