liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Convex Relaxations for Mixed Integer Predictive Control
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.ORCID iD: 0000-0001-6957-2603
University of California Los Angeles, USA.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2010 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 46, no 9, 1540-1545 p.Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
Elsevier, 2010. Vol. 46, no 9, 1540-1545 p.
Keyword [en]
Predictive control, Hybrid systems, Finite alphabet control, Integer programming, Semidefinite programming
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-60254DOI: 10.1016/j.automatica.2010.06.015ISI: 000281991600018OAI: oai:DiVA.org:liu-60254DiVA: diva2:355801
Available from: 2010-10-08 Created: 2010-10-08 Last updated: 2017-12-12

Open Access in DiVA

fulltext(569 kB)692 downloads
File information
File name FULLTEXT01.pdfFile size 569 kBChecksum SHA-512
c0a9afd8566678d91a450a7f630a2ba9feed6b4d124395cb6b1a3d3d525977b6a5c3a2222da44afeef95a9639d178b7f7c63fa1e795ced58fe53fa558af43563
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Axehill, DanielHansson, Anders

Search in DiVA

By author/editor
Axehill, DanielHansson, Anders
By organisation
Automatic ControlThe Institute of Technology
In the same journal
Automatica
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 692 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 379 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf