Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.13370

Pitfalls of Guaranteeing Asymptotic Stability in LPV Control of Nonlinear Systems

P. J. W. Koelewijn·G. Sales Mazzoccante·R. Tóth·S. Weiland
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently, a number of counter examples have surfaced where Linear Parameter-Varying (LPV) control synthesis applied to achieve asymptotic output tracking and disturbance rejection for a nonlinear system, fails to achieve the desired asymptotic tracking and rejection behavior even when the scheduling variations remain in the bounded region considered during design. It has been observed that the controlled system may exhibit an oscillatory motion around the equilibrium point in the presence of a bounded constant input disturbance even if integral action is present. This work aims at investigating how and why the baseline Lyapunov stability notion, currently widely used in the LPV framework, fails to guarantee the desired system behavior. Specifically, it is shown why the quadratic Lyapunov concept is insufficient to always guarantee asymptotic stability under reference tracking and disturbance rejection scenarios, and why an equilibrium independent stability notion is required for LPV stability analysis and synthesis of controllers. The introduced concepts and the apparent pitfalls are demonstrated via a simulation example.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

P. J. W. Koelewijn, G. Sales Mazzoccante, R. Tóth, S. Weiland. 2020-04-28. Pitfalls of Guaranteeing Asymptotic Stability in LPV Control of Nonlinear Systems. https://doi.org/10.23919/ecc51009.2020.9143810

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY↗
arXiv2026

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY↗
arXiv2026

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY↗