access icon free Distributed average consensus based on structural weight-balanceability

This study presents the concept of structural weight-balanceability of network systems as a useful method to examine the average consensus of the systems. The authors introduce the notion of structurally unobservable node based on structural observability concept to determine the structural weight-balanceability of a network. They propose a simple technique to identify structurally unobservable nodes, and consequently infer on structural weight-balanceability of the network. A mathematical method based on principal minors of the associated Laplacian matrix of the network is developed to modify a structurally weight-balanceable network into a weight-balanced one. A distributed method is presented to compute normalised principal minors in a large-scale network system with directed communication topology. This is the first work that provides a rigorous mathematical formulation to check the structural weight-balanceability of network systems and make a structurally weight-balanceable network, weight-balanced. Finally, simulation results are presented to illustrate the performance of the proposed method in dealing with networks with a large number of nodes.

Inspec keywords: matrix algebra; observability; networked control systems; directed graphs; distributed decision making; network theory (graphs)

Other keywords: network control systems; mathematical method; directed communication topology; distributed method; structural observability; distributed average consensus; structurally weight balanceable network; structurally unobservable node identification; structural weight balanceability; Laplacian matrix

Subjects: Linear algebra (numerical analysis); Control system analysis and synthesis methods; Combinatorial mathematics

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • 30. Parlangeli, G., Notarstefano, G.: ‘On the observability of path and cycle graphs’. IEEE Conf. Decision and Control, 2010, pp. 14921497.
    7. 7)
      • 35. Reinschke, K.J.: ‘Multivariable control: a graph-theoretic approach’ (Springer, 1988).
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 8. Lynch, N.A.: ‘Distributed algorithms’ (Morgan Kaufmann, San Francisco, CA, 1996).
    13. 13)
    14. 14)
      • 39. Olfati-Saber, R.: ‘Distributed Kalman filtering for sensor networks’. Proc. IEEE Conf. Decision and Control, 2007, pp. 54925498.
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
      • 37. Hespanha, J.P.: ‘Linear systems theory’ (Princeton University Press, 2009).
    24. 24)
    25. 25)
      • 41. Xiao, L., Boyd, S., Lall, S.: ‘A scheme for robust distributed sensor fusion based on average consensus’. Proc. Int. Symp. Information Processing in Sensor Networks, 2005, pp. 6370.
    26. 26)
    27. 27)
      • 9. Ren, W., Beard, R.W.: ‘Distributed consensus in multi-vehicle cooperative control: theory and applications’ (Springer, 2008).
    28. 28)
    29. 29)
    30. 30)
      • 42. Mesbahi, M., Egerstedt, M.: ‘Graph theoretic methods in multiagent networks’ (Princeton University Press, 2010).
    31. 31)
      • 28. Ji, M., Egerstedt, M.: ‘Observability and estimation in distributed sensor networks’. IEEE Conf. Decision and Control, 2007, pp. 42214226.
    32. 32)
    33. 33)
    34. 34)
      • 43. Hu, J., Zheng, W.X.: ‘Bipartite consensus for multi-agent systems on directed signed networks’. The 52nd IEEE Conf. Decision and Control, 2013, pp. 34513456.
    35. 35)
    36. 36)
    37. 37)
    38. 38)
      • 45. Williams, G.: ‘Linear algebra with applications’ (Jones and Bartlett Publishers, 2012).
    39. 39)
    40. 40)
    41. 41)
      • 27. Tanner, H.G.: ‘On the controllability of nearest neighbor interconnections’. IEEE Conf. Decision and Control, 2004, pp. 24672472.
    42. 42)
    43. 43)
    44. 44)
    45. 45)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2014.0251
Loading

Related content

content/journals/10.1049/iet-cta.2014.0251
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading