Algebraic Criteria on Controllability and Positive-Controllability of Discrete-Time Bilinear Systems: Seeking Nonzero Entries
成果类型:
Article
署名作者:
Tie, Lin
署名单位:
Beihang University
刊物名称:
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN/ISSBN:
0018-9286
DOI:
10.1109/TAC.2021.3065317
发表日期:
2022
页码:
1744-1759
关键词:
Controllability
Nonlinear systems
control systems
Linear systems
Aerospace electronics
Kalman filters
control theory
Algebraic criteria
CONTROLLABILITY
discrete-time bilinear systems
invariant sets
near-controllability
positive-controllability
positive-near-controllability
摘要:
In this article, we consider controllability of discrete-time bilinear systems. A classical sufficient condition was obtained in this journal in 1973, which, unfortunately, is not algebraically verifiable, and the required control inputs to achieve state transition are unknown. However, based on a recently established notion, near-controllability, we propose a seeking nonzero entries approach to derive fully algebraically verifiable controllability criteria for discrete-time bilinear systems. More specifically, by our approach, the verification of controllability of the systems is transformed into the problem of seeking nonzero entries of a sequence of matrices generated by the two system matrices. In addition, the control inputs steering the controllable systems between any given pair of states can be easily computed by proposing two algorithms based on near-controllability. As applications, the seeking nonzero entries approach is generalized to construct arbitrary-finite-dimensional controllable discrete-time bilinear systems and also to prove positive-controllability of discrete-time bilinear systems, where algebraic criteria are obtained by the root locus theory and positive-near-controllability that is a new notion introduced in this article. Examples are provided to illustrate the obtained algebraic controllability criteria and algorithms.