Paperlane

no. 11 · Monday 9 November 2026

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

Luca Claude Gino Lebon, Jorke de Vlas, Johannes K. Fichte and Claudio Altafini

math.OC · v2

Abstract

For networked systems, we propose a polynomial-time algorithm for solving the minimal input/output node cardinality disturbance decoupling problem via output feedback. The algorithm computes an optimal solution, namely, a pair of minimum-cardinality sets of control input and measurement output nodes that achieve disturbance decoupling, by solving a min-cut/max-flow problem on an extended network.

comments
MATLAB functions implementing the results presented in this article are available in the GitLab repository: https://gitlab.liu.se/lucle71/node-based-ddp or in Zenodo: https://doi.org/10.5281/zenodo.23476722
fields
Optimization and Control
pdf ↗ page arXiv:2610.22735 ↗