Skip to main content
Log in

Robust consensus for multi-agent systems over unbalanced directed networks

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In this paper, a distributed consensus protocol is proposed for discrete-time single-integer multi-agent systems with measurement noises under general fixed directed topologies. The time-varying control gains satisfying the stochastic approximation conditions are introduced to attenuate noises, thus the closed-loop multi-agent system is intrinsically a linear time-varying stochastic difference system. Then the mean square consensus convergence analysis is developed based on the Lyapunov technique, and the construction of the Lyapunov function especially does not require the typical balanced network topology condition assumed for the existence of quadratic Lyapunov function. Thus, the proposed consensus protocol can be applicable to more general networked multi-agent systems, particularly when the bidirectional and/or balanced information exchanges between agents are not required. Under the proposed protocol, it is proved that the state of each agent converges in mean square to a common random variable whose mathematical expectation is the weighted average of agents’ initial state values; meanwhile, the random variable’s variance is bounded.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tsitsiklis J N, Problems in decentralized decision making and computation, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1984.

    Google Scholar 

  2. Nedic A, Olshevsky A, and Parrilo A P, Constrained consensus and optimization in multi-agent networks, IEEE Trans. Automatic Control, 2010, 55(4): 922–938.

    Article  Google Scholar 

  3. Jadbabaie A, Lin J, and Morse A, Coordination of groups of mobile autonomous nodes using nearest neighbor rules, IEEE Trans. Automatic Control, 2003, 48(6): 988–1001.

    Article  MathSciNet  Google Scholar 

  4. Ren W and Beard R W, Distributed Consensus in Multi-Vehicle Cooperative Control, Springer, London, 2008.

    Book  MATH  Google Scholar 

  5. Olfati-Saber R, Flocking for multi-agent dynamic systems: Algorithms and theory, IEEE Trans. Automatic Control, 2006, 51(3): 401–420.

    Article  MathSciNet  Google Scholar 

  6. Tanner H G, Jadbabaie A, and Pappas G J, Flocking in fixed and switching networks, IEEE Trans. Automatic Control, 2007, 52(5): 863–868.

    Article  MathSciNet  Google Scholar 

  7. Lin Z, Broucke M, and Francis B, Local control strategies for groups of mobile autonomous agents, IEEE Trans. Automatic Control, 2004, 49(4): 622–629.

    Article  MathSciNet  Google Scholar 

  8. Olfati-Saber R, Fax J A, and Murray R M, Consensus and cooperation in networked multi-agent systems, Proceedings of the IEEE, 2007, 95(1): 215–233.

    Article  Google Scholar 

  9. Vicsek T, Czirok A, Ben-Jacob E, Cohen I, and Shochet O, Novel type of phase transition in a system of self-driven particles, Physical Review Letters, 1995, 75(6): 1226–1229.

    Article  Google Scholar 

  10. DeMarzo P M, Vayanos D, and Zwiebel J, Persuasion bias, social influence, and unidimensional opinions, Quarterly Journal of Economics, 2003, 118(3): 909–968.

    Article  MATH  Google Scholar 

  11. Huang M and Manton J H, Coordination and consensus of networked agents with noisy measurement: Stochastic algorithms and asymptotic behavior, SIAM Journal on Control and Optimization, 2009, 48(1): 134–161.

    Article  MATH  MathSciNet  Google Scholar 

  12. Li T and Zhang J F, Consensus conditions of multi-agent systems with time-varying topologies and stochastic communication noises, IEEE Trans. Automatic Control, 2010, 55(9): 2043–2057.

    Article  Google Scholar 

  13. Rajagopal R and Wainwright M J, Network-based consensus averaging with general noisy communications, IEEE Trans. Signal Processing, 2011, 59(1): 373–385.

    Article  MathSciNet  Google Scholar 

  14. Kar S and Moura J M F, Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and communication noises, IEEE Trans. Signal Processing, 2009, 57(1): 353–369.

    Article  MathSciNet  Google Scholar 

  15. Li T and Zhang J F, Mean square average consensus under measurement noises and fixed topologies: Necessary and sufficient conditions, Automatica, 2009, 45(8): 1929–1936.

    Article  MATH  MathSciNet  Google Scholar 

  16. Li D Q, Liu Q P, Wang X F, and Lin Z L, Consensus seeking over directed networks with limited information communication, Automatica, 2013, 49(2): 610–618

    Article  MATH  MathSciNet  Google Scholar 

  17. Huang M, Dey S, Nair G N, and Manton J H, Stochastic consensus over noisy networks with markovian and arbitrary switches, Automatica, 2010, 46(10): 1571–1583.

    Article  MATH  MathSciNet  Google Scholar 

  18. Huang M and Manton J H, Stochastic consensus seeking with noisy and directed interagent communication: Fixed and randomly varying topologies, IEEE Trans. Automatic Control, 2010, 55(1): 235–241.

    Article  MathSciNet  Google Scholar 

  19. Xiao L, Boyd S, and Kim S J, Distributed average consensus with least-mean square deviation, Journal of Parallel and Distributed Computing, 2007, 67(1): 33–46.

    Article  MATH  Google Scholar 

  20. Ren W, Beard R W, and Kingston D B, Multi-agent Kalman consensus with relative uncertainty, Proceedings of the American Control Conference, 2005, 1865–1870.

    Google Scholar 

  21. Touri B and Nedic A, Distributed consensus over network with noisy links, 12th International Conference on Information Fusion, 2009, 146–154.

    Google Scholar 

  22. Ma C Q, Li T, and Zhang J F, Consensus control for leader-following multi-agent systems with measurement noises, Journal of Systems Science & Complexity, 2010, 23(1): 35–49.

    Article  MATH  MathSciNet  Google Scholar 

  23. Hu J and Feng G, Distributed tracking control of leader-follower multi-agent systems under noisy measurement, Automatica, 2010, 46(8): 1382–1387.

    Article  MATH  MathSciNet  Google Scholar 

  24. Gharesifard B and Cortes J, When does a digraph admit a doubly stochastic adjacency matrix? Proceedings of the American Control Conference, 2010, 2440–2445.

    Google Scholar 

  25. Olfati-Saber R and Murray R M, Consensus problem in networks of agents with switching topology and time-delays, IEEE Trans. Automatic Control, 2004, 49(9): 1520–1533.

    Article  MathSciNet  Google Scholar 

  26. Benezit F, Blondel V, Thiran P, Tsitsiklis J N, and Vetterli M, Weighted gossip: Distributed averaging using non-doubly stochastic matrices, IEEE International Symposium on Information Theory, Austin, Texas, 2010, 1753–1757.

    Google Scholar 

  27. Ren W and Beard R W, Consensus seeking in multi-agent systems under dynamically changing interaction topologies, IEEE Trans. Automatic Control, 2005, 50(5): 655–661.

    Article  MathSciNet  Google Scholar 

  28. Touri B and Nedic A, On ergodicity, infinite flow, and consensus in random models, IEEE Trans. Automatic Control, 2011, 56(7): 1593–1605.

    Article  MathSciNet  Google Scholar 

  29. Huang M, Stochastic approximation for consensus: A new approach via ergodic backward products, IEEE Trans. Automatic Control, 2012, 57(12): 2994–3008.

    Article  Google Scholar 

  30. Horn R A and Johnson C R, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.

    Book  MATH  Google Scholar 

  31. Rudin W, Real and Complex Analysis, McGraw-Hill, New York, 1987.

    MATH  Google Scholar 

  32. Olshevsky A and Tsitsiklis J N, On the nonexistence of quadratic Lyapunov functions for consensus algorithms, IEEE Trans. Automatic Control, 2008, 53(11): 2642–2645.

    Article  MathSciNet  Google Scholar 

  33. Touri B, Nedic A, and Ram S S, Asynchronous stochastic convex optimization over random networks: Error bounds, Information Theory and Applications Workshop, 2010, 671–684.

    Google Scholar 

  34. Polyak B T, Introduction to Optimization, Optimization Software, Inc., New York, 1987.

    Google Scholar 

  35. Chow Y S and Teicher H, Probability Theory: Independence, Interchangeability, Martingales, Springer, New York, 1997.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dequan Li.

Additional information

This research was supported by the Natural Science Foundation of China under Grant Nos. 61073101, 61073102, 61170172, 61272153, and 61374176, the Science Fund for Creative Research Groups of the National Natural Science Foundation of China under Grant No. 61221003, and Anhui Provincial Natural Science Foundation under Grant No. 090412251.

This paper was recommended for publication by Editor HONG Yiguang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, D., Wang, X. & Yin, Z. Robust consensus for multi-agent systems over unbalanced directed networks. J Syst Sci Complex 27, 1121–1137 (2014). https://doi.org/10.1007/s11424-014-1191-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-1191-4

Keywords

Navigation