On polynomially solvable constrained input selections for fixed and switched linear structured systems

DOI10.1016/j.automatica.2023.111308zbMath1530.93180arXiv2204.01084MaRDI QIDQ6088368

Yuanqing Xia, Shenyu Liu, Zhongqi Sun, Yuan Zhang

Publication date: 16 November 2023

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.01084

zbMATH Keywords

linear programmingswitched systemtotal unimodularitystructural controllabilityinput selection

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Linear systems in control theory (93C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum cost input/output design for large-scale linear structural systems
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Structural minimum controllability problem for switched linear continuous-time systems
• On the complexity of the constrained input selection problem for structural linear systems
• From behavioural to population level: Growth and competition
• Generic properties and control of linear structured systems: A survey
• Controllability and reachability criteria for switched linear systems
• An overview of structural systems theory
• Algorithms for joint sensor and control nodes selection in dynamic networks
• Input addition and leader selection for the controllability of graph-based systems
• Structural controllability of switched linear systems
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• The robust minimal controllability problem
• A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
• Emergence of Scaling in Random Networks
• Weighted Bipartite Matching in Matrix Multiplication Time
• A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem
• Structural controllability
• Structural Controllability of Temporally Switching Networks
• On Controllability of Switched Linear Systems
• Input matrix construction and approximation using a graphic approach
• Structural Controllability of an NDS With LFT Parameterized Subsystems
• Minimal structural perturbations for controllability of a networked system: Complexities and approximations
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Minimal Controllability Problems
• On Submodularity and Controllability in Complex Dynamical Networks

This page was built for publication: On polynomially solvable constrained input selections for fixed and switched linear structured systems