Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On Almost Controllability of Dynamical Complex Networks with Noises

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

Abstract

This paper discusses the controllability problem of complex networks. It is shown that almost any weighted complex network with noise on the strength of communication links is controllable in the sense of Kalman controllability. The concept of almost controllability is elaborated by both theoretical discussions and experimental verifications.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Tanner H G, On the controllability of nearest neighbor interconnections, Proc. 43rd IEEE Conf. Decision and Control, 2004, 3: 2467–2472.

    Google Scholar 

  2. Rahmani A, Ji M, Mesbahi M, et al., Controllability of multi-agent systems from a graph-theoretic perspective, SIAM J. Control Optim., 2009, 48(1): 162–186.

    Article  MathSciNet  MATH  Google Scholar 

  3. Cai N and Khan M J, On generalized controllability canonical form with multiple input variables, Int. J. Control Automat. Syst., 2017, 15: 169–177.

    Article  Google Scholar 

  4. Cai N, Zhou J, and Guo L, Almost exact controllability of dynamic complex networks, Proc. 35th Chin. Control Conf., Chengdu, 2016.

  5. Liu B, Chu T, Wang L, et al., Controllability of a leader-follower dynamic network with switching topology, IEEE Trans. Autom. Control, 2008, 53(4): 1009–1013.

    Article  MathSciNet  MATH  Google Scholar 

  6. Ji Z and Yu H, A new perspective to graphical characterization of multi-agent controllability, IEEE Trans. Cybernet., 2017, 47(6): 1471–1483.

    Article  Google Scholar 

  7. Ji Z, Lin H, and Yu H, Protocols design and uncontrollable topologies construction for multi-agent networks, IEEE Trans. Automat. Control, 2015, 60(3): 781–786.

    Article  MathSciNet  MATH  Google Scholar 

  8. Guan Y, Ji Z, Zhang L, et al., Controllability of multi-agent systems under directed topology, Int. J. Robust Nonlin. Control, 2017, 27(18): 4333–4347.

    Article  MathSciNet  MATH  Google Scholar 

  9. Liu Y, Slotine J J, and Barabasi A L, Controllability of complex networks, Nature, 2011, 473: 167–173.

    Article  Google Scholar 

  10. Yan G, Ren J, Lai Y, et al., Controlling complex networks: How much energy is needed?, Phys. Rev. Lett., 2012, 108: 218703.

    Article  Google Scholar 

  11. Yuan Z, Zhao C, Di Z, et al., Exact controllability of complex networks, Nat. Commn., 2013, 4: 2447.

    Article  Google Scholar 

  12. Sun J and Motter A E, Controllability transition and nonlocality in network control, Phys. Rev. Lett., 2013, 110: 208701.

    Article  Google Scholar 

  13. Pasqualetti F, Zampieri S, and Bullo F, Controllability metrics, limitations and algorithms for complex networks, IEEE Trans. Control Netw. Syst., 2014, 1: 40–52.

    Article  MathSciNet  MATH  Google Scholar 

  14. Jia T, Liu Y, Csoka E, et al., Emergence of bimodality in controlling complex networks, Nat. Commun., 2013, 4: 2002.

    Article  Google Scholar 

  15. Liu Y, Slotine J, and Barabasi A L, Control centrality and hierarchical structure in complex networks, PLoS ONE, 2012, 7(9): e44459.

    Article  Google Scholar 

  16. Ruths J and Ruths D, Control profiles of complex networks, Science, 2014, 21: 1373–1376.

    Article  MathSciNet  MATH  Google Scholar 

  17. Tan Z, Cai N, Zhou J, et al., On performance of peer review for academic journals: Analysis based on distributed parallel system, IEEE Access, 2019, 7: 19024–19032.

    Article  Google Scholar 

  18. Cai N, On quantitatively measuring controllability of complex networks, Physica A, 2017, 474: 282–292.

    Article  MathSciNet  MATH  Google Scholar 

  19. Kailath T, Linear Systems, Prentice-Hall, Englewood Cliffs, 1980.

    MATH  Google Scholar 

  20. Xi J, Fan Z, Liu H, et al., Completely distributed guaranteed-performance consensualization for high-order multiagent systems with switching topologies, IEEE Trans. Syst. Man Cybernet.: Syst., DOI: https://doi.org/10.1109/TSMC.2018.2852277 (available online).

  21. Qu J, Ji Z, Lin C, et al., Fast consensus seeking on networks with antagonistic interactions, Complexity, 2018, (8): 1–15.

  22. Cai N, Diao C, and Khan M J, A novel clustering method based on quasi-consensus motions of dynamical multiagent systems, Complexity, 2017, 4978613.

  23. Xi J, Wang C, Liu H, et al., Dynamic output feedback guaranteed-cost synchronization for multiagent networks with given cost budgets, IEEE Access, 2018, 6: 28923–28935.

    Article  Google Scholar 

  24. Cai N and Khan M J, Almost decouplability of any directed weighted network topology, Physica A, 2015, 436: 637–645.

    Article  MathSciNet  MATH  Google Scholar 

  25. Feng B, Polynomials and Irrational Numbers, Harbin Institute of Technology Press, Harbin, 2008 (in Chinese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Automation, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Ning Cai

  2. Beijing Engineering Research Center of Post Intelligent Equipment, Postal Scientific Research and Planning Academy, Beijing, 100096, China

    Ning Cai

  3. Key Laboratory of China’s Ethnic Languages and Information Technology for Ministry of Education, Northwest Minzu University, Lanzhou, 730030, China

    Ning Cai

  4. Rocket Force University of Engineering, Xi’an, 710025, China

    Ming He, Qiuxuan Wu & M. Junaid Khan

  5. School of Automation, Hangzhou Dianzi University, Hangzhou, 310018, China

    Ming He, Qiuxuan Wu & M. Junaid Khan

  6. PN Engineering College, National University of Sciences and Technology, Islamabad, Pakistan

    Ming He, Qiuxuan Wu & M. Junaid Khan

Authors
  1. Ning Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiuxuan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Junaid Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ning Cai.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant Nos. 61867005 and 61763040, the Fundamental Research Funds for the Central Universities for Beijing University of Posts and Telecommunications and for Northwest Minzu University under Grant Nos. 31920160003 and 31920180115, the Zhejiang Open Foundation of the Most Important Subjects, and the Gansu Provincial First-Class Discipline Program of Northwest Minzu University.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cai, N., He, M., Wu, Q. et al. On Almost Controllability of Dynamical Complex Networks with Noises. J Syst Sci Complex 32, 1125–1139 (2019). https://doi.org/10.1007/s11424-017-6273-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-017-6273-7

Keywords

Search

Navigation