Browsing by Subject "Strongly connected"
Now showing items 110 of 10

Conference Object
Decentralised minimumtime 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 ...

Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weightbalancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...

Conference Object
Distributed balancing under interval flow constraints in directed communication topologies
(Institute of Electrical and Electronics Engineers Inc., 2018)In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider ...

Conference Object
Distributed formation of balanced and bistochastic weighted digraphs in multiagent systems
(2013)We propose two distributed algorithms, one for solving the weightbalance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...

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 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
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weightbalanced digraphs play a key role ...

Conference Object
Integer weight balancing in directed graphs in the presence of communication delays
(Institute of Electrical and Electronics Engineers Inc., 2015)A digraph with positive weights on its edges is weightbalanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weightbalanced digraphs play an important ...

Conference Object
Resilient average consensus in the presence of heterogeneous packet dropping links
(2012)We address the averageconsensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We ...

Article
Resilient networked control of distributed energy resources
(2012)This paper considers networked systems and develops distributed algorithm that is resilient against potential packet drops in the communication links between system components. We apply this algorithm to the problem of ...