Recursive Least Squares with Matrix Forgetting
This paper considers an extension of recursive least squares (RLS), where the cost function is modified to include a matrix forgetting factor. Minimization of the modified cost function provides a framework for combined variable-rate and variable-direction (RLS-VRDF) forgetting. This extension of RL...
Saved in:
| Published in | Proceedings of the American Control Conference pp. 1406 - 1410 |
|---|---|
| Main Authors | , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
AACC
01.07.2020
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2378-5861 |
| DOI | 10.23919/ACC45564.2020.9148005 |
Cover
| Summary: | This paper considers an extension of recursive least squares (RLS), where the cost function is modified to include a matrix forgetting factor. Minimization of the modified cost function provides a framework for combined variable-rate and variable-direction (RLS-VRDF) forgetting. This extension of RLS simultaneously addresses two key issues in standard RLS, namely, the need for variable-rate forgetting due to changing plant parameters as well as the need for variable-direction covariance updating due to the loss of persistency. The performance of RSL-VRDF is illustrated by an example with abrupt parameter changes and loss of persistency. |
|---|---|
| ISSN: | 2378-5861 |
| DOI: | 10.23919/ACC45564.2020.9148005 |