Efficient algorithms for trading off feasibility and performance in predictive control
JA Rossiter, L Wang… - International Journal of …, 2010 - Taylor & Francis
JA Rossiter, L Wang, G Valencia-Palomo
International Journal of Control, 2010•Taylor & FrancisThis article introduces two simple modifications to conventional predictive control algorithms
with the aim of enlarging the feasible regions without increasing computational complexity. It
is shown that despite the relatively large feasibility gains, the loss in performance may be far
smaller than expected and thus the algorithms give mechanisms for achieving low
computational loads with good feasibility and good performance while using a simple
algorithm set-up. Both algorithms have standard convergence and feasibility guarantees.
with the aim of enlarging the feasible regions without increasing computational complexity. It
is shown that despite the relatively large feasibility gains, the loss in performance may be far
smaller than expected and thus the algorithms give mechanisms for achieving low
computational loads with good feasibility and good performance while using a simple
algorithm set-up. Both algorithms have standard convergence and feasibility guarantees.
This article introduces two simple modifications to conventional predictive control algorithms with the aim of enlarging the feasible regions without increasing computational complexity. It is shown that despite the relatively large feasibility gains, the loss in performance may be far smaller than expected and thus the algorithms give mechanisms for achieving low computational loads with good feasibility and good performance while using a simple algorithm set-up. Both algorithms have standard convergence and feasibility guarantees.
Taylor & Francis Online以上显示的是最相近的搜索结果。 查看全部搜索结果