Model Predictive Control of a Three-Phase Two-Level Four-Leg Grid-Connected Converter Based on Sphere Decoding Method

被引:22
|
作者
Long, Bo [1 ]
Cao, Tianxu [1 ]
Fang, Wenting [1 ]
Chong, Kil To [2 ]
Guerrero, Josep M. [3 ]
机构
[1] Univ Elect Sci & Technol China, Inst Elect Vehicle Driving Syst & Safety Technol, Sch Mech & Elect Engn, Chengdu 611731, Peoples R China
[2] Jeonbuk Natl Univ, Dept Elect & Informat Engn, Jeonju 54896, South Korea
[3] Aalborg Univ, Dept Energy Technol, DK-9220 Aalborg, Denmark
基金
中国国家自然科学基金;
关键词
Switches; Decoding; Predictive models; Voltage control; Bridge circuits; Legged locomotion; Cost function (CF); finite-control-set (FCS) model predictive control; node comparison method; three-phase four-leg grid-connected converter (GCC); POWER CONVERTERS; IMPLEMENTATION; DESIGN; MPC;
D O I
10.1109/TPEL.2020.3006432
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To achieve optimal control of four-leg grid-connected converters in terms of switching frequency and current tracking, the finite-control-set model-predictive-control method (FCS-MPC) can be applied. In this method, the cost function (CF) considers tracking control of grid current, filter capacitance voltage, and converter-side current as well as switching frequency before allocating different weights in its calculations. Thus, multiobjective optimization is achieved by trying to find the optimal switching sequence that minimizes the CF. However, as the horizon length is increased, the solution search enlarges exponentially, soon requiring an exhaustive search through each of many candidates. To alleviate this computational burden, this article presents an FCS-MPC method that is based on a new node-comparison sphere decoding method (NC-SDM), thereby reformulating the CF minimization problem into an integral-least-squares problem. The proposed NC-SDM reduces the computational burden associated with longer horizons by excluding as many suboptimal solutions from the candidates as possible. It does this by continuously comparing the length of two paths corresponding to each node of the search tree, and always taking the branch with shorter length. The final length of the total path is set as the initial radius after superposing all the path lengths. As a result, the initial radius estimation is much smaller than that in the Babai method and the computational cost is further reduced. Finally, simulation and experimental results validate the feasibility and suitability of the proposed method.
引用
收藏
页码:2283 / 2297
页数:15
相关论文
empty
未找到相关数据