Linear Stochastic Approximation Algorithms and Group Consensus Over Random Signed Networks

DOI10.1109/TAC.2018.2867257MaRDI QIDQ5223693zbMATH OpenOpenAlexFDO

Authors Ge Chen, Xiaoming Duan, Wenjun Mei, Francesco Bullo

Publication date 18 July 2019

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2018.2867257

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic approximation (62L20) Social networks; opinion dynamics (91D30) Stochastic stability in control theory (93E15)

Cited in

(4)

• Reach almost sure consensus via \(L_p\)-norm group information
• Stochastic bipartite consensus with measurement noises and antagonistic information
• Time-varying formation control for heterogeneous multi-agent systems with random network and measurement noise
• Stochastic scaled consensus for high-order multi-agent systems in a noisy environment

This page was built for publication: Linear Stochastic Approximation Algorithms and Group Consensus Over Random Signed Networks

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