Model Predictive Control is a receding control approach, that basically does online dynamic optmisation on a finite horizon while implementing online, the first control optimal action of the control sequence. The online dynamic optimisation is repeated based on the measure system states with a sliding finite-horizon window.

However, can't we say that in principle due to the finite-horizon nature of MPC, the solution result obtains does not guarantee global optimality in the infinite horizon time scale as the control sequence found between A-B will not be necessarily optimal if the horizon A to C (A-B-C) was considered ? It seems to be some kind of corrective greedy search where the best control sequence at any branch is selected and because the control sequence is not fully implemented at the finite horizon, there is a possibility for escaping a bit the danger of the greedy search at the next iteration?

More Yves Matanga's questions See All
Similar questions and discussions