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

DOI10.1109/TCNS.2015.2481119MaRDI QIDQ5358511zbMATH OpenOpenAlexFDO

Authors Ryosuke Morita, Takayuki Wada, Izumi Masubuchi, Yasumasa Fujisaki, T. 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

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

Cited in

(4)

• A consensus protocol over noisy two-layered networks with cooperative and antagonistic interactions
• Output Consensus of Networked Hammerstein and Wiener Systems
• Multi-agent consensus for distributed power dispatch with load balancing
• Multi-agent consensus with stopping rules under bounded measurement noise

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358511)