Complexity Reduction in MPC for Stochastic Max-Plus-Linear Systems by
Variability Expansion
Reference
T.J.J. van den Boom,
B. De Schutter, and
B. Heidergott,
"Complexity Reduction in MPC for Stochastic Max-Plus-Linear Systems by
Variability Expansion," Proceedings of the 41st IEEE
Conference on Decision and Control, Las Vegas, Nevada, pp.
3567-3572, Dec. 2002.
Abstract
Model predictive control (MPC) is a popular controller design
technique in the process industry. Conventional MPC uses linear or
nonlinear discrete-time models. Recently, 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.
Downloads
- Corresponding technical report:
pdf
file
(307 KB)
Bibtex entry
@inproceedings{vanDeS:02-007,
author={T.J.J. van den Boom and B. {D}e Schutter and B. Heidergott},
title={Complexity Reduction in {MPC} for Stochastic Max-Plus-Linear Systems by
Variability Expansion},
booktitle={Proceedings of the 41st IEEE Conference on Decision and Control},
address={Las Vegas, Nevada},
pages={3567--3572},
month=dec,
year={2002}
}
This page is maintained by Bart De Schutter.
Last update: February 21, 2026.