Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917343607652352 |
|---|---|
| author | Lebon, Luca Claude Gino Altafini, Claudio |
| author_facet | Lebon, Luca Claude Gino Altafini, Claudio |
| contents | In this paper 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 conditional 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_16689 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems Lebon, Luca Claude Gino Altafini, Claudio Optimization and Control Systems and Control In this paper 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 conditional 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. |
| title | Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2510.16689 |