liu.seSearch for publications in DiVA
Operational message
There are currently operational disruptions. Troubleshooting is in progress.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
On controllability of temporal networks
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.
University Federico II, Napoli, Italy.ORCID iD: 0000-0002-7155-2756
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-4142-6502
2024 (English)In: European Journal of Control, ISSN 0947-3580, E-ISSN 1435-5671, Vol. 80, article id 101046Article in journal (Refereed) Published
Abstract [en]

Temporality has been recently identified as a useful feature to exploit when controlling a complex network. Empirical evidence has in fact shown that, with respect to their static counterparts, temporal networks (i) are often endowed with larger reachable sets and (ii) require less control energy when steered towards an arbitrary target state. However, to date, we lack conditions guaranteeing that the dimension of the controllable subspace of a temporal network is larger than that of its static counterpart. In this work, we consider the case in which a static network is input connected but not controllable. We show that when the structure of the graph underlying the temporal network remains the same throughout each temporal snapshot while the (nonvanishing) edge weights vary, then the temporal network will be completely controllable almost always, even when its static counterpart is not. An upper bound on the number of snapshots needed to achieve controllability is also provided.

Place, publisher, year, edition, pages
Elsevier, 2024. Vol. 80, article id 101046
Keywords [en]
Controllability, Temporal networks, Linear time-varying systems, Structural controllability
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-208789DOI: 10.1016/j.ejcon.2024.101046ISI: 001359276100001OAI: oai:DiVA.org:liu-208789DiVA, id: diva2:1908139
Funder
Swedish Research Council
Note

Funding Agencies|Swedish Research Council [2020-03701]; ELLIIT framework program at Linkping University [2022K8EZBW]; European Union - Next Generation EU [D.D. 104-02/02/2022]; Ministero dell'Universita e della Ricerca)

Available from: 2024-10-24 Created: 2024-10-24 Last updated: 2026-01-21
In thesis
1. Geometric Control Problems over Networks
Open this publication in new window or tab >>Geometric Control Problems over Networks
2026 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis aims to bridge classical geometric control theory with the theory of structured systems within a network-based framework. The proposed methodology integrates structural and geometric control techniques and leverages the key observation that the subspaces of interest contain or are contained in a subspace generated by canonical basis vectors. Since these canonical vectors correspond to individual network nodes, the algebraic analysis of such subspaces can be directly translated into an analysis over node sets.

The first paper included in this thesis investigates the controllability of temporal networks, modeled as linear, piecewise-constant, time-varying dynamical systems. In particular, an upper bound on the number of snapshots, i.e., time intervals during which the system matrices remain constant, necessary to achieve controllability, is derived. The proof exploits structural properties by decomposing the controllability subspace associated with each snapshot into a component which varies depending on the specific entries of the system matrix, and a fixed component, independent of those entries.

The second paper introduces the minimal node cardinality disturbance decoupling problem, studied under three feedback paradigms: state feedback, output feedback, and dynamic feedback. The formulation and analysis of this problem rely on classical concepts from geometric control theory, such as controlled and conditioned invariant subspaces. By exploiting the fixed structure of these subspaces, they can be reformulated as sets of nodes, providing a network-based interpretation that enhances both intuition and visual interpretability.

The third paper applies the developed theoretical framework to the minimal input cardinality disturbance decoupling problem via output feedback in a system of coupled oscillators, linearized around a stable phase-locked synchronized state, and applies it to the disturbance decoupling of power grids. This application illustrates the practical relevance and versatility of the proposed approach.

Overall, the thesis shows that, under mild assumptions, complex geometric control structures can be represented in an intuitive and visually meaningful manner when analyzed through the lens of networks. This perspective not only facilitates the study of large-scale systems, but also opens new research directions at the intersection of geometric control and network theory.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2026. p. 154
Series
Linköping Studies in Science and Technology. Licentiate Thesis, ISSN 0280-7971 ; 2026
National Category
Control Engineering
Identifiers
urn:nbn:se:liu:diva-220666 (URN)10.3384/9789181184358 (DOI)9789181184341 (ISBN)9789181184358 (ISBN)
Presentation
2026-02-12, Ada Lovelace, B-building, Campus Valla, Linköping, 13:15 (English)
Opponent
Supervisors
Available from: 2026-01-21 Created: 2026-01-21 Last updated: 2026-01-29Bibliographically approved

Open Access in DiVA

fulltext(591 kB)116 downloads
File information
File name FULLTEXT01.pdfFile size 591 kBChecksum SHA-512
1a44251e49335824e10da958cbe49c4260663c276a9d25051cbe98896b856d37cb25b1c06cfc9e733f00d12c9cb841a03a9277712059fc2405058a914078aea9
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Lebon, Luca Claude GinoAltafini, Claudio

Search in DiVA

By author/editor
Lebon, Luca Claude GinoLo Iudice, FrancescoAltafini, Claudio
By organisation
Automatic ControlFaculty of Science & Engineering
In the same journal
European Journal of Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 116 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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