کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
752970 895482 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Min–Max MPC based on a network problem
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
Min–Max MPC based on a network problem
چکیده انگلیسی

In general, min–max model predictive controllers have a high computational burden. In this work, an efficient implementation of this class of controllers that can be applied to linear plants with additive uncertainties and quadratic cost functions is presented. The new approach relies on the equivalence of the maximization problem with a network problem. If a given condition is satisfied, the computational burden of the proposed implementation grows polynomially with the prediction horizon. In particular, the resulting optimization problem can be posed as a quadratic programming problem with a number of constraints and variables that grows in a quadratic manner with the prediction horizon. An alternative controller has been proposed for those systems that do not satisfy this condition. This alternative controller approximates the original one with a given bound on the error.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Systems & Control Letters - Volume 57, Issue 2, February 2008, Pages 184–192
نویسندگان
, , ,