Abstract
The problem of constructing reachable and null-controllable sets for stationary linear discrete-time systems with a summary constraint on the scalar control is considered. For the case of quadratic constraints and a diagonalizable matrix of the system, these sets are built explicitly in the form of ellipsoids. In the general case, the limit reachable and null-controllable sets are represented as fixed points of a contraction mapping in the metric space of compact sets. On the basis of the method of simple iteration, a convergent procedure for constructing their external estimates with an indication of the a priori approximation error is proposed. Examples are given.
REFERENCES
Propoi, A.I., Elementy teorii optimal’nykh diskretnykh protsessov (Elements of the Theory of Optimal Discrete Processes), Moscow: Nauka, 1973.
Ibragimov, D.N. and Sirotin, A.N., On the Problem of Optimal Speed for the Discrete Linear System with Bounded Scalar Control on the Basis of 0-controllability Sets, Autom. Remote Control, 2015, vol. 76, no. 9, pp. 1517–1540. https://doi.org/10.1134/S0005117919030019
Ibragimov, D.N., On the Optimal Speed Problem for the Class of Linear Autonomous Infinite-Dimensional Discrete-Time Systems with Bounded Control and Degenerate Operator, Autom. Remote Control, 2019, vol. 80, no. 3, pp. 393–412. https://doi.org/10.1134/S0005117919030019
Zaitseva, M.V. and Tochilin P.A., Constructing Estimates of Reachability Sets in Crowd Flows Modeling, Computational Mathematics and Mathematical Physics, 2023, vol. 63, no. 8, pp. 1527–1539. https://doi.org/10.1134/S0965542523070163
Tochilin, P.A., On the Construction of Nonconvex Approximations to Reach Sets of Piecewise Linear Systems, Differential Equations, 2015, vol. 51, no. 11, pp. 1499–1511. https://doi.org/10.1134/S0012266115110117
Kuntsevich, V.M. and Kurzhanski, A.B., Attainability Domains for Linear and Some Classes of Nonlinear Discrete Systems and Their Control, J. Autom. Inform. Sci., 2010, vol. 42, no. 1, pp. 1–18. https://doi.org/10.1615/JAutomatInfScien.v42.i1.10
Sirotin, A.N. and Formal’skii, A.M., Reachability and Controllability of Discrete-Time Systems under Control Actions Bounded in Magnitude and Norm, Autom. Remote Control, 2003, vol. 64, no. 12, pp. 1844–1857. https://doi.org/10.1023/B:AURC.0000008423.93495.be
Colonius, F., Cossich, J.A.N., and Santana, A.J., Controllability Properties and Invariance Pressure for Linear Discrete-Time Systems, J. Dynam. Different. Equat., 2022, vol. 34, pp. 5–22. https://doi.org/10.1007/s10884-021-09966-4
Darup, M.S. and Monnigmann, M., On General Relations between Null-Controllable and Controlled Invariant Sets for Linear Constrained Systems, 53rd IEEE Conference on Decision and Control, Los Angeles, 2014, pp. 6323–6328. https://doi.org/10.1109/CDC.2014.7040380
Ge, S.S., Zhendong, S., and Lee, T.H., Reachability and Controllability of Switched Linear Siscrete-Time Systems, IEEE Transact. Autom. Control, 2001, vol. 46, no. 9, pp. 1437–1441. https://doi.org/10.1109/9.948473
Heemels, W.P.M.H. and Camlibel, M.K., Null Controllability of Discrete-Time Linear Systems with Input and State Constraints, Proc. 47th IEEE Conf. Decis. Control., 2008, pp. 3487–3492. https://doi.org/10.1109/CDC.2008.4739333
Kaba, M.D. and Camlibel, M.K., A Spectral Characterization of Controllability for Linear Discrete-Time Systems with Conic Constraints, SIAM J. Control Optim., 2015, vol. 53, no. 4, pp. 2350–2372. https://doi.org/10.1137/140960967
Benvenuti, L. and Farina, L., The Geometry of the Reachability Set for Linear Discrete-Time Systems with Positive Controls, SIAM J. Matrix Anal. Appl., 2006, vol. 28, no. 2, pp. 306–325. https://doi.org/10.1137/040612531
Fucheng, L., Mengyuan, S., and Usman, Optimal Preview Control for Linear Discrete-Time Periodic Systems, Mathematical Problems in Engineering, 2019, pp. 1–11. https://doi.org/10.1155/2019/8434293
Berendakova, A.V. and Ibragimov, D.N., About the Method for Constructing External Estimates of the Limit 0-Controllability Set for the Linear Discrete-Time System with Bounded Control, Autom. Remote Control, 2023, vol. 84, no. 2, pp. 97–120. https://doi.org/10.25728/arcRAS.2023.95.43.001
Kostousova, E.K., On External Polyhedral Estimation of the Reachability Sets in the Extended Space for Linear Multistep Systems with Integral Control Constraints, Vychisl. Tekhnol., 2004, vol. 9, no. 4, pp. 54–72.
Gayek, J.E. and Fisher, M.E., Approximating Reachable Sets for n-Dimensional Linear Discrete Systems, IMA J. Math. Control Inform., 1987, vol. 4, no. 2, pp. 149–160. https://doi.org/10.1093/imamci/4.2.149
Ibragimov, D.N., Osokin, A.V., Sirotin, A.N., and Sypalo, K.I., On the Properties of the Limit Control Sets for a Class of Unstable Linear Systems with Discrete Time and l 1-Restrictions, J. Comput. Syst. Sci. Int., 2022, vol. 61, no. 4, pp. 467–484. https://doi.org/10.1134/S1064230722040104
Ibragimov, D.N. and Sirotin, A.N., On Some Properties of Sets of Bounded Controllability for Stationary Linear Discrete Systems with Total Control Constraints, J. Comput. Syst. Sci. Int., 2023, vol. 62, no. 6, pp. 3–32. https://doi.org/10.1134/S1064230723050088
Barr, A.H., Superquadrics and Angle-Preserving Transformations, IEEE-CGA, 1981, vol. 1, no. 1, pp. 11–23. https://doi.org/10.1109/MCG.1981.1673799
Tobler, W.R., The Hyperelliptical and Other New Pseudo Cylindrical Equal Area Map Projections, J. Geophys. Research, 1973, vol. 78, no. 11, pp. 1753–1759. https://doi.org/10.1029/JB078i011p01753
Rockafellar, R., Vypuklyi analiz (Convex Analysis), Moscow: Mir, 1973.
Polovinkin, E.S. and Balashov, M.V., Elementy vypuklogo i sil’no vypuklogo analiza (Elements of Convex and Strongly Convex Analysis), Moscow: Fizmatlit, 2004.
Boyd, S. and Vandenberghe, L., Convex Optimization, Cambridge: Cambridge University Press, 2004. https://doi.org/10.1017/CBO9780511804441
Kolmogorov, A.N. and Fomin, S.V., Elementy teorii funktsii i funktsional’nogo analiza (Elements of the Theory of Functions and Functional Analysis), Moscow: Fizmatlit, 2012.
Dunford, N. and Schwartz, J.T., Linear Operators, Part 2: Spectral Theory, Self Adjoint Operators in Hilbert Space, New York: Interscience Publishers, 1963. Translated under the title Lineinye operatory. T. 2. Spektral’naya teoriya. Samosopryazhennye operatory v gil’bertovom prostranstve, Moscow: Mir, 1966.
Kronover, R.M., Fraktaly i khaos v dinamicheskikh sistemakh (Fractals and Chaos in Dynamical Systems), Moscow: Postmarket, 2000.
Horn, R. and Johnson, C., Matrichnyi analiz (Matrix Analysis), Moscow: Mir, 1989.
Alekseev, V.M., Tihomirov, V.M., and Fomin, S.V., Optimal’noe upravlenie (Optimal Control), Moscow: Nauka, 1979.
Funding
This work was supported in part by the Russian Science Foundation, project no. 23-21-00293.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author of this work declares that he has no conflicts of interest.
Additional information
This paper was recommended for publication by M. V. Khlebnikov, a member of the Editorial Board
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
APPENDIX
APPENDIX
Proof of Lemma 1. By the definition of the Minkowski functional, for any x ∈ \({{\mathbb{L}}_{2}}\) the following relations are true:
Lemma 1 is proven.
Proof of Lemma 2. Since, due to the Riesz theorem, the operator B is linear and bounded, then according to Lemma 1
To solve the optimization problem (A.1) we will use the Lagrange multiplier method for infinite-dimensional spaces [29]. The Lagrange function for λ ∈ \({{\mathbb{R}}^{n}}\) has the following form
Then the search for a minimum in the problem (A.1) is reduced to solving the system of equations
Hence, taking into account (A.1) and the identity \(\sum\limits_{k = 1}^\infty {{{{\left| {{{u}_{k}}} \right|}}^{p}}} \) = (u, Ip(u)) it follows that
Redesignating \(\frac{1}{p}\lambda \) by λ, we finally obtain
where λ ∈ \({{\mathbb{R}}^{n}}\) is determined from (10).
Lemma 2 is proven.
Proof of Corollary 1. By definition, the operator I2 is identical. Then the condition (10) take the form
Since B is surjective, the operator BB* : \({{\mathbb{R}}^{n}} \to {{\mathbb{R}}^{n}}\) and the matrix generating it are invertible, which leads to the relation
Taking into account Lemma 2 we obtain
Corollary 1 is proven.
Proof of Lemma 3. Let B = Y∞. Then, taking into account the spectral decomposition of the matrix A = SΛS–1, the following equalities are true for all k ∈ \(\mathbb{N}\):
Due to the inclusion b ∈ \({{\mathbb{L}}_{{ < 1}}}\), the coefficients αij are equal to zero for all i, j = \(\overline {1,n} \) such that at least one of the two eigenvalues λi or λj turns out to be greater than or equal to 1:
Hence, taking into account the expression for the sum of an infinite decreasing geometric progression, we get the following equality:
which, due to the (A.2), coincides with the definition of βij.
Then the following chain of equalities is true:
This, taking into account Corollary 1, implies the equality \({{H}_{{\mathcal{Y},\infty }}}\) = H–1.
The second item of Lemma 3 is proven in a similar way under the redesignation B = X∞.
Lemma 3 is proven.
Proof of Lemma 4. The proof follows directly from (6) and (13).
Proof of Lemma 5. The proof follows directly from (7) and (13).
Proof of Lemma 6. Since all eigenvalues of the matrix A are strictly less than 1 in absolute value, according to [22, Theorem 5.6.12] the relation ||Ak|| \(\xrightarrow{{k \to \infty }}\) 0 is true. Then, by definition of the limit there is M ∈ \(\mathbb{N}\) for αr ∈ [0; 1) such that ||AM|| = \({{\sup }_{{{{{\left\| x \right\|}}_{r}}\,\leqslant \,1}}}{{\left\| {{{A}^{M}}x} \right\|}_{r}}\) < αr. Since the inequality
is true, AM is a contraction with the contraction factor αr ∈ [0; 1).
Let B ' = (b1, b2, …) ∈ \(l_{q}^{n}\), C ' = (c1, c2, …) ∈ \(l_{q}^{n}\). Then
Lemma 6 is proven.
Proof of Corollary 2. The mapping \({\mathbf{F}}_{{A,b}}^{{(M)}}\) is a contraction due to Theorem 6, and the space \(l_{q}^{n}\) is complete. Then, by virtue of the Banach contraction mapping principle [25], there is a unique fixed-point of \({\mathbf{F}}_{{A,b}}^{{(M)}}\). Moreover, by construction, a fixed-point of the mapping \({\mathbf{F}}_{{A,b}}^{{}}\) must also be a fixed-point of the mapping \({\mathbf{F}}_{{A,b}}^{{(M)}}\). Taking into account Lemma 4 the unique fixed-point of \({\mathbf{F}}_{{A,b}}^{{(M)}}\) is Y∞ ∈ \(l_{q}^{n}\). Hence, Y∞ is the unique fixed-point of \({\mathbf{F}}_{{A,b}}^{{}}\).
Note that the representation \({\mathbf{F}}_{{A,b}}^{{(NM)}}\)(O) = YNM is valid, where by O : lp → \(\mathbb{R}_{r}^{n}\) denotes the zero operator, which is identified with the zero sequence (0, 0, …) ∈ \(l_{q}^{n}\). Then according to Theorem 6
Corollary 2 is proven.
Proof of Corollary 3. The proof follows from Corollary 2 by replacing A with A–1, b with A–1b in conjunction with Lemma 5 and the fact that the eigenvalues of A–1 are inverse of the eigenvalues of A [28].
Proof of Lemma 7. Let’s consider the value
Finally we get that
Lemma 7 is proven.
Proof of Theorem 1. The proof follows directly from Corollary 2, the representations (11) and (8), and Lemma 7.
Proof of Theorem 2. The proof follows directly from Corollary 3, the representations (12) and (9), and Lemma 7.
Proof of Theorem 3. As is known [27], for any \(\mathcal{X}\), \(\mathcal{Y}\) ∈ \({{\mathbb{K}}_{n}}\) satisfying the condition ρH(\(\mathcal{X}\), \(\mathcal{Y}\)) \(\leqslant \) R, the following inclusion is true:
From here, taking into account Theorem 1, Theorem 3 follows.
Proof of Theorem 4. The proof is similar to the proof of Theorem 3, replacing Theorem 1 with Theorem 2.
Proof of Theorem 5. (1) Item 1 follows from the definition of the operator norm and the fact that the maximum of a convex function is achieved on the boundary of the convex set [22]:
(2) By virtue of Hölder's inequality, item 2 follows from item 1:
(3) Also, for M = 1, item 3 follows from item 1:
(4) For r = p = 2 the operator norm can be represented in terms of the scalar product in \(\mathbb{R}_{2}^{n}\):
Then, taking into account item 1, the following representation is true:
Due to the Lagrange multiplier method [29], the maximum point of the optimization problem under consideration u* ∈ \({{\mathbb{R}}^{M}}\) satisfies the following conditions:
Then, by definition, u* is a normed eigenvector of the matrix BTB corresponding to the eigenvalue λ*, i.e.
Item 4 is completely proven.
(5) Item 5 follows from the representation of the operator norm B ' and the Riesz theorem on the norm of a linear and bounded functional in lp [25]:
(6) To prove item 6, we take into account the representation |γ| = max{γ, –γ} for any γ ∈ \(\mathbb{R}\) and consider the following chain of equalities:
Theorem 5 is completely proven.
Rights and permissions
About this article
Cite this article
Ibragimov, D.N. On the External Estimation of Reachable and Null-Controllable Limit Sets for Linear Discrete-Time Systems with a Summary Constraint on the Scalar Control. Autom Remote Control 85, 321–340 (2024). https://doi.org/10.1134/S0005117924040027
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117924040027