Low-complexity digital architecture for solving the point location problem in explicit Model Predictive Control

2015 ◽  
Vol 352 (6) ◽  
pp. 2249-2258 ◽  
Author(s):  
Alberto Oliveri ◽  
Christian Gianoglio ◽  
Edoardo Ragusa ◽  
Marco Storace
Author(s):  
Mike Huang ◽  
Ken Butts ◽  
Ilya Kolmanovsky

This paper describes a gain scheduling strategy that can be used in conjunction with explicit Model “Predictive Control (MPC). Traditionally, explicit MPC is not reconfigurable to online model changes. To handle off-nominal plant conditions, a common practice is to design multiple explicit MPC’s which are each valid locally around their respective operating points. This inevitably requires large amounts of memory to store the explicit MPC’s and implementation of switching logic and observers. The gain scheduling strategy presented in this paper bypasses the need to store multiple explicit MPC’s. This is done by multiplying the control signal obtained from the nominal explicit MPC by a gain scheduling matrix such that the plant at off-nominal operating conditions is approximately matched to the nominal plant. This is further accomplished in a manner such that the original control constraints are satisfied. The gain scheduling strategy is demonstrated in simulations on a nonlinear diesel air path model over the New European Drive Cycle (NEDC).


Sign in / Sign up

Export Citation Format

Share Document