A SIMPLE ALGORITHM FOR ROBUST MPC
نویسندگان
چکیده
منابع مشابه
A Simple Algorithm for Robust Mpc
The majority of recent works on robust MPC either require very burdensome online computations or are restricted to relatively small feasible regions. This paper builds on a recent work which demonstrated that one could compute the maximal admissible set for a linear parameter varying system and shows how this set can be used as the terminal region and hence allows the definition of an MPC algor...
متن کاملModel Predictive Control with Integral Action: A simple MPC algorithm
A simple Model Predictive Control (MPC) algorithm of velocity (incremental) form is presented. The proposed MPC controller is insensitive to slowly varying system and measurement trends and therefore has integral action. The presented algorithm is illustrated by both simulations and practical experiments on a quadruple tank MIMO process.
متن کاملA Parametric Optimisation Approach for Robust Mpc
In this paper an algorithm is presented for deriving the explicit robust model based optimal control law. The system is represented by linear, discrete-time, timeinvariant model with constraints on control and state variables and a quadratic objective function. Using the fundamentals of flexibility analysis the algorithm proposed in this paper derives the robust optimal control law off-line as ...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2005
ISSN: 1474-6670
DOI: 10.3182/20050703-6-cz-1902.00987