Pith. sign in

REVIEW

Computationally efficient robust MPC using optimized constraint tightening

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.02142 v2 pith:UTWSLH23 submitted 2022-04-05 eess.SY cs.SYmath.OC

classification eess.SYcs.SYmath.OC
keywords constraintrobusttighteningfeedbackproblemresultingachievedadditive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A robust model predictive control (MPC) method is presented for linear, time-invariant systems affected by bounded additive disturbances. The main contribution is the offline design of a disturbance-affine feedback gain whereby the resulting constraint tightening is minimized. This is achieved by formulating the constraint tightening problem as a convex optimization problem with the feedback term as a variable. The resulting MPC controller has the computational complexity of nominal MPC, and guarantees recursive feasibility, stability and constraint satisfaction. The advantages of the proposed approach compared to existing robust MPC methods are demonstrated using numerical examples.

Discussion (0). Continue with ORCID to comment.

Pith tools