Gradient Algorithm in Subspace Predictive Control
Communications · 22.08.2018 · 6 (2) · 39-44
DOI: 10.11648/j.com.20180602.13 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications, online erschienen am 22.08.2018. Verfasst von Wang Xiao-ping und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
In this paper, subspace predictive control strategy is applied to design predictive controller. Given the state space model, the output estimations corresponding to the predictive output is derived to be one explicit function of the measured input-output data. Then using these output estimations, the problem of designing predictive controller is formulated as one optimization problem with equality and inequality conditions. In order to solve this constrain optimization problem, we use dual decomposition idea to change the original constrain optimization problem into an unconstrain optimization problem. So the classical gradient algorithm is put forth to solve the primal dual optimization problem. The problem of designing dual decomposition controller is studied for subspace predictive control strategy under fault condition. For state space equation with fault condition, we establish one function form between fault and residual using only input-output measured data sequence, and construct one least squares optimization problem to obtain fault estimation. The statistical property about residual is analyzed based on our derived output prediction, then the Kronecker product is used to derive the detailed structure corresponding to residual vector at every time instant. After substituting our output prediction into objective function of predictive control, one quadratic programming problem with equality and inequality constraints is considered. For solving this constrained optimization problem, fast gradient method is not suited for this complex optimization problem, as one regularization term is added in our objective function. So in order to solve this complex quadratic optimization problem, we propose a dual decomposition idea so that this dual decomposition idea can convert the former constrained optimization into unconstrained optimization, then one nearest neighbor gradient algorithm is given to solve its optimal value.
Zitieren
APA
Xiao-ping, W., & Jian-hong, W. (2018). Gradient Algorithm in Subspace Predictive Control. Communications, 6(2), 39-44. https://doi.org/10.11648/j.com.20180602.13
Vancouver
Xiao-ping W, Jian-hong W. Gradient Algorithm in Subspace Predictive Control. Communications. 2018;6(2):39-44. doi:10.11648/j.com.20180602.13
BibTeX
@article{Xiaoping2018,
author = {Xiao-ping, Wang and Jian-hong, Wang},
title = {Gradient Algorithm in Subspace Predictive Control},
journal = {Communications},
year = {2018},
volume = {6},
number = {2},
pages = {39--44},
doi = {10.11648/j.com.20180602.13}
}
EUVIMED