𝒩IPM-MPC: An Efficient Null-Space Method Based Interior-Point Method for Model Predictive Control

09/07/2021
by   Kai Pfeiffer, et al.
0

Linear Model Predictive Control (MPC) is a widely used method to control systems with linear dynamics. Efficient interior-point methods have been proposed which leverage the block diagonal structure of the quadratic program (QP) resulting from the receding horizon control formulation. However, they require two matrix factorizations per interior-point method iteration, one each for the computation of the dual and the primal. Recently though an interior point method based on the null-space method has been proposed which requires only a single decomposition per iteration. While the then used null-space basis leads to dense null-space projections, in this work we propose a sparse null-space basis which preserves the block diagonal structure of the MPC matrices. Since it is based on the inverse of the transfer matrix we introduce the notion of so-called virtual controls which enables just that invertibility. A combination of the reduced number of factorizations and omission of the evaluation of the dual lets our solver outperform others in terms of computational speed by an increasing margin dependent on the number of state and control variables.

READ FULL TEXT
research
05/23/2019

Nullspace Structure in Model Predictive Control

Robotic tasks can be accomplished by exploiting different forms of redun...
research
06/25/2021

𝒩IPM-HLSP: An Efficient Interior-Point Method for Hierarchical Least-Squares Programs

Hierarchical least-squares programs with linear constraints (HLSP) are a...
research
07/23/2023

Robust explicit model predictive control for hybrid linear systems with parameter uncertainties

Explicit model-predictive control (MPC) is a widely used control design ...
research
11/05/2019

Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form

We introduce an adaptive domain decomposition (DD) method for solving sa...
research
07/22/2019

Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions

This article considers the recovery of low-rank matrices via a convex nu...
research
10/04/2017

A {-1,0,1}- and sparsest basis for the null space of a forest in optimal time

Given a matrix, the Null Space Problem asks for a basis of its null spac...
research
10/23/2019

Large Scale Model Predictive Control with Neural Networks and Primal Active Sets

This work presents an explicit-implicit procedure that combines an offli...

Please sign up or login with your details

Forgot password? Click here to reset