Feasible Pairings for Decentralized Integral Controllability of Non-Square Systems
Yuhao Tong, Steven W. Su

TL;DR
This paper develops a mathematical framework for identifying feasible input-output pairings in non-square systems to ensure decentralized integral controllability, with applications in industrial processes and AI multi-agent systems.
Contribution
It extends the concept of D-stability to non-square matrices and introduces squared matrices to analyze stability of control pairings in complex systems.
Findings
Defined D-stability for non-square matrices.
Linked stability of squared sub-components to overall system stability.
Provided sufficient conditions for robust decentralized control.
Abstract
This paper investigates the determination of feasible input-output pairings for the decentralized integral controllability of non-square systems. The relevance of this problem extends beyond traditional industrial processes into modern AI research, particularly Multi-Agent Reinforcement Learning (MARL), where environments frequently act as strongly non-square mappings that evaluate high-dimensional joint action spaces via comparatively low-dimensional global rewards. To address the stability of these complex distributed architectures, we extend the concept of D-stability to non-square matrices, providing a crucial mathematical foundation. We formally define D-stability for non-square matrices as a direct generalization of the square case. By introducing the concept of ``Squared Matrices'', which are derived from specific column selections of the non-square formulation and directly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdaptive Dynamic Programming Control · Control Systems and Identification · Advanced Control Systems Optimization
