LiFE-CD computes the full probability distribution of convergence time for max-consensus over networks with Bernoulli link failures, exactly for acyclic graphs and with tight bounds for cyclic ones via spanning tree reduction.
Consensus problems in networks of agents with switching topology and time-delays,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Leader-following consensus under disturbances is solved by modeling it as a coalitional zero-sum game that yields an H∞ law implementable distributively through GARE decomposition and dynamic average consensus.
citing papers explorer
-
Convergence Time Distributions for Max-Consensus over Unreliable Networks
LiFE-CD computes the full probability distribution of convergence time for max-consensus over networks with Bernoulli link failures, exactly for acyclic graphs and with tight bounds for cyclic ones via spanning tree reduction.
-
Coalitional Zero-Sum Games for ${H_{\infty}}$ Leader-Following Consensus Control
Leader-following consensus under disturbances is solved by modeling it as a coalitional zero-sum game that yields an H∞ law implementable distributively through GARE decomposition and dynamic average consensus.