Long-horizon Direct Model Predictive Control Research Articles

Long-Horizon Direct Model Predictive Control for Power Converters With State Constraints

Long-Horizon Direct Model Predictive Control for Power Converters With State Constraints

Long-Horizon Robust Direct Model Predictive Control for Medium-Voltage Induction Motor Drives With Reduced Computational Complexity

This paper proposes a long-horizon direct model predictive control (MPC) with reference tracking for medium-voltage (MV) drives that achieves favorable steady-state and transient behavior. However, as MPC is a model-based method, it is susceptible to parameter mismatches and variations of the machine. Moreover, even though a long prediction horizon significantly improves the steady-state behavior of the drive, it significantly increases the computational complexity of the direct MPC problem, rendering its real-time implementation a challenging—if not impossible—task. Motivated by these shortcomings of long-horizon direct MPC, this paper also aims to address them by enhancing the robustness of the developed control strategy, while keeping its computational complexity modest. To achieve the former, a prediction model suitable for MV drive systems is adopted that facilitates the effective estimation of the total leakage inductance of the machine. For the latter, the objective function of the MPC problem is formulated such that, even though the drive behavior is computed over a long prediction interval, only a few changes in the candidate switch positions are considered. The effectiveness of the proposed modeling, control, and estimation approaches is validated with hardware-in-the-loop (HIL) tests for an MV drive consisting of a three-level neutral point clamped (NPC) inverter and an induction machine (IM).

Long-Horizon Direct Model Predictive Control: Modified Sphere Decoding for Transient Operation

In this paper, we present modifications to the sphere decoder initially introduced in the work of Geyer and Quevedo and modified in the work of Karamanakos et al. that significantly reduce the computation times during transients. The relative position of the unconstrained solution of the integer quadratic program underlying model predictive control (MPC) with respect to the convex hull of the (truncated) lattice of integer points is examined. If it is found that the unconstrained solution does not lie within the convex hull—a phenomenon that is observed mostly during transients—then a projection is performed onto the convex hull. By doing so, a new sphere that guarantees feasibility and includes a significant smaller number of candidate solutions is computed. This reduces the computation time by up to three orders of magnitude when solving the optimization problem at hand. Nonetheless, the reduction of the computational burden comes at a cost of (mild) suboptimal results. The effectiveness of the proposed algorithm is tested with a variable speed drive system consisting of a three-level neutral point clamped voltage source inverter and a medium-voltage induction machine. Based on the presented results, the sphere decoding algorithm with the proposed refinements maintains the very fast transient responses inherent to direct MPC. Moreover, it is observed that the occasional implementation of suboptimal solutions does not lead to a deterioration of the system performance.