A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback
eess.SY, cs.SY, math.OC
Submitted: 2026-10-15
Updated: 2026-10-15
Comments: MATLAB functions implementing the results presented in this article are available in the GitLab repository https://gitlab.liu.se/lucle71/node-based-ddp
License: http://creativecommons.org/licenses/by/4.0/
The gist: In this paper, we propose an algorithm that solves, in polynomial-time, the minimal input/output node cardinality disturbance decoupling problem via output feedback.
Terminology
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 papers
- One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
- A Geometric Decision Procedure for STL Feasibility and Repair
- From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
- Battery Second Life: A Review of Experimental Studies
- Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
- Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model