Multiagent Consensus With Noisy Communication: Stopping Rules Based on Network Graphs

DOI10.1109/TCNS.2015.2481119zbMath1370.90060OpenAlexW2524517308MaRDI QIDQ5358511

Takayuki Wada, Ryosuke Morita, Yasumasa Fujisaki, Izumi Masubuchi, Toru Asai

Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcns.2015.2481119

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Stochastic approximation (62L20) Stochastic processes (60G99) Communication theory (94A05)

Related Items (2)

A Consensus Protocol over Noisy Two‐Layered Networks with Cooperative and Antagonistic Interactions ⋮ Output Consensus of Networked Hammerstein and Wiener Systems

This page was built for publication: Multiagent Consensus With Noisy Communication: Stopping Rules Based on Network Graphs