Distributed winner-take-all in dynamic networks
This paper is concerned with the winner-take-all (WTA) problem on networks. We propose
the first distributed protocol to address this problem dynamically. This protocol features …
the first distributed protocol to address this problem dynamically. This protocol features …
Robust dynamic average consensus algorithms
This technical note considers the dynamic average consensus problem, where a group of
networked agents are required to estimate the average of their time-varying reference …
networked agents are required to estimate the average of their time-varying reference …
Asynchronous consensus of multiple double-integrator agents with arbitrary sampling intervals and communication delays
J Zhan, X Li - IEEE Transactions on Circuits and Systems I …, 2015 - ieeexplore.ieee.org
This paper addresses asynchronous consensus problems of multiple double-integrator
agents with discontinuous information transmission, where each agent receives its …
agents with discontinuous information transmission, where each agent receives its …
Optimal CPU scheduling in data centers via a finite-time distributed quantized coordination mechanism
In this paper we analyze the problem of optimal task scheduling for data centers. Given the
available resources and tasks, we propose a fast distributed iterative algorithm, which …
available resources and tasks, we propose a fast distributed iterative algorithm, which …
[HTML][HTML] Resilient consensus in continuous-time networks with ℓ-hop communication and time delay
Y Shang - Systems & Control Letters, 2023 - Elsevier
This paper studies the problem of resilient consensus in continuous-time multiagent systems
against potential malicious agents. Network topology conditions have been developed to …
against potential malicious agents. Network topology conditions have been developed to …
CPU scheduling in data centers using asynchronous finite-time distributed coordination mechanisms
We propose an asynchronous iterative scheme that allows a set of interconnected nodes to
distributively reach an agreement within a pre-specified bound in a finite number of steps …
distributively reach an agreement within a pre-specified bound in a finite number of steps …
Distributed monitoring of voltage collapse sensitivity indices
The assessment of voltage stability margins is a promising direction for wide-area
monitoring systems. Accurate monitoring architectures for long-term voltage instability are …
monitoring systems. Accurate monitoring architectures for long-term voltage instability are …
Asynchronous max-consensus protocol with time delays: Convergence results and applications
This paper deals with the analysis of the convergence properties of the max-consensus
protocol in presence of asynchronous updates and bounded time delays on directed static …
protocol in presence of asynchronous updates and bounded time delays on directed static …
Distributed resource allocation via ADMM over digraphs
In this paper, we solve the resource allocation problem over a network of agents, with edges
as communication links that can be unidirectional. The goal is to minimize the sum of …
as communication links that can be unidirectional. The goal is to minimize the sum of …
Max consensus in sensor networks: Non-linear bounded transmission and additive noise
A distributed consensus algorithm for estimating the maximum value of the initial
measurements in a sensor network with communication noise is proposed. In the absence of …
measurements in a sensor network with communication noise is proposed. In the absence of …