Linear Model Predictive Control under Continuous Path Constraints via Parallelized Primal-Dual Hybrid Gradient Algorithm
In this paper, we consider a Model Predictive Control (MPC) problem of a continuous-time linear time-invariant system subject to continuous-time path constraints on the states and the inputs. By leveraging the concept of differential flatness, we can replace the differential equations governing the...
Saved in:
Main Authors | , , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
31.03.2023
|
Subjects | |
Online Access | Get full text |
DOI | 10.48550/arxiv.2303.17889 |
Cover
Summary: | In this paper, we consider a Model Predictive Control (MPC) problem of a
continuous-time linear time-invariant system subject to continuous-time path
constraints on the states and the inputs. By leveraging the concept of
differential flatness, we can replace the differential equations governing the
system with linear mapping between the states, inputs, and flat outputs
(including their derivatives). The flat outputs are then parameterized by
piecewise polynomials, and the model predictive control problem can be
equivalently transformed into a Semi-Definite Programming (SDP) problem via
Sum-of-Squares (SOS), ensuring constraint satisfaction at every continuous-time
interval. We further note that the SDP problem contains a large number of
small-size semi-definite matrices as optimization variables. To address this,
we develop a Primal-Dual Hybrid Gradient (PDHG) algorithm that can be
efficiently parallelized to speed up the optimization procedure. Simulation
results on a quadruple-tank process demonstrate that our formulation can
guarantee strict constraint satisfaction, while the standard MPC controller
based on the discretized system may violate the constraint inside a sampling
period. Moreover, the computational speed superiority of our proposed algorithm
is collaborated by numerical simulation. |
---|---|
DOI: | 10.48550/arxiv.2303.17889 |