Abstract
In this paper we address the problem of fundamental performance limitations in adaptive parameter estimation and system identification, occurring in environments where perturbations are present but there is lack of sufficient excitation. We construct a simple but general bursting scenario to derive an analytical lower bound on the worst-case lim sup performance of a wide class of parameter estimation and system identification algorithms. Our results show that in the absence of any excitation or other input constraints, arbitrarily small perturbations impose a serious limitation on the lim sup performance of these adaptive algorithms, in the sense that the worst-case performance deteriorates proportionally with the size of the parametric uncertainty set. Furthermore, this performance limitation is a consequence of some fairly general properties of adaptive algorithms and independent of their precise form.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the American Control Conference |
Publisher | American Automatic Control Council |
Pages | 1260-1264 |
Number of pages | 5 |
Volume | 2 |
State | Published - 1994 |
Event | Proceedings of the 1994 American Control Conference. Part 1 (of 3) - Baltimore, MD, USA Duration: Jun 29 1994 → Jul 1 1994 |
Other
Other | Proceedings of the 1994 American Control Conference. Part 1 (of 3) |
---|---|
City | Baltimore, MD, USA |
Period | 6/29/94 → 7/1/94 |
ASJC Scopus subject areas
- Control and Systems Engineering