logo SBA

ETD

Digital archive of theses discussed at the University of Pisa

 

Thesis etd-04202015-205301


Thesis type
Tesi di laurea magistrale
URN
etd-04202015-205301
Thesis title
A fast optmization algorithm for Moving Horizon Estimation.
Department
INGEGNERIA CIVILE E INDUSTRIALE
Course of study
INGEGNERIA CHIMICA
Supervisors
.
relatore Dott. Pannocchia, Gabriele
Keywords
  • estimation
  • fast gradient
  • kalman filter
  • MHE
  • moving horizon estimation
  • nesterov
  • optimization
Graduation session start date
12/05/2015
Availability
Full
Abstract (Inglese)
Abstract (Italiano)
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 difficult 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 efficiently 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