A Successive Convexification Approach for Robust Receding Horizon Control

A novel robust nonlinear model predictive control strategy is proposed for systems with nonlinear dynamics and convex state and control constraints. Using a sequential convex approximation approach and a difference of convex functions representation, the scheme constructs tubes that contain predicted model trajectories, accounting for approximation errors and disturbances, and guaranteeing constraint satisfaction. An optimal control problem is solved as a sequence of convex programs. We develop the scheme initially in the absence of external disturbances and show that the proposed nominal approach is non-conservative, with the solutions of successive convex programs converging to a locally optimal solution for the original optimal control problem. We extend the approach to the case of additive disturbances using a novel strategy for selecting linearization points. As a result we formulate a robust receding horizon strategy with guarantees of recursive feasibility and closed-loop stability

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-04-04
DOI
https://doi.org/10.1109/tac.2025.3558253
Citations
2
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
2.43
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Successive Convexification Approach for Robust Receding Horizon Control

Yana Lishkova, Mark Cannon
2 citations
IEEE Transactions on Automatic Control
Advanced Control Systems Optimization
2.43
article

A Successive Convexification Approach for Robust Receding Horizon Control

Yana Lishkova, Mark Cannon
article en
2 citations

Abstract

A novel robust nonlinear model predictive control strategy is proposed for systems with nonlinear dynamics and convex state and control constraints. Using a sequential convex approximation approach and a difference of convex functions representation, the scheme constructs tubes that contain predicted model trajectories, accounting for approximation errors and disturbances, and guaranteeing constraint satisfaction. An optimal control problem is solved as a sequence of convex programs. We develop the scheme initially in the absence of external disturbances and show that the proposed nominal approach is non-conservative, with the solutions of successive convex programs converging to a locally optimal solution for the original optimal control problem. We extend the approach to the case of additive disturbances using a novel strategy for selecting linearization points. As a result we formulate a robust receding horizon strategy with guarantees of recursive feasibility and closed-loop stability

IEEE Transactions on Automatic ControlVol. 70(10)
University of Oxford (GB)
Climate action
Openalex Percentile: Top 12%
Advanced Control Systems Optimization
2.43
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.