Positive Controllability of Large-Scale Networks
2016 (English)In: Proceedings of the 2016 European Control Conference, 2016, 819-824 p.Conference paper (Refereed)
In this paper, we study the problem of controlling large scale networks with controls which can assume only positive values. Given an adjacency matrix A, an algorithm is developed that constructs an input matrix B with a minimal number of columns such that the resulting system (A, B) is positively controllable. The algorithm combines the graphical methods used for structural controllability analysis with the theory of positive linear dependence. The number of control inputs guaranteeing positive controllability is near optimal.
Place, publisher, year, edition, pages
2016. 819-824 p.
Complex Networks, Controllability
IdentifiersURN: urn:nbn:se:liu:diva-130780OAI: oai:DiVA.org:liu-130780DiVA: diva2:954738
European Control Conference, 2016, Aalborg, Denmark