The reviewed record of science sign in
Pith

arxiv: 1911.08607 · v1 · pith:JPHLD5KI · submitted 2019-11-19 · eess.SY · cs.SY· math.OC

Robust Adaptive Model Predictive Control with Worst-Case Cost

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JPHLD5KIrecord.jsonopen to challenge →

classification eess.SY cs.SYmath.OC
keywords adaptivealgorithmcontrolmodelrobustworst-caseboundedcost
0
0 comments X
read the original abstract

A robust adaptive model predictive control (MPC) algorithm is presented for linear, time invariant systems with unknown dynamics and subject to bounded measurement noise. The system is characterized by an impulse response model, which is assumed to lie within a bounded set called the feasible system set. Online set-membership identification is used to reduce uncertainty in the impulse response. In the MPC scheme, robust constraints are enforced to ensure constraint satisfaction for all the models in the feasible set. The performance objective is formulated as a worst-case cost with respect to the modeling uncertainties. That is, at each time step an optimization problem is solved in which the control input is optimized for the worst-case plant in the uncertainty set. The performance of the proposed algorithm is compared to an adaptive MPC algorithm from the literature using Monte-Carlo simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.