Abstract
The most powerful unfalsified model (MPUM), i.e., the least complex exact model for the given data, is well established for linear time-invariant (LTI) systems. It has not been generalized for linear parameter-varying (LPV) systems. In order to do this, we define the notions of complexity for LPV systems with shifted-affine scheduling dependence. The MPUM leads to identifiability conditions and a method for exact LPV system identification. The method is based on lifting the LPV system to a higher dimensional space and LTI embedding in the lifted space. It is made rigorous by proving a formal connection between the parameters of the LTI embedding and the original LPV system.
| Original language | English |
|---|---|
| Article number | 112855 |
| Number of pages | 5 |
| Journal | Automatica |
| Volume | 186 |
| Early online date | 2 Feb 2026 |
| DOIs | |
| Publication status | E-pub ahead of print - 2 Feb 2026 |
Bibliographical note
Publisher Copyright:© 2026 Elsevier Ltd
Fingerprint
Dive into the research topics of 'The most powerful unfalsified linear parameter-varying model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver