Coordination and Consensus of Networked Agents with Noisy Measurements: Stochastic Algorithms and Asymptotic Behavior

By Minyi Huang, Jonathan H. Manton. SIAM Journal of Control and Optimization, 2009

397 citations recorded by the source corpus.

Subfields: Cognitive Neuroscience, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/3533a122e4db6b9c8f97dfe6516c7ccc9661e164

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Cognitive Neuroscience

In Computer Networks and Communications

Citations in the corpus

Distributed tracking control of leader-follower multi-agent systems under noisy measurement (2011, background): “More recently consensus control problems with measurement noises have been studied in Li , &Zhang (2009) and Huang , &Manton (2009) with the ﬁxed and undirected network topology.”
Stochastic consensus over noisy networks with Markovian and arbitrary switches (2010, background): “In Huang and Manton (2008, 2009, 2010), consensus problems were considered when agents obtain noisy measurements of the states of neighbors, and a stochastic approximation approach was applied to obtain mean square and almost sure convergence in models with fixed network topologies or with…”
Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies (2011, background): “…& Murray, 2004), flocking behavior and swarms (Liu, Passino, & Polycarpou, 2003; Toner & Tu, 1998; Viseck, Czirook, Ben-Jacob, Cohen, & Shochet, 1995), etc. Related algorithms and theoretical developments were reported in Cortes and Bullo (2005), Huang and Manton (2009) and Ren and Beard (2005).”
Differentially private iterative synchronous consensus (2012, methodology): “We use the mean square notion of convergence which has been used in the context of consensus protocols [15].”
Distributed consensus of discrete‐time multi‐agent systems with multiplicative noises (2015, background): “Therefore, the following two definitions [13] are introduced to characterize the asymptotical behavior of a stochastic multi-agent system.”
Distributed Consensus With Limited Communication Data Rate (2011, methodology): “By a distributed stochastic approximation method ([19]–[23]) and pathwise analysis, it was proved that, for an infinite-level quantizer, consensus can be achieved with”
Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies (2010, methodology): “Inspired by past advances in stochastic adaptive algorithms, in [16]–[18], a stochastic approximation type algorithm with a decreasing step size was proposed for consensus seeking where the data transmitted from other agents are corrupted by white noise (see Fig.”
Leader-following consensus of multi-agent systems under fixed and switching topologies (2010, background): “Some other relevant research topics have also been addressed, such as agreement over random networks [14], coordination and consensus of networked agents with noisy measurements [15], networks with timedelays [16,17], consensus filters [5].”
Distributed averaging on digital erasure networks (2011, background): “Depending on the application, one might prefer to avoid such increase, and to compensate the accumulation of errors by applying a decreasing gain strategy, as proposed in [11, 17] for networks whose links support the transmission of a real number affected by additive noise.”
Mean square average-consensus under measurement noises and fixed topologies: Necessary and sufficient conditions (2009, background): “Huang and Manton (2009) introduced decreasing consensus gains a(k) (where k is the discrete-time instant) to attenuate the measurement noises.”