A Proximal-Point Lagrangian Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control
Nonlinear model predictive control has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, to name a few. Running a bilinear MPC controller in real time requires solving a non-convex optimization problem within a limited sampling time. This paper proposes a novel parallel proximal-point Lagrangian based bilinear MPC solver via an interlacing horizon-splitting scheme. The resulting algorithm converts the non-convex MPC control problem into a set of parallelizable small-scale multi-parametric quadratic programs (mpQPs) and an equality-constrained linear-quadratic regulator problem. As a result, the solutions of mpQPs can be pre-computed offline to enable efficient online computation. The proposed algorithm is validated on a simulation of an HVAC system control. It is deployed on a TI LaunchPad XL F28379D microcontroller to execute speed control on a field-controlled DC motor, where the MPC updates at 10 ms and solves the problem in 1.764 ms on average and at most 2.088 ms.
Code (0)
등록된 구현이 없습니다.
Tasks
Model Predictive ControlMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
We propose an inexact proximal augmented Lagrangian method (P-ALM) for nonconvex structured optimization problems. The proposed method features an easily implementable rule not only for updating the penalty parameters, b…
A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees
In this paper we consider finding a second-order stationary point (SOSP) of nonconvex equality constrained optimization when a nearly feasible point is known. In particular, we first propose a new Newton-CG method for fi…
Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
In this paper, we consider the minimization of a nonsmooth nonconvex objective function $f(x)$ over a closed convex subset $\mathcal{X}$ of $\mathbb{R}^n$, with additional nonsmooth nonconvex constraints $c(x) = 0$. We d…
Lagrangian Decomposition for Neural Network Verification
A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. Previous methods have either used off-the-shelf solvers, discarding the problem structure, or rela…
GPUvalidProximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization
This paper proposes the Proximal Iteratively REweighted (PIRE) algorithm for solving a general problem, which involves a large body of nonconvex sparse and structured sparse related problems. Comparing with previous iter…