Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Distributed Averaging"”.
-
Distributed averaging in dynamic networks
… of numbers present at nodes in a network in a distributed manner using gossip or message-passing algorithms has been of great recent interest across disciplines -- algorithms, control and robotics, estimation, social networks, etc. It has served as a non-trivial, representative model for an …
-
Product of random stochastic matrices and distributed averaging
… random stochastic matrices and random weighted averaging dynamics. It will be shown that a generalization of a fundamental result in the theory of ergodic Markov chains not only holds for inhomogeneous chains of stochastic matrices, but also remains true for random stochastic matrices. To do …
-
Sensing With Communication Constraints
For distributed averaging, we design distributed algorithms that allow each node to compute the average of all numeric values (which could, for example, be measurements) initially recorded in the network when both communication and storage at sensors are constrained. These algorithms also have …
-
Convergence speed in distributed consensus and averaging
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology …
-
Information spread in networks: games, optimal control, and stabilization
… spread. The first one is the well-known distributed averaging dynamics. The second model is a nonlinear one that describes virus spread in computer and biological networks. We seek to design optimal, robust, and stabilizing controllers under practical constraints. For distributed …
-
Probabilistic techniques for large-scale coordination and clustering
This is a study of probabilistic methods used in coordination and clustering problems that arise in operations research. Specifically, we focus on infinite graph and infinite point process methods to analyze the dynamics of blockchains, the Hegselmann--Krause model, and a stochastic dynamic …
-
Quantized Consensus by the Alternating Direction Method of Multipliers: Algorithms and Applications
… compute the global average of agents' data in a distributed manner. Much recent attention has been devoted to quantized consensus, where, due to practical constraints, only quantized communications are allowed between neighboring nodes in order to achieve the average consensus. This dissertation …
-
Consensus Algorithms for Estimation and Discrete Averaging in Networked Control Systems
… implementing consensus algorithms to solve the distributed averaging problem.
-
Potential-based analysis of social, communication, and distributed networks
… wide range of studies on the role of social and distributed networks in various disciplinary areas. In particular, availability of large amounts of data from online social networks and advances in control of distributed systems have drawn the attention of many researchers to exploit the …
-
Market Analysis and Control Design for the Grid Integration of Battery Storage and Heat Pumps
… network. Finally, we explore how two mainstream distributed secondary control frameworks, the distributed averaging-based proportional-integral and primal-dual approaches, can accommodate the two proposed heat pump participation schemes with guaranteed stability and optimal power sharing. These …