Convex relaxations for mixed integer predictive control

doi:10.1016/j.automatica.2010.06.015

Return

Convex relaxations for mixed integer predictive control

2010-09-01

Daniel Axehill *

Lieven Vandenberghe

Anders Hansson

DOI：10.1016/j.automatica.2010.06.015

Original

Save

View PDF

Abstract

En 中文

The main objective in this work is to compare different convex relaxations for Model Predictive Control (MPC) problems with mixed real valued and binary valued control signals. In the problem description considered, the objective function is quadratic, the dynamics are linear, and the inequality constraints on states and control signals are all linear. The relaxations are related theoretically and the quality of the bounds and the computational complexities are compared in numerical experiments. The investigated relaxations include the Quadratic Programming (QP) relaxation, the standard Semidefinite Programming (SDP) relaxation, and an equality constrained SDP relaxation. The equality constrained SDP relaxation appears to be new in the context of hybrid MPC and the result presented in this work indicates that it can be useful as an alternative relaxation, which is less computationally demanding than the ordinary SDP relaxation and which often gives a better bound than the bound from the QP relaxation. Furthermore, it is discussed how the result from the SDP relaxations can be used to generate suboptimal solutions to the control problem. Moreover, it is also shown that the equality constrained SDP relaxation is equivalent to a QP in an important special case. (c) 2010 Elsevier Ltd. All rights reserved.

Keywords:

Predictive control

Hybrid systems

Finite alphabet control

Integer programming

Semidefinite programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.