Descent algorithms based on the gradient,conjugate gradient, and Newton methods are investigated to perform optimization in moving horizon state estimation for discrete-time linear and nonlinear systems. Conditions that ensure the stability of the estimation error are established for single and multi iteration schemes with a least-squares cost function that takes into account only a batch of most recent information. Simulation results show the effectiveness of the proposed approaches also in comparison with techniques based on the Kalman filter.
Fast moving horizon state estimation for discrete-time systems using single and multi iteration descent methods
Alessandri, Angelo;Gaggero, Mauro
2017-01-01
Abstract
Descent algorithms based on the gradient,conjugate gradient, and Newton methods are investigated to perform optimization in moving horizon state estimation for discrete-time linear and nonlinear systems. Conditions that ensure the stability of the estimation error are established for single and multi iteration schemes with a least-squares cost function that takes into account only a batch of most recent information. Simulation results show the effectiveness of the proposed approaches also in comparison with techniques based on the Kalman filter.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
two_column.pdf
accesso aperto
Tipologia:
Documento in Post-print
Dimensione
933.84 kB
Formato
Adobe PDF
|
933.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.