Gossip algorithm for multi-agent systems via random walk
From MaRDI portal
Publication:2327381
DOI10.1016/j.sysconle.2019.04.009zbMath1425.93253OpenAlexW2944888261WikidataQ127830960 ScholiaQ127830960MaRDI QIDQ2327381
Stefano Panzieri, Andrea Gasparri, Gabriele Oliva, Roberto Setola
Publication date: 14 October 2019
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2019.04.009
Sums of independent random variables; random walks (60G50) Decentralized systems (93A14) Stability of control systems (93D99) Agent technology and artificial intelligence (68T42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic and deterministic fault detection for randomized gossip algorithms
- Clock synchronization protocol for wireless sensor networks with bounded communication delays
- Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
- Convergence of infinite products of matrices and inner-outer iteration schemes
- Optimal role and position assignment in multi-robot freely reachable formations
- Consensus and Cooperation in Networked Multi-Agent Systems
- Finite-Time Distributed Averaging Over Gossip-Constrained Ring Networks
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Cooperative Control of Mobile Sensor Networks: Adaptive Gradient Climbing in a Distributed Environment
This page was built for publication: Gossip algorithm for multi-agent systems via random walk