Open Research Newcastle
Browse

Fast multistep finite control set model predictive control for transient operation of power converters

Download (425.81 kB)
conference contribution
posted on 2025-05-10, 13:09 authored by Roky Baidya, Ricardo P. Aguilera, Pablo Acuna, Ramón A. Delgado, Tobias Geyer, Daniel Quevedo, Toit Mouton
Recently, an efficient optimization strategy based on the sphere decoding algorithm (SDA) has been proposed to solve the optimal control problem underlying direct model predictive control (MPC) formulations with long horizons. However, as will be elucidated in this work, this optimization algorithm presents some limitations during transient operation of power converters, which increase the execution time required to obtain the optimal solution. To overcome this issue, the present work presents an improved version of the SDA for direct MPC that is not affected by transient operations of the power converter. The key novelty of the proposal is to reduce the execution time of the SDA when the system is in a transient by projecting the unconstrained optimal solution onto the envelope of the original finite control set. As evidenced by the simulation results, the proposed SDA is able to quickly compute the optimal solution for the long-horizon direct MPC during both steady-state and transient operation of the power converter.

History

Source title

Proceedings of the IECON2016 - 42nd Annual Conference of the Industrial Electronics Society

Name of conference

IECON2016 - 42nd Annual Conference of the Industrial Electronics Society

Location

Florence, Italy

Start date

2016-10-24

End date

2016-10-27

Pagination

5039-5045

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Place published

Piscataway, NJ

Language

  • en, English

College/Research Centre

Faculty of Engineering and Built Environment

School

School of Electrical Engineering and Computer Science

Rights statement

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.