On Instability of LS-based Self-tuning Systems with Bounded Disturbances
Shuai Xu, Chanying Li

TL;DR
This paper demonstrates that least-squares based self-tuning regulators for discrete-time linear systems can become unstable under any bounded disturbance, highlighting a fundamental limitation of these controllers.
Contribution
It reveals the inherent instability risk of LS-based self-tuning regulators in the presence of bounded disturbances, even if the noise is minimal.
Findings
LS-based STR can destabilize systems with bounded disturbances
Instability risk exists regardless of disturbance magnitude
Highlights limitations of LS-based self-tuning control methods
Abstract
It is well known that discrete-time linear systems can be stabilized by a least-squares (LS) based self-tuning regulator (STR), as long as noises are absent. However, this note shows that once the discrete-time linear systems are disturbed, the LS-based STR is always running the risk of unstabilizing systems, no matter how small the noises are.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Dynamics and Pattern Formation · Extremum Seeking Control Systems · Iterative Learning Control Systems
On Instability of LS-based Self-tuning Systems with Bounded Disturbances 111The work was supported by the National Natural Science Foundation of China under Grants 61422308 and 11688101.
Shuai Xu222S. Xu and C. Li are with the Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, P. R. China. They are also with the School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, P. R. China. Corresponding author: Chanying Li (Email: [email protected]). , Chanying Li 22footnotemark: 2
Abstract
It is well known that discrete-time linear systems can be stabilized by a least-squares (LS) based self-tuning regulator (STR), as long as noises are absent. However, this note shows that once the discrete-time linear systems are disturbed, the LS-based STR is always running the risk of unstabilizing systems, no matter how small the noises are.
Keywords: Least-squares, self-tuning regulators, parametrization, linear systems, discrete-time, instability, noises
1 Introduction
It was proved early in [2] that the following noise-free system
[TABLE]
can be stabilized by a least-squares based self-tuning regulator. In fact, as long as the noise is absent, the LS-based STR even is capable of stabilizing the nonlinear discrete-time system
[TABLE]
whenever with (see [3]). But what will happen if systems are disturbed by bounded noises? This may be more practical. Relevant works in the stochastic framework shed some light (e.g., [4], [5], [6], [7], [8]). [8] studied the ARMA model, which is corrupted by a sequence of martingale difference noises, and derived the stability and optimality of the LS-based STR. Meanwhile, the strong consistency of the LS estimator is guaranteed in the closed loop. Later on, number and a polynomial criterion have been put forward as the critical nonlinear characterizations of the stabilizability for systems in type (1) but with random noises involved (see [9] and [10]). Such systems can be stabilized by the LS-based STR, when their nonlinearities are within the critical nonlinear conditions. Otherwise, no feedback control law is possible to stabilize them. This suggests that noises play an role here. The critical nonlinear growth rates are apparently reduced by the involvement of noises.
Now, a direct consequence of [7] indicates that if the noises are assumed to be bounded and i.i.d distributed, then with probability , the LS-based STR can stabilize system
[TABLE]
The trouble is, there still exist some sequences with probability [math] such that the stochastic tools could do nothing to them. [11] observed the divergence of the LS estimator in a self-tuning system for some special bounded noises. Nevertheless, whether the LS-based self-tuning system is stable or not for bounded noises was still unknown to people yet. We prove in this note that there indeed exist some bounded noises that will result in the instability of a LS-based self-tuning system, even for the simplest discrete-time linear model with a scalar unknown parameter. Perhaps more surprisingly, as our result indicates, once a discrete-time system is disturbed, the LS-based STR is always running the risk of unstabilizing it, no matter how small the noises are. In the meantime, for the bounded noises causing the system unstable, the LS estimator is proved to be divergent during the closed-loop identification, as observed in [11].
Notably, though, discrete-time uncertain systems with bounded noises are stabilizable as well, provided their nonlinearities meet the polynomial criterion (see [12] and [13]). This means, different from the stochastic framework where the LS-STR converges to the minimal variance controller, the LS-STR in the deterministic framework performs no longer “optimal”.
2 Main Results
Consider the discrete-time single-input/single-output linear model:
[TABLE]
where are the system output, input, and noise sequences, respectively. Parameter is unknown. Further, we assume
Assumption 1**.**
There is a number such that for all .
The standard LS estimate of for model (2) reduces to
[TABLE]
where are the deterministic initial values of the algorithm. The feedback law is designed according to the well-known certainty equivalence principle:
[TABLE]
Denote , then the closed-loop system (2) and (5) equals to
[TABLE]
Theorem 1**.**
*For any initial values and , there exists a sequence satisfying Assumption 1 such that
(i) the LS estimate error diverges that ;
(ii) the outputs of the closed-loop system (6) satisfies*
[TABLE]
3 Proof of Theorem 1
The proof is based on several lemmas.
Lemma 1**.**
Let be an integer that
[TABLE]
Then, for all , if
[TABLE]
where
[TABLE]
Proof.
First of all, note that (3) and (4) yield
[TABLE]
and with . According to (6) and (9), we have
[TABLE]
We now verify that both and are bounded by . As a matter of fact, by virtue of (6), (8) and (11),
[TABLE]
Moreover, (10) yields
[TABLE]
which by (6) again,
[TABLE]
When , due to (11). In addition, (8) means
[TABLE]
[TABLE]
and
[TABLE]
If , we have
[TABLE]
For , it is also easy to compute
[TABLE]
Since integer , (3) and (3) shows
[TABLE]
which yields
[TABLE]
As a consequence, by (12), we have
[TABLE]
The proof is completed.
Lemma 2**.**
Let be an integer fulfilling (8). If satisfies (9), then there is an integer such that is a strictly increasing sequence and .
Proof.
When satisfies (9), (11) holds and as ,
[TABLE]
So, as ,
[TABLE]
which immediately shows
[TABLE]
Now, since for all , by (11),
[TABLE]
In view of (10), decreases monotonically and Let then is a strictly increasing sequence.
Lemma 3**.**
*Let be an integer that and for all . The following two statements hold:
(i) there are some numbers , and such that*
[TABLE]
(ii) if , then there is an integer such that
[TABLE]
Proof.
We now prove statement (i). By (6) and (10),
[TABLE]
From (6), (10) and (16), for all ,
[TABLE]
Since is an increasing sequence, (18) shows that is a decreasing sequence. So, is bounded for all and exists. We assert . Otherwise, if , then for all . By (17), we have
[TABLE]
This immediately leads to . By again,
[TABLE]
which contradicts to (19). Therefore, and hence, for some integer .
When , by the fact that is a decreasing sequence, (17) shows that
[TABLE]
The first formula of (i) is thus derived by letting and . So, as ,
[TABLE]
This together with (19) infers that .
To prove statement (ii), we first assert that there is an integer that . Otherwise, for all . Therefore, by and (19), we have for any ,
[TABLE]
Consequently, by (20), as ,
[TABLE]
which contradicts to (21). Let
[TABLE]
then and .
The remainder is devoted to showing . Otherwise, if , by noting that for any , (22) holds as well for all and hence . Rewrite by
[TABLE]
which derives a contradiction. (ii) is thus proved.
Lemma 4**.**
Let satisfy (8). Given a constant , set
[TABLE]
where is an integer such that
[TABLE]
Then,
Proof.
By (6), (8), (23) and (24), we have
[TABLE]
Note that for all , in view of Lemma 3, there exists an integer fulfilling (15). By (19), yields . Then, (15), (17) and (19) imply
[TABLE]
Moreover, , the above inequality shows
[TABLE]
which completes the proof.
Proof of Theorem 1.
Set the noise
[TABLE]
where for ,
[TABLE]
Clearly, for . We next claim that is finite. Otherwise, . Then, (8) fails for every and whenever . Now, , which means and . Therefore,
[TABLE]
If , it is easy to compute that due to . So, (8) holds for . This asserts . Consequently, by Lemma 3(i), there are some and such that for all sufficiently large ,
[TABLE]
which together with (26) contradicts to . Therefore, is finite.
Now, fix . Define
[TABLE]
where
[TABLE]
Moreover, let
[TABLE]
with
[TABLE]
For and defined above, set
[TABLE]
Noting that (8) is true for , by Lemma 1, for all
We proceed to prove that both and are finite. If , then satisfies (9) for all . Further, since (8) holds for , by Lemma 2, is an increasing sequence for some and , which gives . Hence is finite or a contradiction arises. So, by Lemma 4, we immediately deduce that for all sufficiently large ,
[TABLE]
It is clear that as and by (11). Similar to the proof of , Lemma 3(i) shows that is finite.
Suppose two increasing sequences , and a series are constructed for some such that (8) holds for , and
[TABLE]
Analogous arguments of (27) and (28)–(29) yield that there are two finite integers and , as well as a sequence such that (8) holds for , and
[TABLE]
So, there exists a and a fulfilling (30) and for each . Statements (i) and (ii) are thus derived as desired.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] G. Goodwin, P. Ramadge, P. Caines, Discrete-time multivariable adaptive control, IEEE Transactions on Automatic Control 25 (3) (1980) 449–456.
- 3[3] L. Guo, C. Wei, Global stability/instability of LS-based discrete-time adaptive nonlinear control, IFAC Proceedings Volumes 29 (1) (1996) 5215–5220.
- 4[4] K. J. Åström, B. Wittenmark, On self tuning regulators, Automatica 9 (2) (1973) 185–199.
- 5[5] K. J. Åström, U. Borisson, L. Ljung, B. Wittenmark, Theory and applications of self-tuning regulators, Automatica 13 (5) (1977) 457–476.
- 6[6] P. Kumar, Convergence of adaptive control schemes using least-squares parameter estimates, IEEE Transactions on Automatic Control 35 (4) (1990) 416–424.
- 7[7] L. Guo, H.-F. Chen, The Åström-Wittenmark self-tuning regulator revisited and ELS-based adaptive trackers, IEEE Transactions on Automatic Control 36 (7) (1991) 802–812.
- 8[8] L. Guo, Convergence and logarithm laws of self-tuning regulators, Automatica 31 (3) (1995) 435–450.
