While local basis function (LBF) estimation algorithms, commonly used for identifying/tracking systems with time-varying parameters, demonstrate good performance under the assumption of normally distributed measurement noise, the estimation results may significantly deviate from satisfactory when the noise distribution is of impulsive nature, for example, heavy-tailed or corrupted by outliers. This paper introduces a computationally efficient method to make LBF estimator robust, enhancing its resistance to impulsive noise. The study illustrates that, for polynomial basis functions, this modified LBF estimator can be computed recursively. Furthermore, it demonstrates that the proposed algorithm can undergo online tuning through parallel estimation and leave-one-out crossvalidation.
Authors
- prof. dr hab. inż. Maciej Niedźwiecki link open in new tab ,
- dr inż. Artur Gańcza link open in new tab ,
- Wojciech Żuławiński,
- Agnieszka Wyłomańska
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1109/cdc56724.2024.10886649
- Category
- Aktywność konferencyjna
- Type
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Language
- angielski
- Publication year
- 2024