
Dynamic Programming in Data Driven Model Predictive Control?
Author(s) -
Jianhong Wang
Publication year - 2021
Publication title -
wseas transactions on systems
Language(s) - English
Resource type - Journals
eISSN - 2224-2678
pISSN - 1109-2777
DOI - 10.37394/23202.2021.20.19
Subject(s) - dynamic programming , model predictive control , computer science , mathematical optimization , bellman equation , sequence (biology) , bounded function , optimal control , function (biology) , control theory (sociology) , control (management) , algorithm , mathematics , artificial intelligence , mathematical analysis , evolutionary biology , biology , genetics
In this short note, one data driven model predictive control is studied to design the optimal control sequence. The idea of data driven means the actual output value in cost function for model predictive control is identi_ed through input-output observed data in case of unknown but bounded noise and martingale di_erence sequence. After substituting the identi_ed actual output in cost function, the total cost function in model predictive control is reformulated as the other standard form, so that dynamic programming can be applied directly. As dynamic programming is only used in optimization theory, so to extend its advantage in control theory, dynamic programming algorithm is proposed to construct the optimal control sequence. Furthermore, stability analysis for data drive model predictive control is also given based on dynamic programming strategy. Generally, the goal of this short note is to bridge the dynamic programming, system identi_cation and model predictive control. Finally, one simulation example is used to prove the e_ciency of our proposed theory