Algorithms for online system identification consist in updating the estimated model while data are being collected. A standard method for online identification of structured models is the recursive prediction error method (PEM). The problem is that PEM does not have an exact recursive formulation, and the need to rely on approximations makes recursive PEM prone to convergence problems. In this paper, we propose a recursive implementation of weighted null-space fitting, an asymptotically efficient method for identification of structured models. Consisting only of (weighted) least-squares steps, the recursive version of the algorithm has the same convergence and statistical properties of the off-line version. We illustrate these properties with a simulation study, where the proposed algorithm always attains the performance of the off-line version, while recursive PEM often fails to converge.
展开▼