Distributed Weight Balancing in Directed Topologies

12/06/2018
by   Apostolos I. Rikos, et al.
0

This doctoral thesis concerns novel distributed algorithms for weight balancing over directed (communication) topologies. A directed topology (digraph) with nonnegative (or positive) weights assigned on each edge is weight-balanced if, for each node, the sum of the weights of in-coming edges equals the sum of the weights of out-going edges. The novel algorithms introduced in this thesis can facilitate the development of strategies for generating weight balanced digraphs, in a distributed manner, and find numerous applications in coordination and control of multi-component systems. In the first part of this thesis, we introduce a novel distributed algorithm that operates over a static topology and solves the weight balancing problem when the weights are restricted to be nonnegative integers. In the second part of the thesis, we present a novel distributed algorithm which solves the integer weight balancing problem in the presence of arbitrary (time-varying and inhomogeneous) delays that might affect the transmission at a particular link at a particular time. In the third part of this thesis, we present a novel distributed algorithm for obtaining admissible and balanced integer weights for the case when there are lower and upper weight constraints on the communication links. In the fourth part of this thesis we present a novel distributed algorithm which solves the integer weight balancing problem under lower and upper weight constraints over the communication links for the case where arbitrary (time-varying and inhomogeneous) time delays and possible packet drops affect the transmission at a particular link at a particular time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2018

Limited Rate Distributed Weight-Balancing and Average Consensus Over Digraphs

Distributed quantized weight-balancing and average consensus over fixed ...
research
11/17/2020

On Integer Balancing of Digraphs

A weighted digraph is balanced if the sums of the weights of the incomin...
research
05/09/2019

Input-Feedforward-Passivity-Based Distributed Optimization Over Jointly Connected Balanced Digraphs

In this paper, a distributed optimization problem is investigated via in...
research
01/03/2019

Finite rate distributed weight-balancing and average consensus over digraphs

This paper proposes and analyzes the first distributed algorithm that so...
research
07/30/2019

Distributed Resource Allocation over Time-varying Balanced Digraphs with Discrete-time Communication

Consider a group of nodes aiming to solve a resource allocation problem ...
research
07/21/2016

Distributed Supervised Learning using Neural Networks

Distributed learning is the problem of inferring a function in the case ...
research
11/14/2022

Generalized Stable Weights via Neural Gibbs Density

We present a generalized balancing weight method fully available for est...

Please sign up or login with your details

Forgot password? Click here to reset