Towards Efficient Maximum Likelihood Estimation of LPV-SS Models
Pepijn B. Cox, Roland T\'oth, Mih\'aly Petreczky

TL;DR
This paper presents a modular, efficient maximum likelihood-based approach for identifying LPV-SS models that combines input-output methods, realization, and refinement steps, addressing computational and dimensionality challenges.
Contribution
It introduces a novel LPV-SS identification method that integrates state-of-the-art input-output techniques with realization and maximum likelihood refinement, improving efficiency and accuracy.
Findings
Achieves statistical efficiency with low computational load.
Outperforms existing schemes in Monte Carlo simulations.
Effectively handles high-dimensional LPV system identification.
Abstract
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…
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.
