Kernel-Based Regularized Continuous-Time System Identification from Sampled Data

The identification of continuous-time (CT) systems from discrete-time (DT) input and output signals, i.e., the sampled data, has received considerable attention for half a century. The state-of-the-art methods are parametric methods and thus subject to the typical issues of parametric methods. In th...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the IEEE Conference on Decision & Control pp. 4986 - 4991
Main Authors: Fang, Xiaozhu, Mu, Biqiang, Chen, Tianshi
Format: Conference Proceeding
Language:English
Published: IEEE 16.12.2024
Subjects:
Accuracy
Monte Carlo methods
Numerical simulation
Robustness
System identification
ISSN:2576-2370
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The identification of continuous-time (CT) systems from discrete-time (DT) input and output signals, i.e., the sampled data, has received considerable attention for half a century. The state-of-the-art methods are parametric methods and thus subject to the typical issues of parametric methods. In the last decade, a major advance in system identification is the so-called kernel-based regularization method (KRM), which is free of the issues of parametric methods. It is interesting to test the potential of KRM on CT system identification. However, very few results have been reported, mainly because the estimators have no closed forms for general CT input signals, except for some very special cases. In this paper, we show for KRM that the estimators have closed forms when the DT input signal has the typical intersample behavior, i.e., zero-order hold or band-limited, and this paves the way for the application of KRM for CT system identification. Numerical Monte Carlo simulations show that the proposed method is more robust than the state-of-the-art methods and more accurate when the sample size is small.
ISSN:2576-2370
DOI:10.1109/CDC56724.2024.10886385