Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems
IEEE Transactions on Automatic Control · 2026-11 · 71 (11) · 7245-7260
DOI: 10.1109/tac.2026.3701288 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Automatic Control, 2026-11. Verfasst von Luca Claude Gino Lebon und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: Swedish Research Council, Linköping University.
Abstract (Originalsprache)
In this article, we show how to formulate and solve disturbance decoupling problems over networks while choosing a minimal number of input and output nodes. Feedback laws that isolate and eliminate the impact of disturbance nodes on specific target nodes to be protected are provided using state, output, and dynamical feedback. For that, we leverage the fact that when reformulated in terms of sets of nodes rather than subspaces, the controlled and conditioned invariance properties admit a simple graphical interpretation. For state and dynamical feedback, the minimal input and output cardinality solutions can be computed exactly in polynomial time, via min-cut/max-flow algorithms.
Förderung
- Swedish Research Council
- Linköping University
Zitieren
APA
Lebon, L. C. G., & Altafini, C. (2026). Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems. IEEE Transactions on Automatic Control, 71(11), 7245-7260. https://doi.org/10.1109/tac.2026.3701288
Vancouver
Lebon LCG, Altafini C. Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems. IEEE Transactions on Automatic Control. 2026;71(11):7245-7260. doi:10.1109/tac.2026.3701288
BibTeX
@article{Lebon2026,
author = {Lebon, Luca Claude Gino and Altafini, Claudio},
title = {Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems},
journal = {IEEE Transactions on Automatic Control},
year = {2026},
volume = {71},
number = {11},
pages = {7245--7260},
doi = {10.1109/tac.2026.3701288}
}
EUVIMED