LPV Updates for Sequentially Linearized Moving Horizon Estimation of Nonlinear Systems

ABSTRACT Moving horizon estimation (MHE) provides high‐precision state estimation for nonlinear systems, but it is often limited by the substantial computational demands of solving a nonlinear optimization problem at every sampling step. To address this issue, we develop an efficient MHE scheme based on linear parameter‐varying (LPV) formulation, where the scheduling parameters are given by the estimated states of the system and used to construct inexact Jacobians. Due to the LPV representation, the Jacobian can be pre‐specified offline in a structured form and then updated in the quadratic programming (QP) subproblem, which reduces the computational cost commonly used in standard nonlinear programming (NLP) systems. We illustrate the performance by numerical simulations.

Authors

Institutions

Publication Details

Journal
PAMM
Published
2026-09-30
DOI
https://doi.org/10.1002/pamm.70238
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

LPV Updates for Sequentially Linearized Moving Horizon Estimation of Nonlinear Systems

Dimitrios S. Karachalios, Jan Heiland, Hossam S. Abbas, Jiaxin Ji
PAMM
Advanced Control Systems Optimization
article

LPV Updates for Sequentially Linearized Moving Horizon Estimation of Nonlinear Systems

Dimitrios S. Karachalios, Jan Heiland, Hossam S. Abbas, Jiaxin Ji
article en

Abstract

ABSTRACT Moving horizon estimation (MHE) provides high‐precision state estimation for nonlinear systems, but it is often limited by the substantial computational demands of solving a nonlinear optimization problem at every sampling step. To address this issue, we develop an efficient MHE scheme based on linear parameter‐varying (LPV) formulation, where the scheduling parameters are given by the estimated states of the system and used to construct inexact Jacobians. Due to the LPV representation, the Jacobian can be pre‐specified offline in a structured form and then updated in the quadratic programming (QP) subproblem, which reduces the computational cost commonly used in standard nonlinear programming (NLP) systems. We illustrate the performance by numerical simulations.

PAMMVol. 26(4)
Technische Universität Ilmenau (DE), Institute for Integrative and Experimental Genomics (DE), University of Lübeck (DE)
Openalex Percentile: Top 56%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.