Implementation of stabilizing receding horizon controls for time-varying systems

In this paper, a new stabilizing receding horizon control (RHC) scheme is proposed for linear discrete time-varying systems, which can be easily implemented by using linear matrix inequality (LMI) optimization. The control scheme is based on the minimization of the finite horizon cost with a finite terminal weighting matrix. The resulting stabilizing RHC scheme leads to time-varying finite terminal weighting matrices even for time-invariant systems, which is more general than in the case of using constant matrices. Based on the proposed scheme, another implementation method is also discussed for easy computation and numerical feasibility consideration of LMI optimization, although the second method does not guarantee the closed-loop stability theoretically. Through a simulation example, the effectiveness of the proposed schemes is illustrated.     

Robust MPC for the constrained system with polytopic uncertainty

An improved method for synthesising the constrained robust model predictive controller is proposed in this study. It constructs a continuum of terminal constraint sets off-line, and achieves robust stability with a variable control horizon on-line from the very beginning and a time-varying terminal constraint set, by solving the min–max optimisation problem, which can be formulated as a linear matrix inequality problem. This algorithm not only dramatically reduces the on-line computation burden, but also guarantees the control performance by reserving at least one free control move in the whole process. Simulation results for the three-tank system with uncertain dynamic behaviour on flux coefficients are given.     

On Stability of Constrained Receding Horizon Control with Finite Terminal Weighting Matrix

In this paper, a new stabilizing receding horizon control, based on a finite input and state horizon cost with a finite terminal weighting matrix, is proposed for time-varying discrete linear systems with constraints. We propose matrix inequality conditions on the terminal weighting matrix under which closed-loop stability is guaranteed for both cases of unconstrained and constrained systems with input and state constraints. We show that such a terminal weighting matrix can be obtained by solving a linear matrix inequality (LMI). In the case of constrained time-invariant systems, an artificial invariant ellipsoid constraint is introduced in order to relax the conventional terminal equality constraint and to handle constraints. Using the invariant ellipsoid constraints, a feasibility condition of the optimization problem is presented and a region of attraction is characterized for constrained systems with the proposed receding horizon control.     

The explicit linear quadratic regulator for constrained systems

For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimizes a quadratic performance criterion. We show that the control law is piece-wise linear and continuous for both the finite horizon problem (model predictive control) and the usual infinite time measure (constrained linear quadratic regulation). Thus, the on-line control computation reduces to the simple evaluation of an explicitly defined piecewise linear function. By computing the inherent underlying controller structure, we also solve the equivalent of the Hamilton-Jacobi-Bellman equation for discrete-time linear constrained systems. Control based on on-line optimization has long been recognized as a superior alternative for constrained systems. The technique proposed in this paper is attractive for a wide range of practical problems where the computational complexity of on-line optimization is prohibitive. It also provides an insight into the structure underlying optimization-based controllers.     

Adaptive model predictive control for a class of constrained linear systems based on the comparison model

This paper proposes an adaptive model predictive control (MPC) algorithm for a class of constrained linear systems, which estimates system parameters on-line and produces the control input satisfying input/state constraints for possible parameter estimation errors. The key idea is to combine the robust MPC method based on the comparison model with an adaptive parameter estimation method suitable for MPC. To this end, first, a new parameter update method based on the moving horizon estimation is proposed, which allows to predict an estimation error bound over the prediction horizon. Second, an adaptive MPC algorithm is developed by combining the on-line parameter estimation with an MPC method based on the comparison model, suitably modified to cope with the time-varying case. This method guarantees feasibility and stability of the closed-loop system in the presence of state/input constraints. A numerical example is given to demonstrate its effectiveness.     

Move blocked model predictive control with improved optimality using semi-explicit approach for applying time-varying blocking structure

Move blocking is an input parameterization scheme that fixes the decision variables over arbitrary time intervals, commonly referred to as blocks, and it is widely implemented in model predictive control (MPC) to reduce the computational load during on-line optimization. Since the blocking position acts as the search direction in the solution space, selection of the blocking structure has a significant effect on the optimality of moved blocked MPC. However, existing move blocked MPC schemes apply arbitrary time-invariant blocking structures without considering the optimality of the blocking structure due to the difficulty in deriving a proper time-varying blocking structure on-line. Thus, we propose a semi-explicit approach for move blocked MPC that solves a multiparametric program for the blocking position set off-line and a simplified on-line optimization problem. This approach allows for a proper time-varying blocking structure for the current state on-line. The proposed approach can efficiently improve the optimality performance of move blocked MPC with only a little additional computational cost for critical region search while guaranteeing the recursive feasibility and closed-loop stability.     

Disturbance attenuation for constrained discrete-time systems via receding horizon controls

In this note, we propose new receding horizon H/sub /spl infin// control (RHHC) schemes for linear input-constrained discrete time-invariant systems with disturbances. The proposed control schemes are based on the dynamic game problem of a finite-horizon cost function with a fixed finite terminal weighting matrix and a one-horizon cost function with time-varying finite terminal weighting matrices, respectively. We show that the resulting RHHCs guarantee closed-loop stability in the absence of disturbances and H/sub /spl infin// norm bound for 2-norm bounded disturbances. We also show that the proposed schemes can easily be implemented via linear matrix inequality optimization. We illustrate the effectiveness of the proposed schemes through simulations.     

Model predictive control of constrained LPV systems

This article considers robust model predictive control (MPC) schemes for linear parameter varying (LPV) systems in which the time-varying parameter is assumed to be measured online and exploited for feedback. A closed-loop MPC with a parameter-dependent control law is proposed first. The parameter-dependent control law reduces conservativeness of the existing results with a static control law at the cost of higher computational burden. Furthermore, an MPC scheme with prediction horizon ‘1’ is proposed to deal with the case of asymmetric constraints. Both approaches guarantee recursive feasibility and closed-loop stability if the considered optimisation problem is feasible at the initial time instant.     

Numerical optimization method for HJI equations derived from robust receding horizon control schemes and controller design

This paper addresses how to numerically solve the Hamilton-Jacobin-Isaac(HJI)equations derived from the robust receding horizon control schemes.The developed numerical method,the finite dierence scheme with sigmoidal transformation,is a stable and convergent algorithm for HJI equations.A boundary value iteration procedure is developed to increase the calculation accuracy with less time consumption.The obtained value function can be applied to the robust receding horizon controller design of some kind of uncertain nonlinear systems.In the controller design,the finite time horizon is extended into the infinite time horizon and the controller can be implemented in real time.It can avoid the on-line repeated optimization and the dependence on the feasibility of the initial state which are encountered in the traditional robust receding horizon control schemes.     

Efficient robust constrained model predictive control with a time varying terminal constraint set

An efficient robust constrained model predictive control algorithm with a time varying terminal constraint set is developed for systems with model uncertainty and input constraints. The approach is novel in that it off-line constructs a continuum of terminal constraint sets and on-line achieves robust stability by using a relatively short control horizon (even N=0) with a time varying terminal constraint set. This algorithm not only dramatically reduces the on-line computation but also significantly enlarges the size of the allowable set of initial conditions. Moreover, this control scheme retains the unconstrained optimal performance in the neighborhood of the equilibrium. The controller design is illustrated through a benchmark problem.     

Mixed Constrained Infinite Horizon Linear Quadratic Optimal Control

For a given initial state, a constrained infinite horizon linear quadratic optimal control problem can be reduced to a finite dimensional problem [12]. To find a conservative estimate of the size of the reduced problem, the existing algorithms require the on‐line solutions of quadratic programs [10] or a linear program [2]. In this paper, we first show based on the Lyapunov theorem that the closed‐loop system with a mixed constrained infinite horizon linear quadratic optimal control is exponentially stable on proper sets. Then the exponentially converging envelop of the closed‐loop trajectory that can be computed off‐line is employed to obtain a finite dimensional quadratic program equivalent to the mixed constrained infinite horizon linear quadratic optimal control problem without any on‐line optimization. The example considered in [2] showed that the proposed algorithm identifies less conservative size estimate of the reduced problem with much less computation.     

基于线性集结的预测控制器

针对一类受约束的线性离散系统,研究了基于集结预测控制器的可行性问题．通过一个列满秩的集结矩阵将维数较小的控制变量序列映射成在线优化变量序列,在不缩短控制时域的情况下,降低了在线优化变量的个数．给出了优化变量可集结的充分条件,当集结矩阵满足这个条件时,在线求解优化问题总会得到可行解．最后,给出了一个仿真实例,仿真结果很好地验证了本文的结论．     

LMI-based robust model predictive control and its application to an industrial CSTR problem

In this paper, robust model predictive control (MPC) is studied for a class of uncertain linear systems with structured time-varying uncertainties. This general class of uncertain systems is useful for nonlinear plant modeling in many circumstances. The controller design is characterizing as an optimization problem of the “worst-case” objective function over infinite moving horizon, subject to input and output constraints. A sufficient state-feedback synthesis condition is provided in the form of linear matrix inequality (LMI) optimizations, and will be solved on-line. The stability of such a control scheme is determined by the feasibility of the optimization problem. To demonstrate its usefulness, this robust MPC technique is applied to an industrial continuous stirred tank reactor (CSTR) problem with explicit input and output constraints. Its relative merits to conventional MPC approaches are also discussed.     

约束多传感器线性系统的RMPC容错控制

针对一类约束多传感器线性故障系统,提出了一种基于鲁棒预测控制策略的容错控制方案．首先为多传感器线性系统设计了观测器,然后离线设计不变集列,使得时变的状态估计误差存在于相应的不变集列中,利用不变集的理论提出了一种新的故障检测的方法,最后基于鲁棒预测控制策略为故障系统设计了容错控制器,给出了闭环系统鲁棒稳定性的证明．仿真结果证明了方法的可行性。     

Robust one-step receding horizon control for constrained systems

This paper proposes a robust receding horizon control scheme for discrete-time uncertain linear systems with input and state constraints. The control scheme is based on the minimization of the worst-case one-step finite horizon cost with a finite terminal weighting matrix. It is shown that the proposed receding horizon control robustly asymptotically stabilizes uncertain constrained systems under some matrix inequality conditions on the terminal weighting matrices. This robust receding horizon control scheme has a larger feasible initial-state set and a more general structure than existing robust receding horizon controls for uncertain constrained systems under the same design parameters. The proposed controller is obtained using semidefinite programming. Copyright © 1999 John Wiley & Sons, Ltd.     

Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors

We propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specifically, the workload partitioning problem can be formulated as a continuous nonlinear program for a system with continuous operating frequency, and as a continuous linear program for a practical system with a discrete speed level set. The latter problem can therefore be solved by an interior point method to any accuracy in polynomial time. The task ordering problem can be solved by an algorithm with a complexity that is linear in the total number of tasks. The work is evaluated against existing global energy/feasibility optimal workload allocation formulations. The results illustrate that our algorithms are both feasibility optimal and energy optimal for both implicit and constrained deadline tasksets. Specifically, our algorithm can achieve up to 40% energy saving for some simulated tasksets with constrained deadlines. The benefit of our formulation compared with existing work is that our algorithms can solve a more general class of scheduling problems due to incorporating a scheduling dynamic model in the formulations and allowing for a time-varying speed profile.     

Decoupling and tracking control using eigenstructure assignment for linear time-varying systems

This work is concerned with the assignment of a desired PD-eigenstructure for linear time-varying systems. Despite its well-known limitations, gain scheduling control appeared to be a focus of the research efforts. Scheduling of frozen-time, frozen-state controllers for fast time-varying dynamics is known to be mathematically fallacious, and practically hazardous. Therefore, recent research efforts are being directed towards applying time-varying controllers. In this paper, (a) we introduce a differential algebraic eigenvalue theory for linear time-varying systems, and then (b) a novel decoupling and tracking control scheme is proposed by using the PD-eigenstructure assignment scheme via a differential Sylvester equation and a Command Generator Tracker for linear time-varying systems. The PD-eigenstructure assignment is utilized as a regulator. A feedforward gain for tracking control is computed by using the command generator tracker. The whole design procedure of the proposed PD-eigenstructure assignment scheme is systematic in nature. The scheme could be used to determine stability of linear time-varying systems easily as well as to provide a new horizon of designing controllers for the linear time-varying systems. The presented method is illustrated by numerical examples.     

Periodic optimal control of nonlinear constrained systems using economic model predictive control

In this paper, we consider the problem of periodic optimal control of nonlinear systems subject to online changing and periodically time-varying economic performance measures using model predictive control (MPC). The proposed economic MPC scheme uses an online optimized artificial periodic orbit to ensure recursive feasibility and constraint satisfaction despite unpredictable changes in the economic performance index. We demonstrate that the direct extension of existing methods to periodic orbits does not necessarily yield the desirable closed-loop economic performance. Instead, we carefully revise the constraints on the artificial trajectory, which ensures that the closed-loop average performance is no worse than a locally optimal periodic orbit. In the special case that the prediction horizon is set to zero, the proposed scheme is a modified version of recent publications using periodicity constraints, with the important difference that the resulting closed loop has more degrees of freedom which are vital to ensure convergence to an optimal periodic orbit. In addition, we detail a tailored offline computation of suitable terminal ingredients, which are both theoretically and practically beneficial for closed-loop performance improvement. Finally, we demonstrate the practicality and performance improvements of the proposed approach on benchmark examples.     

Implicit improved vertex control for uncertain,time-varying linear discrete-time systems with state and control constraints

The problem of regulating an uncertain and/or time-varying linear discrete-time system with state and control constraints to the origin is addressed. It is shown that feasibility and a robustly asymptotically stable closed loop can be achieved using an interpolation technique. The design method can be seen as an alternative to optimization-based control schemes such as Robust Model Predictive Control. Especially for problems requiring complex calculations to find the optimal solution, the present method can provide a straightforward suboptimal solution. A simulation demonstrates the performance of this class of constrained controllers.