Alternative Form of Predictor Based Identification of LPV-SS Models with Innovation Noise
Pepijn B. Cox, Roland T\'oth

TL;DR
This paper introduces a novel predictor-based LPV-SS model identification method that reduces complexity and ensures consistent, unbiased system estimation using an LPV-MAX reformulation and efficient realization techniques.
Contribution
The paper presents a new LPV-SS identification approach using an LPV-MAX reformulation, improving computational efficiency and theoretical guarantees over existing predictor-based schemes.
Findings
Reduced curse of dimensionality in LPV-SS identification
Unique minimum of the prediction error loss function under certain conditions
Effective realization via basis reduced Ho-Kalman method
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
