This paper investigates the application of the gradient descent method in moving horizon state estimation for discrete-time nonlinear systems with line-search optimization based on a reduce number of iterations. Conditions guaranteeing the stability of the estimation error are established for single- and multi-iteration schemes to minimize a least-squares cost function based on the most recent batch of information. Numerical results demonstrate the effectiveness of the proposed approaches and highlight the enhanced performance through the combination of descent algorithms and line-search methods.
Gradient-Based Line-Search Optimization for Moving Horizon Estimation
Bouhadjra D.;Gaggero M.
;
2025
Abstract
This paper investigates the application of the gradient descent method in moving horizon state estimation for discrete-time nonlinear systems with line-search optimization based on a reduce number of iterations. Conditions guaranteeing the stability of the estimation error are established for single- and multi-iteration schemes to minimize a least-squares cost function based on the most recent batch of information. Numerical results demonstrate the effectiveness of the proposed approaches and highlight the enhanced performance through the combination of descent algorithms and line-search methods.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ACC2025.pdf
solo utenti autorizzati
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
394.37 kB
Formato
Adobe PDF
|
394.37 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


