Robust analysis for data-driven model predictive control

Here the idea of data driven is introduced in model predictive control to establish our proposed data-driven model predictive control. Considering one first-order discrete time nonlinear dynamical system, the main essence of data driven means the actual output value in cost function for model predic...

Full description

Bibliographic Details
Main Authors: Hong Jianwang, Ricardo A. Ramirez-Mendoza, Tang Xiaojun
Format: Article
Language:English
Published: Taylor & Francis Group 2021-01-01
Series:Systems Science & Control Engineering
Subjects:
Online Access:http://dx.doi.org/10.1080/21642583.2021.1916788
id doaj-60f7d9575b7c49f4bd5e21579a0c71e3
record_format Article
spelling doaj-60f7d9575b7c49f4bd5e21579a0c71e32021-05-06T16:05:14ZengTaylor & Francis GroupSystems Science & Control Engineering2164-25832021-01-019139340410.1080/21642583.2021.19167881916788Robust analysis for data-driven model predictive controlHong Jianwang0Ricardo A. Ramirez-Mendoza1Tang Xiaojun2School of Electronic Engineering and Automation, Jiangxi University of Science and TechnologySchool of Engineering and Sciences, Tecnologico de MonterreySchool of Electronic Engineering and Automation, Jiangxi University of Science and TechnologyHere the idea of data driven is introduced in model predictive control to establish our proposed data-driven model predictive control. Considering one first-order discrete time nonlinear dynamical system, the main essence of data driven means the actual output value in cost function for model predictive control is identified through input–output observed data in case of unknown but bounded noise and martingale difference sequence. After substituting the identified actual output in cost function, the total cost function in model predictive control is reformulated as its standard form, i.e. one quadratic program problem with input and output constraints. Then semidefinite relaxation scheme is used to derive a lower bound for its optimal value, and the robust counterpart of an uncertain quadratic program is reduced to one conic quadratic problem. The above semidefinite relaxation scheme and conic quadratic problem correspond to the similar robust analysis based on convex optimization theory. Finally, one simulation example is used to prove the efficiency of our proposed theory.http://dx.doi.org/10.1080/21642583.2021.1916788model predictive controldata drivennonlinear estimationrobust analysis
collection DOAJ
language English
format Article
sources DOAJ
author Hong Jianwang
Ricardo A. Ramirez-Mendoza
Tang Xiaojun
spellingShingle Hong Jianwang
Ricardo A. Ramirez-Mendoza
Tang Xiaojun
Robust analysis for data-driven model predictive control
Systems Science & Control Engineering
model predictive control
data driven
nonlinear estimation
robust analysis
author_facet Hong Jianwang
Ricardo A. Ramirez-Mendoza
Tang Xiaojun
author_sort Hong Jianwang
title Robust analysis for data-driven model predictive control
title_short Robust analysis for data-driven model predictive control
title_full Robust analysis for data-driven model predictive control
title_fullStr Robust analysis for data-driven model predictive control
title_full_unstemmed Robust analysis for data-driven model predictive control
title_sort robust analysis for data-driven model predictive control
publisher Taylor & Francis Group
series Systems Science & Control Engineering
issn 2164-2583
publishDate 2021-01-01
description Here the idea of data driven is introduced in model predictive control to establish our proposed data-driven model predictive control. Considering one first-order discrete time nonlinear dynamical system, the main essence of data driven means the actual output value in cost function for model predictive control is identified through input–output observed data in case of unknown but bounded noise and martingale difference sequence. After substituting the identified actual output in cost function, the total cost function in model predictive control is reformulated as its standard form, i.e. one quadratic program problem with input and output constraints. Then semidefinite relaxation scheme is used to derive a lower bound for its optimal value, and the robust counterpart of an uncertain quadratic program is reduced to one conic quadratic problem. The above semidefinite relaxation scheme and conic quadratic problem correspond to the similar robust analysis based on convex optimization theory. Finally, one simulation example is used to prove the efficiency of our proposed theory.
topic model predictive control
data driven
nonlinear estimation
robust analysis
url http://dx.doi.org/10.1080/21642583.2021.1916788
work_keys_str_mv AT hongjianwang robustanalysisfordatadrivenmodelpredictivecontrol
AT ricardoaramirezmendoza robustanalysisfordatadrivenmodelpredictivecontrol
AT tangxiaojun robustanalysisfordatadrivenmodelpredictivecontrol
_version_ 1721456492174901248