Convergence of max-min consensus algorithms
From MaRDI portal
Publication:901088
DOI10.1016/j.automatica.2015.09.012zbMath1329.93014OpenAlexW2204179031MaRDI QIDQ901088
Weiguo Xia, Karl Henrik Johansson, Guo-Dong Shi
Publication date: 23 December 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.09.012
Applications of graph theory (05C90) Discrete-time control/observation systems (93C55) Decentralized systems (93A14)
Related Items (4)
Second-order min-consensus on switching topology ⋮ Asymptotic Consensus of Dynamical Points in a Strict Max-Convex Space and Its Applications ⋮ Necessary and sufficient conditions for consensus in nonlinear monotone networks with unilateral interactions ⋮ Constrained consensus of discrete-time multi-agent systems with time delay
Cites Work
- Unnamed Item
- On backward product of stochastic matrices
- Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Reaching a Consensus
- On Distributed Averaging Algorithms and Quantization Effects
- Biased assimilation, homophily, and the dynamics of polarization
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- On Ergodicity, Infinite Flow, and Consensus in Random Models
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
- Efficient schemes for nearest neighbor load balancing
This page was built for publication: Convergence of max-min consensus algorithms
