scispace - formally typeset
Search or ask a question
Topic

System identification

About: System identification is a research topic. Over the lifetime, 21291 publications have been published within this topic receiving 439142 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, an algorithm for identifying NARMAX models based on radial basis functions from noise-corrupted data is presented. But this algorithm is not suitable for the analysis of a wide class of discrete-time nonlinear systems.
Abstract: A wide class of discrete-time non-linear systems can be represented by the nonlinear autoregressive moving average (NARMAX) model with exogenous inputs. This paper develops a practical algorithm for identifying NARMAX models based on radial basis functions from noise-corrupted data. The algorithm consists of an iterative orthogonal-forward-regression routine coupled with model validity tests. The orthogonal-forward-regression routine selects parsimonious radial-basisTunc-tion models, while the model validity tests measure the quality of fit. The modelling of a liquid level system and an automotive diesel engine are included to demonstrate the effectiveness of the identification procedure.

312 citations

Journal ArticleDOI
TL;DR: This paper introduces a simpler design, termed a jump linear estimator (JLE), to cope with losses, and introduces a special class of JLE, termed finite loss history estimators (FLHE), which uses a canonical gain selection logic.
Abstract: In this paper, we consider estimation with lossy measurements. This problem can arise when measurements are communicated over wireless channels. We model the plant/measurement loss process as a Markovian jump linear system. While the time-varying Kalman estimator (TVKE) is known to be optimal, we introduce a simpler design, termed a jump linear estimator (JLE), to cope with losses. A JLE has predictor/corrector form, but at each time selects a corrector gain from a finite set of precalculated gains. The motivation for the JLE is twofold. The computational burden of the JLE is less than that of the TVKE and the estimation errors expected when using JLE provide an upper bound for those expected when using TVKE. We then introduce a special class of JLE, termed finite loss history estimators (FLHE), which uses a canonical gain selection logic. A notion of optimality for the FLHE is defined and an optimal synthesis method is given. The proposed design method is compared to TVKE in a simulation study.

311 citations

Journal ArticleDOI
TL;DR: The optimal linear estimators including filter, predictor and smoother are developed via an innovation analysis approach based on a packet dropout model and computed recursively in terms of a Riccati difference equation of dimension equal to the order of the system state plus that of the measurement output.

310 citations

Journal ArticleDOI
TL;DR: In this article, the authors deal with equation error methods that fit continuous-time transfer function models to discrete-time data recently included in the CONTSID (CONtinuous-Time System IDentification) Matlab toolbox.
Abstract: This paper deals with equation error methods that fit continuous-time transfer function models to discrete-time data recently included in the CONTSID (CONtinuous-Time System IDentification) Matlab toolbox. An overview of the methods is first given where implementation issues are highlighted. The performances of the methods are then evaluated on simulated examples by Monte Carlo simulations. The experiments have been carried out to study the sensitivity of each approach to the design parameters, sampling period, signal-to-noise ratio, noise power spectral density and type of input signal. The effectiveness of the CONTSID toolbox techniques is also briefly compared with indirect methods in which discrete-time models are first estimated and then transformed into continuous-time models. The paper does not consider iterative or recursive algorithms for continuous-time transfer function model identification.

309 citations

Journal ArticleDOI
01 Aug 2002
TL;DR: A single-layer functional-link ANN in which the need for a hidden layer is eliminated by expanding the input pattern by Chebyshev polynomials, and the performance of the proposed network is found to be similar or superior to that of a MLP.
Abstract: A computationally efficient artificial neural network (ANN) for the purpose of dynamic nonlinear system identification is proposed. The major drawback of feedforward neural networks, such as multilayer perceptrons (MLPs) trained with the backpropagation (BP) algorithm, is that they require a large amount of computation for learning. We propose a single-layer functional-link ANN (FLANN) in which the need for a hidden layer is eliminated by expanding the input pattern by Chebyshev polynomials. The novelty of this network is that it requires much less computation than that of a MLP. We have shown its effectiveness in the problem of nonlinear dynamic system identification. In the presence of additive Gaussian noise, the performance of the proposed network is found to be similar or superior to that of a MLP. A performance comparison in terms of computational complexity has also been carried out.

307 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
93% related
Linear system
59.5K papers, 1.4M citations
92% related
Robustness (computer science)
94.7K papers, 1.6M citations
91% related
Control system
129K papers, 1.5M citations
91% related
Optimization problem
96.4K papers, 2.1M citations
88% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023177
2022361
2021646
2020813
2019804
2018862