Abstract
This paper proposes a novel approach to suppressing bounded exogenous disturbances in a linear discrete-time control system by a static state- or output-feedback control law. The approach is based on reducing the original problem to a nonconvex matrix optimization problem with the gain matrix as one variable. The latter problem is solved by the gradient method; its convergence is theoretically justified for several important special cases. An example is provided to demonstrate the effectiveness of the iterative procedure proposed.
Notes
No doubt, this technical assumption can be relaxed; for the time being, the objective is to establish simple and visual results.
In the sense of the second derivative in a direction.
REFERENCES
Boyd, S., El Ghaoui, L., Feron, E., and Balakrishnan, V., Linear Matrix Inequalities in System and Control Theory, Philadelphia: SIAM, 1994.
Nazin, S.A., Polyak, B.T., and Topunov, M.V., Rejection of Bounded Exogenous Disturbances by the Method of Invariant Ellipsoids, Autom. Remote Control, 2007, vol. 68, no. 3, pp. 467–486.
Polyak, B.T., Khlebnikov, M.V., and Shcherbakov, P.S., Upravlenie lineinymi sistemami pri vneshnikh vozmu-shcheniyakh: Tekhnika lineinykh matrichnykh neravenstv (Control of Linear Systems Subjected to Exogenous Disturbances: The Technique of Linear Matrix Inequalities), Moscow: LENAND, 2014.
Kalman, R.E., Contributions to the Theory of Optimal Control, Boletin de la Sociedad Matematica Mexicana, 1960, vol. 5, no. 1, pp. 102–119.
Levine, W. and Athans, M., On the Determination of the Optimal Constant Output Feedback Gains for Linear Multivariable Systems, IEEE Trans. Automat. Control, 1970, vol. 15, no. 1, pp. 44–48.
Polyak, B.T. and Khlebnikov, M.V., Static Controller Synthesis for Peak-to-Peak Gain Minimization as an Optimization Problem, Autom. Remote Control, 2021, vol. 82, no. 9, pp. 1530–1553.
Khlebnikov, M.V., A Comparison of Guaranteeing and Kalman Filters, Autom. Remote Control, 2023, vol. 84, no. 4, pp. 434–459.
Polyak, B., Introduction to Optimization, Optimization Software, 1987.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was recommended for publication by V.V. Glumov, 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. Consider a sequence of stabilizing controllers {Kj} ∈ \(\mathcal{S}\) such that Kj → K ∈ \(\partial \mathcal{S}\), i.e., ρ(A + BKC) = 1. In other words, for any ε > 0 there exists a number N = N(ε) such that
for all j \( \geqslant \) N(ε).
Let Pj be the solution of Eq. (5) associated with the controller Kj:
Also, let Yj be the solution of the dual discrete Lyapunov equation
Using ([6], Lemmas A.1 and A.2) and ([7], Lemma A.1.2), we have
since ρ2(A + BKjC) < αj < 1.
On the other hand,
The proof of Lemma 1 is complete.
Proof of Lemma 2. Differentiation with respect to a is performed in accordance with the results of Section 2, with A replaced by A + BKC.
We add the increment ΔK for K in Eq. (5) and denote the corresponding increment of P by ΔP:
Leaving the notation ΔP for the principal part of the increment, we have
Subtracting Eq. (5) from this equation gives
The increment of f(K) is calculated by linearizing the corresponding terms:
Due to [6, Lemma A.1], from the dual equations (A.1) and (9) it follows that
Thus, we arrive at (7). The proof of Lemma 2 is complete.
Proof of Lemma 3. The value
is calculated by differentiating \({{\nabla }_{K}}f\)(K, α)[E] = \(\left\langle {{{\nabla }_{K}}f(K,\alpha ),E} \right\rangle \) in the direction E ∈ \({{\mathbb{R}}^{{p \times l}}}\).
For this purpose, linearizing the corresponding terms, we calculate the increment of \({{\nabla }_{K}}f\)(K, α)[E] in the direction E:
where
Thus, with P ' = P '(K)[E] and Y ' = Y '(K)[E], we have
Furthermore, P = P(K) is the solution of the discrete Lyapunov equation (5). We write it in increments in the direction E:
or
In view of (5), this expression yields Eq. (10).
Similarly, Y = Y(K) is the solution of the discrete Lyapunov equation (9). We write it in increments in the direction E:
or
Due to (9), we obtain
From (10) and (A.2) it follows that
so
The proof of Lemma 3 is complete.
Rights and permissions
About this article
Cite this article
Khlebnikov, M.V. Suppressing Exogenous Disturbances in a Discrete-Time Control System As an Optimization Problem. Autom Remote Control 84, 1088–1097 (2023). https://doi.org/10.1134/S0005117923100053
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117923100053