Computation-Efficient Model Predictive Control Using Sphere Decoding Algorithm for DTP-PMSMs

Extending the prediction horizon for finite control set model predictive control (FCS-MPC) has shown its advantages on steady-state performance and current distortions. However, its inherently high computational burden brought barriers to implement. Hence, a scheme of sphere decoding algorithm-MPC (...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on magnetics Jg. 60; H. 10; S. 1 - 5
Hauptverfasser: Chen, Jian, Zhang, Zhen, Niu, Zhenyong, Zeng, Shunqi, Han, Ruixue, Wu, Yitong, Chang, Siyuan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.10.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0018-9464, 1941-0069
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Extending the prediction horizon for finite control set model predictive control (FCS-MPC) has shown its advantages on steady-state performance and current distortions. However, its inherently high computational burden brought barriers to implement. Hence, a scheme of sphere decoding algorithm-MPC (SDA-MPC) with preliminary election is proposed for the calculation efficiency and harmonic suppression. The experimental prototype is developed and implemented for dual three phase permanent magnet synchronous motor (DTP-PMSM). Experimental results well agree with the theoretical analysis. In particular, the proposed SDA-MPC scheme significantly reduced the average turnaround time by 21% compared with the exhaustive search algorithm (ESA) under the single step. Moreover, it reduced the ripple in x-y subspace by 14% compared with the conventional SDA with whole control set.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9464
1941-0069
DOI:10.1109/TMAG.2024.3427690