Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 24 min ago
PreprintCC BY 4.0arXiv

A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback

  • Luca Claude Gino Lebon
  • Jorke de Vlas
  • Johannes K. Fichte
  • Claudio Altafini
Open at sourcePDFDOICite

Abstract

In this paper, we propose an algorithm that solves, in polynomial-time, the minimal input/output node cardinality disturbance decoupling problem via output feedback. The optimal solution, intended as a minimal-cardinality pair of sets of control inputs and measurement output nodes needed to achieve the decoupling, is computed by solving a modified min-cut/max-flow problem.

Related

  1. A Safeguarded Accelerated Proximal ADMM Algorithm for Solving Structured Cardinality Penalized Optimization Problems
    Wei Bian, Hongyuan Tao, Fan Wu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Partial-State Deadzone-Adapted Disturbance Suppression Control For Strict-Feedback Systems
    Iasson Karafyllis, Alexandros Aslanidis, Miroslav Krstic
    arXivPreprintCC BY-SA 4.0Full textOptimisation & controlarXiv
  3. Semidefinite Implementations of the Proximal Point Algorithm and Consequences for Progressive Decoupling in Optimization
    Xudong Li, R. Tyrrell Rockafellar, Defeng Sun
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Tracking Through Decoupling Singularities: A Singularity-Robust Homotopy-Continuation Extension of Feedback Linearization
    Alex Borisevich
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. A deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs
    Zhiqiang Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{lebon2026polynomialtime,
  title = {{A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback}},
  author = {Luca Claude Gino Lebon and Jorke de Vlas and Johannes K. Fichte and Claudio Altafini},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.22735},
  eprint = {2610.22735},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.22735},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback
AU  - Luca Claude Gino Lebon
AU  - Jorke de Vlas
AU  - Johannes K. Fichte
AU  - Claudio Altafini
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.22735
UR  - https://arxiv.org/abs/2610.22735
AB  - In this paper, we propose an algorithm that solves, in polynomial-time, the minimal input/output node cardinality disturbance decoupling problem via output feedback. The optimal solution, intended as a minimal-cardinality pair of sets of control inputs and measurement output nodes needed to achieve the decoupling, is computed by solving a modified min-cut/max-flow problem.
ER  -