Trackability for Discrete-Time LTI Systems: A Brief Review and New Insights
`Trackability', the ability of systems to follow arbitrary reference commands, is investigated in this work. Controllability is not useful in explaining the tracking behavior of system outputs, a gap that is often overlooked. Trackability addresses this gap by characterizing whether system dynamics permits tracking of certain reference commands, irrespective of the controller/control action used. While earlier literature has discussed closely-related ideas, lack of consistency in terminology and focus in the literature has necessitated defining trackability in a simple but rigorous manner. We present definitions for trackability based on elementary linear algebra and propose a rank test for determining trackability of systems, while posing tracking control as an existence question. We discuss in some detail the relationship of this rank test with other results in the literature. These results are then used to generate insights about trackable systems and more importantly to gain insights in to tracking behavior of systems that are not trackable. We also define three indices that indicate the expected tracking behavior of the system. Furthermore, we also present a Venn diagram explaining in detail the connections between trackability and other fundamental system properties like controllability, observability and output controllability, while discussing several facts that elaborate these connections. Specifically, we show that trackability is fundamentally different from controllability and output controllability. The presented work is expected to serve as a foundation for a deeper investigation into the topic of tracking control and provide a framework for receiving new theoretical insights on trackability.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Fundamental Trackability Problems for Iterative Learning Control
Generally, the classic iterative learning control (ILC) methods focus on finding design conditions for repetitive systems to achieve the perfect tracking of any specified trajectory, whereas they ignore a fundamental pro…
Identifying equivalent Calabi--Yau topologies: A discrete challenge from math and physics for machine learning
We review briefly the characteristic topological data of Calabi--Yau threefolds and focus on the question of when two threefolds are equivalent through related topological data. This provides an interesting test case for…
BIG-bench Machine LearningMathA Brief History of Recommender Systems
Soon after the invention of the Internet, the recommender system emerged and related technologies have been extensively studied and applied by both academia and industry. Currently, recommender system has become one of t…
Recommendation SystemsData-driven estimation of system norms via impulse response
This paper proposes a method for estimating the norms of a system in a pure data-driven fashion based on their identified Impulse Response (IR) coefficients. The calculation of norms is briefly reviewed and the main expr…
The unreasonable effectiveness of optimal transport in economics
Optimal transport has become part of the standard quantitative economics toolbox. It is the framework of choice to describe models of matching with transfers, but beyond that, it allows to: extend quantile regression; id…
Discrete Choice Modelsquantile regressionregression