Computational burden reduction in Min-Max MPC

Min–max model predictive control (MMMPC) is one of the strategies used to control plants subject to bounded uncertainties. The implementation of MMMPC suffers a large computational burden due to the complex numerical optimization problem that has to be solved at every sampling time. This paper shows how to overcome this by transforming the original problem into a reduced min–max problem whose solution is much simpler. In this way, the range of processes to which MMMPC can be applied is considerably broadened. Proofs based on the properties of the cost function and simulation examples are given in the paper

Optimal Decentralized State-Feedback Control with Sparsity and Delays

This work presents the solution to a class of decentralized linear quadratic state-feedback control problems, in which the plant and controller must satisfy the same combination of delay and sparsity constraints. Using a novel decomposition of the noise history, the control problem is split into independent subproblems that are solved using dynamic programming. The approach presented herein both unifies and generalizes many existing results

A Simple and Efficient Algorithm for Nonlinear Model Predictive Control

We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of a quadratic program at every iteration and, consequently, inner iterative procedures. As a result, when the problem is ill-conditioned or the prediction horizon is large, each outer iteration becomes computationally very expensive. We propose a line-search algorithm that combines forward-backward iterations (FB) and Newton-type steps over the recently introduced forward-backward envelope (FBE), a continuous, real-valued, exact merit function for the original problem. The curvature information of Newton-type methods enables asymptotic superlinear rates under mild assumptions at the limit point, and the proposed algorithm is based on very simple operations: access to first-order information of the cost and dynamics and low-cost direct linear algebra. No inner iterative procedure nor Hessian evaluation is required, making our approach computationally simpler than SQP methods. The low-memory requirements and simple implementation make our method particularly suited for embedded NMPC applications

Mixed H2/H∞ filtering for uncertain systems with regional pole assignment

Copyright [2005] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.The mixed H2/H∞ filtering problem for uncertain linear continuous-time systems with regional pole assignment is considered. The purpose of the problem is to design an uncertainty-independent filter such that, for all admissible parameter uncertainties, the following filtering requirements are simultaneously satisfied: 1) the filtering process is asymptotically stable; 2) the poles of the filtering matrix are located inside a prescribed region that compasses the vertical strips, horizontal strips, disks, or conic sectors; 3) both the H2 norm and the H∞ norm on the respective transfer functions are not more than the specified upper bound constraints. We establish a general framework to solve the addressed multiobjective filtering problem completely. In particular, we derive necessary and sufficient conditions for the solvability of the problem in terms of a set of feasible linear matrix inequalities (LMIs). An illustrative example is given to illustrate the design procedures and performances of the proposed method