Moving horizon estimation
From Wikipedia, the free encyclopedia
Moving horizon estimation (MHE) is an optimization approach that uses a series of measurements observed over time, containing noise (random variations) and other inaccuracies, and produces estimates of unknown variables or parameters. Unlike deterministic approaches, MHE requires an iterative approach that relies on linear programming or nonlinear programming solvers to find a solution.[1]
MHE reduces to the Kalman filter under certain simplifying conditions.[2] A critical evaluation of the extended Kalman filter and the MHE found that the MHE improved performance at the cost of increased computational expense.[3] Because of the computational expense, MHE has generally been applied to systems where there are greater computational resources and moderate to slow system dynamics. However, in the literature there are some methods to accelerate this method.[4][5]