Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.22735

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
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

eess.SYcs.SYmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Claude Gino Lebon, Jorke de Vlas, Johannes K. Fichte, Claudio Altafini. 2026-10-15. A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback. https://arxiv.org/abs/2610.22735

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An Introduction to Model-Based Systems Engineering and Hetero-functional Graph Theory for Hydrological Systems of Systems

This introductory overview describes a unified modeling framework for representing interconnected environmental systems using Model-Based Systems Engineering and Hetero-functional Graph Theory. Existing environmental models encode rich structural and process-level information, yet much of this knowledge remains implicit within domain-specific formulations. This paper demonstrates how such information can be formalized into a consistent ontology that explicitly represents system structure, function, and interconnections. Using illustrative hydrological examples, the tutorial illustrates how conventional process models can be translated into a scalable system-of-systems representation. Agricultural nitrogen applied to land is represented explicitly as the point at which human decisions enter the hydrological system, illustrating how models of human systems can be coupled to hydrological models within the same representation. These examples highlight how embedded relationships in existing models can be made explicit and computationally tractable. Using simplified examples, the overview provides a foundation for integrating heterogeneous models across environmental and engineered domains. More broadly, this work offers a step-by-step introduction to a generalizable modeling framework for complex systems.

eess.SY↗
arXiv2026

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗
arXiv2026

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗