Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Composability and controllability of structural linear time-invariant systems: Distributed verification
KTH, School of Computer Science and Communication (CSC), Robotics, perception and learning, RPL. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.ORCID iD: 0000-0002-8750-0897
Show others and affiliations
2017 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 78, p. 123-134Article in journal (Refereed) Published
Abstract [en]

Motivated by the development and deployment of large-scale dynamical systems, often comprised of geographically distributed smaller subsystems, we address the problem of verifying their controllability in a distributed manner. Specifically, we study controllability in the structural system theoretic sense, structural controllability, in which rather than focusing on a specific numerical system realization, we provide guarantees for equivalence classes of linear time-invariant systems on the basis of their structural sparsity patterns, i.e., the location of zero/nonzero entries in the plant matrices. Towards this goal, we first provide several necessary and/or sufficient conditions that ensure that the overall system is structurally controllable on the basis of the subsystems’ structural pattern and their interconnections. The proposed verification criteria are shown to be efficiently implementable (i.e., with polynomial time-complexity in the number of the state variables and inputs) in two important subclasses of interconnected dynamical systems: similar (where every subsystem has the same structure) and serial (where every subsystem outputs to at most one other subsystem). Secondly, we provide an iterative distributed algorithm to verify structural controllability for general interconnected dynamical system, i.e., it is based on communication among (physically) interconnected subsystems, and requires only local model and interconnection knowledge at each subsystem.

Place, publisher, year, edition, pages
Elsevier, 2017. Vol. 78, p. 123-134
Keywords [en]
Combinatorial mathematics, Control system analysis, Controllability, Graph theory, Structural properties
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-200861DOI: 10.1016/j.automatica.2016.12.016ISI: 000398010500015Scopus ID: 2-s2.0-85010390682OAI: oai:DiVA.org:kth-200861DiVA, id: diva2:1071252
Funder
Knut and Alice Wallenberg Foundation, NSF CIF-1513936Swedish Research Council
Note

QC 20170203

Available from: 2017-02-03 Created: 2017-02-03 Last updated: 2017-04-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Carvalho, J. FredericoJohansson, Karl Henrik
By organisation
Robotics, perception and learning, RPLCentre for Autonomous Systems, CASAutomatic Control
In the same journal
Automatica
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 149 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf