An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control

n this technical note, an algorithm for binary quadratic programs defined by matrices with band structure is proposed. It was shown in the article by T. Alamo, D. M. de la Pentildea, D. Limon, and E. F. Camacho, ldquoConstrained min-max predictive control: modifications of the objective function leading to polynomial complexity,rdquo IEEE Tran. Autom. Control , vol. 50, pp. 710-714, May 2005, that this class of problems arise in robust model predictive control when min-max techniques are applied. Although binary quadratic problems belongs to a class of NP-complete problems, the computational burden of the proposed maximization algorithm for band matrices is polynomial with the dimension of the optimization variable and exponential with the band size. Computational results and comparisons on several hundred test problems demonstrate the efficiency of the algorithm

Min–max MPC using a tractable QP problem

Min–max model predictive controllers (MMMPC) suffer from a great computational burden that is often circumvented by using approximate solutions or upper bounds of the worst possible case of a performance index. This paper proposes a computationally efficient MMMPC control strategy in which a close approximation of the solution of the min–max problem is computed using a quadratic programming problem. The overall computational burden is much lower than that of the min–max problem and the resulting control is shown to have a guaranteed stability. A simulation example is given in the paper

Min-Max MPC based on a computationally efficient upper bound of the worst case cost

Min-Max MPC (MMMPC) controllers [P.J. Campo, M. Morari, Robust model predictive control, in: Proc. American Control Conference, June 10–12, 1987, pp. 1021–1026] suffer from a great computational burden which limits their applicability in the industry. Sometimes upper bounds of the worst possible case of a performance index have been used to reduce the computational burden. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound based on a diagonalization scheme. The upper bound can be computed with O(n3) operations and using only simple matrix operations. This implies that the algorithm can be coded easily even in non-mathematical oriented programming languages such as those found in industrial embedded control hardware. A simulation example is given in the paper

Min-max model predictive control as a quadratic program

This paper deals with the implementation of min-max model predictive control for constrained linear systems with bounded additive uncertainties and quadratic cost functions. This type of controller has been shown to be a continuous piecewise affine function of the state vector by geometrical methods. However, no algorithm for computing the explicit solution has been given. In this paper, we show that the min-max optimization problem can be expressed as a multi-parametric quadratic program, and so, the explicit form of the controller may be determined by standard multi-parametric techniques

Model predictive control techniques for hybrid systems

This paper describes the main issues encountered when applying model predictive control to hybrid processes. Hybrid model predictive control (HMPC) is a research field non-fully developed with many open challenges. The paper describes some of the techniques proposed by the research community to overcome the main problems encountered. Issues related to the stability and the solution of the optimization problem are also discussed. The paper ends by describing the results of a benchmark exercise in which several HMPC schemes were applied to a solar air conditioning plant.Ministerio de Eduación y Ciencia DPI2007-66718-C04-01Ministerio de Eduación y Ciencia DPI2008-0581

Offset free data driven control: application to a process control trainer

This work presents a data driven control strategy able to track a set point without steady-state error. The control sequence is computed as an affine combination of past control signals, which belong to a set of trajectories stored in a process historian database. This affine combination is computed so that the variance of the tracking error is minimised. It is shown that offset free control, that is zero mean tracking error, is achieved under the assumption that the state is measurable, the underlying dynamics are linear and the trajectories of the database share the same error dynamics and are in turn offset free. The proposed strategy learns the underlying controller stored in the database while maintaining its offset free tracking capability in spite of differences in the reference, disturbances and operating conditions. No training phase is required and newly obtained process data can be easily taken into account. The proposed strategy, related to direct weight optimisation learning techniques, is tested on a process control trainer.MINECO-Spain and FEDER Funds project DPI2016-76493-C3-1-RUniversity of Seville(Spain) grant 2014/42

MPC for Tracking Periodic References

In this paper a new model predictive controller for tracking arbitrary periodic references is presented. The proposed controller is based on a single layer that unites dynamic trajectory planning and control. A design procedure to guarantee that the closed loop system converges asymptotically to the optimal admissible periodic trajectory while guaranteeing constraint satisfaction is provided. In addition, the constraints of the optimization problem solved by the controller do not depend on the reference, allowing for sudden changes in the reference without loosing feasibility. The properties of the proposed controller are demonstrated with a simulation example of a ball and plate system.MINECO-Spain and FEDER under project DPI2013-48243-C2-2-RUniversity of Seville under contracts 2014/425 and 2014/758European Research Council under the European Unions Seventh Framework Programme (FP/2007- 2013)/ ERC Grant Agreement n. 30760

MPC for tracking periodic reference signals

This paper is devoted to the design of a predictive controller for constrained linear systems to track periodic references. The only assumption on the dynamics of the reference is that it is periodic and its period is known. It is also assumed that the reference signal is a priori known by the controller. Inspired in the hierarchical control scheme based on the trajectory planification, the ideas of the MPC for tracking [Limon et al., 2008] are extended to this case. The proposed predictive controller has the future sequence of inputs and an artificial reference as decision variables. The cost function is divided into two terms: one penalizes the tracking error with the artificial reference and other penalizes the deviation of the artificial reference to the reference to be tracked. Stability is ensured thanks to the addition of two constraints: a terminal constraint on the predicted trajectory and a constraint that enforces the artificial reference to be periodic. It is proved that the proposed controller is recursively feasible and the controlled system satisfies the hard constraints, is asymptotically stable and converges to the best possible reachable trajectory. The properties of the proposed controller are illustrated in an example.Spanish Ministry of Science and Innovation and FEDER DPI2008-05818Spanish Ministry of Science and Innovation and FEDER DPI2010-21589-C05-0