An algorithm for solving feedback min-max model predictive control for discrete time uncertain linear systems with constraints is presented in the paper. The algorithm solves the corresponding multi-stage min-max linear optimization problem. It is based on applying recursively a decomposition technique to solve the min-max problem via a sequence of low complexity linear programs. It is proved that the algorithm converges to the optimal solution in finite time. Simulation results are provided to compare the proposed algorithm with other approaches. © 2005 IEEE.
A decomposition algorithm for feedback min-max model predictive control
A. BEMPORAD
2005-01-01
Abstract
An algorithm for solving feedback min-max model predictive control for discrete time uncertain linear systems with constraints is presented in the paper. The algorithm solves the corresponding multi-stage min-max linear optimization problem. It is based on applying recursively a decomposition technique to solve the min-max problem via a sequence of low complexity linear programs. It is proved that the algorithm converges to the optimal solution in finite time. Simulation results are provided to compare the proposed algorithm with other approaches. © 2005 IEEE.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
