logo SBA

ETD

Archivio digitale delle tesi discusse presso l’Università di Pisa

Tesi etd-04202015-205301


Tipo di tesi
Tesi di laurea magistrale
Autore
MORABITO, BRUNO
URN
etd-04202015-205301
Titolo
A fast optmization algorithm for Moving Horizon Estimation.
Dipartimento
INGEGNERIA CIVILE E INDUSTRIALE
Corso di studi
INGEGNERIA CHIMICA
Relatori
relatore Dott. Pannocchia, Gabriele
Parole chiave
  • estimation
  • kalman filter
  • optimization
  • nesterov
  • fast gradient
  • moving horizon estimation
  • MHE
Data inizio appello
12/05/2015
Consultabilità
Completa
Riassunto
The Moving Horizon Estimation (MHE) is a technique that allows to estimate the states
of a system considering constraints, either when they are effected by noise or are not
measured. This method can be associated with control techniques such as Model Predictive
Control.
The core of the mathematics formulation of MHE consists of an optimization problem
that can easily become huge as the horizon and the number of states of the system
increase. This leads inevitably to a large computational time that makes dicult the
implementation of the algorithm for on-line purpose. In this work we show through
several simulations on linear random systems that if we assume box constraints on
the states and output noises, we can eciently apply the Nesterov's Fast Gradient
method for solving the optimization problem faster than using the standard optimization
algorithms such as Interior Point Method or Active Set Method.
File