By Topic

Complexity reduction in MPC for stochastic max-plus-linear systems by variability expansion

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
$31 $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

3 Author(s)
van den Boom, T.J.J. ; Fac. of Inf. Technol. & Syst., Delft Univ. of Technol., Netherlands ; De Schutter, B. ; Heidergott, B.

Model predictive control (MPC) is a popular controller design technique in the process industry. Conventional MPC uses linear or nonlinear discrete-time models. Previously, we have extended MPC to a class of discrete event systems that can be described by a model that is "linear" in the max-plus algebra. In our previous work we have considered MPC for the perturbations-free case and for the case with noise and/or modeling errors in a bounded or stochastic setting. In this paper we consider a method to reduce the computational complexity of the resulting optimization problem, based on variability expansion. We show that the computational load is reduced if we decrease the level of 'randomness' in the system.

Published in:

Decision and Control, 2002, Proceedings of the 41st IEEE Conference on  (Volume:3 )

Date of Conference:

10-13 Dec. 2002