A Sparse ADMM-Based Solver for Linear MPC Subject to Terminal Quadratic Constraint

Model predictive control (MPC) typically includes a terminal constraint to guarantee stability of the closed-loop system under nominal conditions. In linear MPC, this constraint is generally taken on a polyhedral set, leading to a quadratic optimization problem. However, the use of an ellipsoidal te...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control systems technology Ročník 32; číslo 6; s. 2376 - 2384
Hlavní autoři: Krupa, Pablo, Jaouani, Rim, Limon, Daniel, Alamo, Teodoro
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Artificial intelligence
Closed loops
Complexity theory
Convex functions
Ellipsoids
Embedded optimization
Embedded systems
Feedback control
model predictive control (MPC)
Optimization
Predictive control
Programming
quadratic constraints
second-order cone (SOC) programming
Slack variables
Solvers
Terminal constraints
Vectors
ISSN:1063-6536, 1558-0865
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Model predictive control (MPC) typically includes a terminal constraint to guarantee stability of the closed-loop system under nominal conditions. In linear MPC, this constraint is generally taken on a polyhedral set, leading to a quadratic optimization problem. However, the use of an ellipsoidal terminal constraint may be desirable, leading to an optimization problem with a quadratic constraint. In this case, the optimization problem can be solved using second-order cone (SOC) programming solvers, since the quadratic constraint can be posed as a SOC constraint, at the expense of adding additional slack variables and possibly compromising the simple structure of the solver ingredients. In this brief, we present a sparse solver for linear MPC subject to a terminal ellipsoidal constraint based on the alternating direction method of multipliers (ADMM) algorithm in which we directly deal with the quadratic constraints without having to resort to the use of a SOC constraint nor the inclusion of additional decision variables. The solver is suitable for its use in embedded systems, since it is sparse, has a small memory footprint, and requires no external libraries. We compare its performance against other approaches from the literature.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1063-6536
1558-0865
DOI:10.1109/TCST.2024.3386062