By Topic

An adaptive multiscale method for real-time moving horizon optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
T. Binder ; Lehrstuhl fur Prozesstech., Tech. Hochschule Aachen, Germany ; L. Blank ; W. Dahmen ; W. Marquardt

We explore an adaptive discretization scheme for dynamic optimization problems formulated on moving horizons. The proposed method is embedded into a solution methodology where the dynamic optimization problem is approximated by a hierarchy of successively refined finite dimensional problems. Information on the solution of the coarser approximations is used to initialize the employed NLP solver and to construct a fully adaptive, problem dependent discretization where the finite dimensional spaces are spanned by biorthogonal wavelets arising from B-splines. We demonstrate exemplarily that the proposed strategy is capable to identify accurate discretization meshes which are more economical than uniform meshes with respect to the ratio of approximation quality vs. the number of trial functions used

Published in:

American Control Conference, 2000. Proceedings of the 2000  (Volume:6 )

Date of Conference: