Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions. (English) Zbl 1185.93006

Summary: An average-consensus control is considered for networks of continuous-time integrator agents under fixed and directed topologies. The control input of each agent can only use its local state and the states of its neighbors corrupted by white noises. To attenuate the measurement noises, time-varying consensus gains are introduced in the consensus protocol. By combining the tools of algebraic graph theory and stochastic analysis, the convergence of these kinds of protocols is analyzed. Firstly, for noise-free cases, necessary and sufficient conditions are given on the network topology and consensus gains to achieve average-consensus. Secondly, for the cases with measurement noises, necessary and sufficient conditions are given on the consensus gains to achieve asymptotic unbiased mean square average-consensus. It is shown that under the protocol designed, all agents’ states converge to a common Gaussian random variable, whose mathematical expectation is just the average of the initial states.


93A14 Decentralized systems
93B50 Synthesis problems
93E03 Stochastic systems in control theory (general)
93E10 Estimation and detection in stochastic control theory
Full Text: DOI


[1] Ballal, P., & Lewis, F. (2008). Trust-based collaborative control for teams in communication networks. In Proc. of the 2008 army science conference
[2] Boyd, S.; Diaconis, P.; Xiao, L., Fastest mixing Markov chain on a graph, SIAM review, 46, 4, 667-689, (2004) · Zbl 1063.60102
[3] Carli, R.; Fagnani, F.; Speranzon, A.; Zampieri, S., Communication constraints in the average consensus problem, Automatica, 44, 3, 671-684, (2008) · Zbl 1283.93014
[4] Chow, Y.S.; Teicher, H., Probability theory: independence, interchangeability, martingales, (1997), Springer New York · Zbl 0891.60002
[5] Friedman, A., Stochastic differential equations and applications, Vol. 1, (1975), Academic Press New York
[6] Gazi, V.; Passino, K.M., Stability analysis of swarms, IEEE transactions on automatic control, 48, 4, 692-696, (2003) · Zbl 1365.92143
[7] Godsil, C.; Royle, G., Algebraic graph theory, (2001), Springer New York · Zbl 0968.05002
[8] Gronwall, T.H., Note on the derivatives with respect to a parameter of the solutions of a system of differential equations, Annual of mathematics, 2, 20, 292-296, (1919) · JFM 47.0399.02
[9] Hatano, Y.; Mesbahi, M., Agreement over random network, IEEE transactions on automatic control, 50, 11, 1867-1872, (2005) · Zbl 1365.94482
[10] Huang, M.; Manton, J.H., Coordination and consensus of networked agents with noisy measurement: stochastic algorithms and asymptotic behavior, SIAM journal on control and optimization, 48, 1, 134-161, (2009) · Zbl 1182.93108
[11] Jadbabaie, A.; Lin, J.; Morse, S.M., Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE transactions on automatic control, 48, 6, 988-1001, (2003) · Zbl 1364.93514
[12] Kingston, D. B., & Beard, R. W. (2006). Discrete-time average-consensus under switching network topologies. In Proc. of the 2006 American control conference
[13] Li, T.; Zhang, J.F., Decentralized tracking-type games for multi-agent systems with coupled ARX models: asymptotic Nash equilibria, Automatica, 44, 3, 713-725, (2008) · Zbl 1283.93022
[14] Lynch, N., Distributed algorithms, (1996), Morgan Kaufmann San Matero, CA · Zbl 0877.68061
[15] Merris, R., Laplacian matrices of graphs: A survey, Linear algebra and its application, 197, 198, 143-176, (1994) · Zbl 0802.05053
[16] Michel, A.N.; Miller, R.K., Qualitative analysis of large scale dynamical systems, (1977), Academic Press New York · Zbl 0358.93028
[17] Moreau, L., Stability of multi-agent systems with time-dependent communication links, IEEE transactions on automatic control, 50, 2, 169-182, (2005) · Zbl 1365.93268
[18] Moreau, L., & Belgium, S. G. (2004). Stability of continuous-time distributed consensus algorithms. In Proc. of the 43rd IEEE conference on decision and control (pp. 3998-4003)
[19] Olfati-Saber, R., Flocking for multi-agent dynamic systems: algorithms and theory, IEEE transactions on automatic control, 51, 3, 401-420, (2006) · Zbl 1366.93391
[20] Olfati-Saber, R.; Fax, J.A.; Murray, R.M., Consensus and cooperation in networked multi-agent systems, Proceedings of the IEEE, 95, 1, 215-233, (2007) · Zbl 1376.68138
[21] Olfati-Saber, R.; Murray, R.M., Consensus problem in networks of agents with switching topology and time-delays, IEEE transactions on automatic control, 49, 9, 1520-1533, (2004) · Zbl 1365.93301
[22] Olfati-Saber, R., & Shamma, J. S. (2005). Consensus filters for sensor networks and distributed sensor fusion. In Proc. of the 44th IEEE conference on decision and control and the European control conference 2005 (pp. 3551-3556)
[23] Preciado, V. M., & Verghese, G. C. (2005). Synchronization in generalized Erös-Rényi networks of nonlinear oscillators. In Proceedings of the 44th IEEE conference on decision and control and the European control conference 2005 (pp. 4628-4633)
[24] Ren, W.; Beard, R.W., Consensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE transactions on automatic control, 50, 5, 655-661, (2005) · Zbl 1365.93302
[25] Ren, W., Beard, R. W., & Kingston, D. B. (2005). Multi-agent Kalman consensus with relative uncertainty. In Proc. of the 2005 American control conferences (pp. 1865-1870)
[26] Sinha, A.; Ghose, D., Generalization of linear cyclic pursuit with application to rendezvous of multiple autonomous agents, IEEE transactions on automatic control, 51, 11, 1819-1824, (2006) · Zbl 1366.93063
[27] Tsitsiklis, J.N.; Bertsekas, D.P.; Athans, M., Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE transactions on automatic control, 31, 9, 803-812, (1986) · Zbl 0602.90120
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.