SYAug 5, 2018
Towards Efficient Maximum Likelihood Estimation of LPV-SS ModelsPepijn B. Cox, Roland Tóth, Mihály Petreczky
How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable still remains an open question, as identification methods proposed in the literature suffer heavily from the curse of dimensionality and/or depend on over-restrictive approximations of the measured signal behaviors. However, obtaining an SS model of the targeted system is crucial for many LPV control synthesis methods, as these synthesis tools are almost exclusively formulated for the aforementioned representation of the system dynamics. Therefore, in this paper, we tackle the problem by combining state-of-the-art LPV input-output (IO) identification methods with an LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step. The resulting modular LPV-SS identification approach achieves statical efficiency with a relatively low computational load. The method contains the following three steps: 1) estimation of the Markov coefficient sequence of the underlying system using correlation analysis or Bayesian impulse response estimation, then 2) LPV-SS realization of the estimated coefficients by using a basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate from a maximum-likelihood point of view by a gradient-based or an expectation-maximization optimization methodology. The effectiveness of the full identification scheme is demonstrated by a Monte Carlo study where our proposed method is compared to existing schemes for identifying a MIMO LPV system.
SYApr 5, 2018
Affine Parameter-Dependent Lyapunov Functions for LPV Systems with Affine DependencePepijn B. Cox, Siep Weiland, Roland Tóth
This paper deals with the certification problem for robust quadratic stability, robust state convergence, and robust quadratic performance of linear systems that exhibit bounded rates of variation in their parameters. We consider both continuous-time (CT) and discrete-time (DT) parameter-varying systems. In this paper, we provide a uniform method for this certification problem in both cases and we show that, contrary to what was claimed previously, the DT case requires a significantly different treatment compared to the existing CT results. In the established uniform approach, quadratic Lyapunov functions, that are affine in the parameter, are used to certify robust stability, robust convergence rates, and robust performance in terms of linear matrix inequality feasibility tests. To exemplify the procedure, we solve the certification problem for $\mathscr{L}_2$-gain performance both in the CT and the DT cases. A numerical example is given to show that the proposed approach is less conservative than a method with slack variables.
SYSep 23, 2016
Alternative Form of Predictor Based Identification of LPV-SS Models with Innovation NoisePepijn B. Cox, Roland Tóth
In this paper, we present an approach to identify linear parameter-varying (LPV) systems with a state-space (SS) model structure in an innovation form where the coefficient functions have static and affine dependency on the scheduling signal. With this scheme, the curse of dimensionality problem is reduced, compared to existing predictor based LPV subspace identification schemes. The investigated LPV-SS model is reformulated into an equivalent impulse response form, which turns out to be a moving average with exogenous inputs (MAX) system. The Markov coefficient functions of the LPV-MAX representation are multi-linear in the scheduling signal and its time-shifts, contrary to the predictor based schemes where the corresponding LPV auto-regressive with exogenous inputs system is multi-quadratic in the scheduling signal and its time-shifts. In this paper, we will prove that under certain conditions on the input and scheduling signals, the $\ell_2$ loss function of the one-step-ahead prediction error for the LPV-MAX model has only one unique minimum, corresponding to the original underlying system. Hence, identifying the LPV-MAX model in the prediction error minimization framework will be consistent and unbiased. The LPV-SS model is realized by applying an efficient basis reduced Ho-Kalman realization on the identified LPV-MAX model. The performance of the proposed scheme is assessed on a Monte Carlo simulation study.