Once Upon a Time Step: A Closed-Loop Approach to Robust MPC Design

A novel robust model predictive control (MPC) algorithm is presented, whereby closed-loop constraint satisfaction is ensured using recursive feasibility of the MPC optimization. The proposed strategy considers the effects of model perturbations and disturbances occurring at only <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">one time step</i>. This is in contrast to existing formulations, which compute control policies that are feasible under the worst-case realizations of all model perturbations and exogenous disturbances in the MPC prediction horizon. The proposed method has an online computational complexity similar to nominal MPC methods while guaranteeing constraint satisfaction, recursive feasibility, and stability. Numerical simulations demonstrate the efficacy of our proposed approach.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2024-09-20
DOI
https://doi.org/10.1109/tac.2024.3465522
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Once Upon a Time Step: A Closed-Loop Approach to Robust MPC Design

Roy S. Smith, Sébastien Gros, Marcell Bartos, Amber Srivastava et al.
IEEE Transactions on Automatic Control
Advanced Control Systems Optimization
article

Once Upon a Time Step: A Closed-Loop Approach to Robust MPC Design

Roy S. Smith, Sébastien Gros, Marcell Bartos, Amber Srivastava, Anilkumar Parsi
article en

Abstract

A novel robust model predictive control (MPC) algorithm is presented, whereby closed-loop constraint satisfaction is ensured using recursive feasibility of the MPC optimization. The proposed strategy considers the effects of model perturbations and disturbances occurring at only <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">one time step</i>. This is in contrast to existing formulations, which compute control policies that are feasible under the worst-case realizations of all model perturbations and exogenous disturbances in the MPC prediction horizon. The proposed method has an online computational complexity similar to nominal MPC methods while guaranteeing constraint satisfaction, recursive feasibility, and stability. Numerical simulations demonstrate the efficacy of our proposed approach.

IEEE Transactions on Automatic ControlVol. 70(2)
Norwegian University of Science and Technology (NO), ETH Zurich (CH), Indian Institute of Technology Delhi (IN)
Openalex Percentile: Top 82%
Advanced Control Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.