Abstract

This paper is concerned with guaranteed parameter estimation in nonlinear dynamic systems in a context of bounded measurement error. The problem consists of finding—or approximating as closely as possible—the set of all possible parameter values such that the predicted outputs match the corresponding measurements within prescribed error bounds. An exhaustive search procedure is applied, whereby the parameter set is successively partitioned into smaller boxes and exclusion tests are performed to eliminate some of these boxes, until a prespecified threshold on the approximation level is met. In order to enhance the convergence of this procedure, we investigate the use of optimization-based domain reduction techniques for tightening the parameter boxes before partitioning. We construct such bound-reduction problems as linear programs from the polyhedral relaxation of Taylor models of the predicted outputs. When applied to a simple case study, the proposed approach is found to reduce the computational burden significantly, both in terms of CPU time and number of iterations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call