.png){kind=icon}
Return
Adaptive regularised kernel-based identification method for large-scale systems with unknown order
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2022.110437.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Regularised kernel-based identification methods are widely used for large-scale systems with the aim of reducing high parameter estimation variances. Classical diagonal and diagonal/correlated methods are used to design a kernel matrix under the assumption that the parameter series decays exponentially. This assumption has the following limitations: (1) if the system has an unknown time-delay/order, some irregular parameter sub-vectors are equal to zero vectors; (2) if the parameters have random structures, the parameter series does not decay exponentially. To address these limitations, an adaptive regularised kernel-based method is developed in this study. The basic idea is to set the values of diagonal elements of the kernel matrix based on the inner products between the output set and information vectors. Ultimately, the objective is to guarantee that a larger parameter corresponds to a smaller diagonal element. The proposed method can identify large-scale systems with high estimation accuracy. Simulation results demonstrate the effectiveness of the proposed method. (C) 2022 Elsevier Ltd. All rights reserved.
Keywords:
System identification
Large-scale system
Kernel matrix
Adaptive regularised kernel method
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
ShareSaveShareSaveOn the estimation of transfer functions, regularizations and Gaussian processes-Revisited.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveA novel reduced-order algorithm for rational models based on Arnoldi process and Krylov subspaceAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSaveOn asymptotic properties of hyperparameter estimators for kernel-based regularization methodsAUTOMATICAOAAI
AUTOMATICAIF5.9
OAAIShareSave
View more