The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 하이브리드 시스템의 시변 참조를 사용하여 모델 예측 제어(MPC) 문제에 대한 새로운 근사 알고리즘을 제안합니다. 제안하는 알고리즘은 오프라인 계산과 온라인 계산으로 구성된다. 오프라인 계산에서는 모드 시퀀스의 후보가 도출됩니다. 온라인 계산에서는 후보들 사이에서 모드 순서가 고유하게 결정된 후 유한시간 최적 제어 문제, 즉 2차 계획법 문제가 해결됩니다. 따라서 제안한 알고리즘을 적용함으로써 온라인 연산의 연산량을 감소시킨다. 먼저, 시변 기준을 갖는 MPC 문제가 공식화됩니다. 다음으로 제안된 알고리즘을 설명하고, 도출된 근사해의 정확도에 대해 논의한다. 마지막으로 제안한 방법의 유효성을 수치예를 통해 보여준다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Koichi KOBAYASHI, Kunihiko HIRAISHI, Nguyen Van TANG, "Approximate Algorithm for Hybrid Model Predictive Control with Time-Varying Reference" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 8, pp. 2046-2052, August 2009, doi: 10.1587/transfun.E92.A.2046.
Abstract: In this paper, we propose a new approximate algorithm for the model predictive control (MPC) problem with a time-varying reference of hybrid systems. The proposed algorithm consists of an offline computation and an online computation. In the offline computation, candidates of mode sequences are derived. In the online computation, after the mode sequence is uniquely decided among candidates, the finite-time optimal control problem, i.e., the quadratic programming problem, is solved. So by applying the proposed algorithm, the computational amount of the online computation is decreased. First, the MPC problem with a time-varying reference is formulated. Next, the proposed algorithm is explained, and the accuracy of the obtained approximate solution is discussed. Finally, the effectiveness of the proposed method is shown by a numerical example.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2046/_p
부
@ARTICLE{e92-a_8_2046,
author={Koichi KOBAYASHI, Kunihiko HIRAISHI, Nguyen Van TANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Approximate Algorithm for Hybrid Model Predictive Control with Time-Varying Reference},
year={2009},
volume={E92-A},
number={8},
pages={2046-2052},
abstract={In this paper, we propose a new approximate algorithm for the model predictive control (MPC) problem with a time-varying reference of hybrid systems. The proposed algorithm consists of an offline computation and an online computation. In the offline computation, candidates of mode sequences are derived. In the online computation, after the mode sequence is uniquely decided among candidates, the finite-time optimal control problem, i.e., the quadratic programming problem, is solved. So by applying the proposed algorithm, the computational amount of the online computation is decreased. First, the MPC problem with a time-varying reference is formulated. Next, the proposed algorithm is explained, and the accuracy of the obtained approximate solution is discussed. Finally, the effectiveness of the proposed method is shown by a numerical example.},
keywords={},
doi={10.1587/transfun.E92.A.2046},
ISSN={1745-1337},
month={August},}
부
TY - JOUR
TI - Approximate Algorithm for Hybrid Model Predictive Control with Time-Varying Reference
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2046
EP - 2052
AU - Koichi KOBAYASHI
AU - Kunihiko HIRAISHI
AU - Nguyen Van TANG
PY - 2009
DO - 10.1587/transfun.E92.A.2046
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2009
AB - In this paper, we propose a new approximate algorithm for the model predictive control (MPC) problem with a time-varying reference of hybrid systems. The proposed algorithm consists of an offline computation and an online computation. In the offline computation, candidates of mode sequences are derived. In the online computation, after the mode sequence is uniquely decided among candidates, the finite-time optimal control problem, i.e., the quadratic programming problem, is solved. So by applying the proposed algorithm, the computational amount of the online computation is decreased. First, the MPC problem with a time-varying reference is formulated. Next, the proposed algorithm is explained, and the accuracy of the obtained approximate solution is discussed. Finally, the effectiveness of the proposed method is shown by a numerical example.
ER -