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

M Gaggero
2017

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.
2017
Istituto di Studi sui Sistemi Intelligenti per l'Automazione - ISSIA - Sede Bari
Istituto di iNgegneria del Mare - INM (ex INSEAN)
Moving horizon
State estimation
Gradient method
Conjugate gradient method
Newton method
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/326116
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 51
  • ???jsp.display-item.citation.isi??? ND
social impact