51. Laguerre based predictors in discrete-time recursive algorithms: A solution for open-loop identification under oversampling
- Author
-
Henri Bourlès, Bernard Vau, Systèmes et Applications des Technologies de l'Information et de l'Energie (SATIE), École normale supérieure - Cachan (ENS Cachan)-Université Paris-Sud - Paris 11 (UP11)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-École normale supérieure - Rennes (ENS Rennes)-Université de Cergy Pontoise (UCP), and Université Paris-Seine-Université Paris-Seine-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
0209 industrial biotechnology ,Basis (linear algebra) ,Computer science ,Open-loop controller ,02 engineering and technology ,Transfer function ,[SPI.AUTO]Engineering Sciences [physics]/Automatic ,Identification (information) ,020901 industrial engineering & automation ,Discrete time and continuous time ,Control and Systems Engineering ,Control theory ,0202 electrical engineering, electronic engineering, information engineering ,Laguerre polynomials ,Oversampling ,020201 artificial intelligence & image processing ,Representation (mathematics) ,ComputingMilieux_MISCELLANEOUS - Abstract
In this paper we propose a novel formulation of the predictor used in open-loop recursive identification algorithms. The predicted output is expressed by means of an orthogonal Laguerre transfer functions basis. This predictor representation presents many advantages: It makes it possible to identify robustly oversampled systems without any bias in low frequency, and to obtain relevant reduced order models. The Laguerre pole plays the role of a tuning parameter enabling the selection of the best approximation frequency area. The proposed schemes address both output error and ARMAX systems. Simulation and experimental results show all the practical benefits provided by these algorithms.
- Published
- 2017