A matrix theoretic characterization of the strongly reachable subspace
In this paper, we provide novel characterizations of the weakly unobservable and the strongly reachable subspaces corresponding to a given state-space system. These characterizations provide closed-form representations for the said subspaces. In this process, we establish that the strongly reachable subspace is intimately related to the space of admissible impulsive inputs. We also show how to calculate the dimensions of these subspaces from the transfer matrix of the system.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the Reachability and Controllability of Temporal Continuous-Time Linear Networks: A Generic Analysis
Temporal networks are a class of time-varying networks, which change their topology according to a given time-ordered sequence of static networks (known as subsystems). This paper investigates the reachability and contro…
Temporal SequencesStochastic Model Predictive Control for Sub-Gaussian Noise
We propose a stochastic Model Predictive Control (MPC) framework that ensures closed-loop chance constraint satisfaction for linear systems with general sub-Gaussian process and measurement noise. By considering sub-Gaus…
modelModel Predictive ControlActive Sampling of Interpolation Points to Identify Dominant Subspaces for Model Reduction
Model reduction is an active research field to construct low-dimensional surrogate models of high fidelity to accelerate engineering design cycles. In this work, we investigate model reduction for linear structured syste…
Data-Driven Reachability Analysis from Noisy Data
We consider the problem of computing reachable sets directly from noisy data without a given system model. Several reachability algorithms are presented for different types of systems generating the data. First, an algor…
Provable Data Clustering via Innovation Search
This paper studies the subspace clustering problem in which data points collected from high-dimensional ambient space lie in a union of linear subspaces. Subspace clustering becomes challenging when the dimension of inte…
Clustering