Zero Controllability Criterion for Discrete Positive Systems with Multiple Delays on Both States and Inputs
Abstract
Zero controllability criterion for positive linear discrete systems with multiple delays in both states and inputs is obtained and proved. An example is given to support our main result.
1. Introduction and Preliminaries
Throughout this paper, we use the following notation: ℕ is the set of nonnegative integers, ℕ∗ is the set of positive integers, is the finite subset of ℕ with n ≤ m, ℝn is the set of real vectors with n components, is the set of vectors in ℝn with nonnegative components, ℝn×m is the set of real matrices of size n × m, In is the identity matrix in ℝn×n, and is the set of real matrices with nonnegative entries.
Positive systems are a wide class of systems in which state variables are constrained to be positive or at least nonnegative for all time whenever the initial conditions and inputs are nonnegative [1, 2]. The mathematical theory of positive linear systems is based on the theory of nonnegative matrices developed by Perron and Frobenius, see, e.g., [3, 4]. Since positive systems are not defined on linear spaces but on cones, then many concepts of linear systems cannot be directly generalized to linear positive systems without reformulation. One such property is the notion of controllability of linear positive systems.
Definition 1. (positivity). System (2) is said to be positive if the state , i ∈ ℕ, for any initial states , for any initial inputs , and all inputs , i ∈ ℕ.
Lemma 1. (see [10]). System (2) is positive if and only if and .
In all the sequels in this paper, we assume that system (2) is positive.
Definition 2. (zero controllability). System (2) is said to be zero controllable if any initial state sequence and any initial input sequence , there exist a positive integer N and an input sequence such that the state of the system is driven from x−j to 0, that is, xN = 0.
The paper is organized as follows. In Section 2, we give and prove the criterion of the zero controllability of the general system (2) which is the main result of this paper. A numerical example is given in Section 3. Finally, the conclusion is provided in Section 4.
2. Main Result
In this section, we give the proof of the main result of this paper, which is accomplished in Theorem 1.
Lemma 2 (see [12], [13].)The general solution to (2) is given by
Lemma 3. The transition matrix Gi also satisfies the following equation:
Proof. See Appendix A.
Then, for any i ∈ ℕ, we pose , and hence, for all i ∈ ℕ∗, we pose
Moreover, for i ∈ ℕ, we put
Clearly by (7) and (9), solution (3) is given by the following new formula:
Theorem 1. System (2) is zero controllable if and only if the matrix
We introduce the following useful two lemmas that will aid us in the proof of our main result.
Lemma 4. For all i ∈ ℕ, we have
Proof. See Appendix B.
Without loss of generality, we assume that p ≥ q. Indeed, if p < q, we can set Aj = 0 for , and then we come back to p = q case.
Lemma 5. For all i ≥ p, we have
Proof. See Appendix C.
Remark 1. Since , then Ap ≠ 0.
Now, we prove our main result.
Proof of Theorem 1 (sufficiency). Since A is nilpotent, then there exists a positive integer N such that AN+p = 0. Hence, by Lemma 5, we have for and for . Thus, system (2) is zero controllable.
(Necessity). Since system (2) is zero controllable, there exists a positive integer N such that for and for . According to Lemma 4, we get that and for . Thus, by Lemma 5, we have AN+p = 0. This implies that A is nilpotent. The theorem is proved.
Remark 2. If one diagonal element of the matrix A0 is nonzero, system (2) is nonzero controllable.
3. Example
By calculation, we get that matrix is nilpotent with index k = 6, that is, Ak−1 ≠ 0 and Ak = 0. Thus, by Theorem 1, system (2) is zero controllable.
4. Conclusion
In this paper, we have investigated the zero controllability of discrete linear positive systems with delays. Necessary and sufficient conditions have been established for the zero controllability discrete linear positive systems with multiple delays in both state variables and input signals. A numerical example is presented to explore the proposed theory.
Conflicts of Interest
The author declares no conflicts of interest.
Appendix
A. Proof of Lemma 3
B. Proof of Lemma 4
Proof. Let i ∈ ℕ. For , we have
Similarly, we prove that (13) holds.
C. Proof of Lemma 5
Proof. We introduce a new state variable for i ∈ ℕ by
It is easy to verify that
Let ui = 0 for i ∈ ℕ. Then, the solution of system (C.2) is given by
On the other hand, from (10), for all i ≥ p, we have
Hence, by identification between (C.4) and (C.5), we get that (14) holds.
Open Research
Data Availability
No data were used to support this study.