Loading…
A parametric programming approach to moving-horizon state estimation
We propose a solution to moving-horizon state estimation that incorporates inequality constraints in both a systematic and computationally efficient way, akin to Kalman filtering. The proposed method allows the on-line constrained optimization problem involved in moving-horizon state estimation to b...
Saved in:
Published in: | Automatica (Oxford) 2007-05, Vol.43 (5), p.885-891 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We propose a solution to moving-horizon state estimation that incorporates inequality constraints in both a systematic and computationally efficient way, akin to Kalman filtering. The proposed method allows the on-line constrained optimization problem involved in moving-horizon state estimation to be solved offline, requiring only a look-up table and simple function evaluations for real-time implementation. The method is illustrated via simulations on a system that has been studied in literature. |
---|---|
ISSN: | 0005-1098 1873-2836 |
DOI: | 10.1016/j.automatica.2006.11.021 |