A computationally low burden MPTC of induction machine without prediction loop and weighting factor
This paper presents a novel method to overcome problems of finite set-model-based predictive torque control (MPTC) which has received a lot of attention in the last two decades. Tuning the weighting factor, evaluating a large number of switching states in the loop of the predictive control, and dete...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Polish Academy of Sciences
2022-08-01
|
Series: | Bulletin of the Polish Academy of Sciences: Technical Sciences |
Subjects: | |
Online Access: | https://journals.pan.pl/Content/124022/PDF/3092_BPASTS_2022_70_4.pdf |
_version_ | 1817985805310754816 |
---|---|
author | Babak Kiani |
author_facet | Babak Kiani |
author_sort | Babak Kiani |
collection | DOAJ |
description | This paper presents a novel method to overcome problems of finite set-model-based predictive torque control (MPTC) which has received a lot of attention in the last two decades. Tuning the weighting factor, evaluating a large number of switching states in the loop of the predictive control, and determining the duty cycle are three major challenges of the regular techniques. Torque and flux responses of deadbeat control have been developed to overcome these problems. In our method, firstly, the prediction stage is performed just once. Then, both the weighted cost function and its evaluation are replaced with only simple relationships. The relationships reduce torque ripple and THD of stator current compromisingly. In the next step, the length of the virtual vector is used to determine the duty cycle of the optimum voltage vector without any additional computations. The duty ratio does not focus on any relation or criteria minimizing torque or flux ripple. As a result, torque and flux ripples are reduced equally. The proposed duty cycle is calculated by using a predicted virtual voltage vector. Hence, no new computation is needed to determine the proposed duty cycle. Simulation and experimental results confirm both the steady and dynamic performance of the proposed method in all speed ranges. |
first_indexed | 2024-04-14T00:02:36Z |
format | Article |
id | doaj.art-ec38e0eb441e45a69caa28e2bf5496dc |
institution | Directory Open Access Journal |
issn | 2300-1917 |
language | English |
last_indexed | 2024-04-14T00:02:36Z |
publishDate | 2022-08-01 |
publisher | Polish Academy of Sciences |
record_format | Article |
series | Bulletin of the Polish Academy of Sciences: Technical Sciences |
spelling | doaj.art-ec38e0eb441e45a69caa28e2bf5496dc2022-12-22T02:23:40ZengPolish Academy of SciencesBulletin of the Polish Academy of Sciences: Technical Sciences2300-19172022-08-01704https://doi.org/10.24425/bpasts.2022.142050A computationally low burden MPTC of induction machine without prediction loop and weighting factorBabak Kiani0Department of Electrical Engineering, Izeh Branch, Islamic Azad University, Izeh, IranThis paper presents a novel method to overcome problems of finite set-model-based predictive torque control (MPTC) which has received a lot of attention in the last two decades. Tuning the weighting factor, evaluating a large number of switching states in the loop of the predictive control, and determining the duty cycle are three major challenges of the regular techniques. Torque and flux responses of deadbeat control have been developed to overcome these problems. In our method, firstly, the prediction stage is performed just once. Then, both the weighted cost function and its evaluation are replaced with only simple relationships. The relationships reduce torque ripple and THD of stator current compromisingly. In the next step, the length of the virtual vector is used to determine the duty cycle of the optimum voltage vector without any additional computations. The duty ratio does not focus on any relation or criteria minimizing torque or flux ripple. As a result, torque and flux ripples are reduced equally. The proposed duty cycle is calculated by using a predicted virtual voltage vector. Hence, no new computation is needed to determine the proposed duty cycle. Simulation and experimental results confirm both the steady and dynamic performance of the proposed method in all speed ranges.https://journals.pan.pl/Content/124022/PDF/3092_BPASTS_2022_70_4.pdfmptcinduction motorduty ratiovoltage vectorlook-up tableweighting factor |
spellingShingle | Babak Kiani A computationally low burden MPTC of induction machine without prediction loop and weighting factor Bulletin of the Polish Academy of Sciences: Technical Sciences mptc induction motor duty ratio voltage vector look-up table weighting factor |
title | A computationally low burden MPTC of induction machine without prediction loop and weighting factor |
title_full | A computationally low burden MPTC of induction machine without prediction loop and weighting factor |
title_fullStr | A computationally low burden MPTC of induction machine without prediction loop and weighting factor |
title_full_unstemmed | A computationally low burden MPTC of induction machine without prediction loop and weighting factor |
title_short | A computationally low burden MPTC of induction machine without prediction loop and weighting factor |
title_sort | computationally low burden mptc of induction machine without prediction loop and weighting factor |
topic | mptc induction motor duty ratio voltage vector look-up table weighting factor |
url | https://journals.pan.pl/Content/124022/PDF/3092_BPASTS_2022_70_4.pdf |
work_keys_str_mv | AT babakkiani acomputationallylowburdenmptcofinductionmachinewithoutpredictionloopandweightingfactor AT babakkiani computationallylowburdenmptcofinductionmachinewithoutpredictionloopandweightingfactor |