Loading…
A dual gradient projection quadratic programming algorithm tailored for model predictive control
The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for o...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 3064 |
container_issue | |
container_start_page | 3057 |
container_title | |
container_volume | |
creator | Axehill, D. Hansson, A. |
description | The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for on-line linear MPC, and it is crucial in branch and bound for hybrid MPC. In this paper, a dual active set-like QP method was chosen because of its warm start properties. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. Gradient projection methods are methods known to be able to identify this active set very fast and such a method was therefore chosen in this work. The gradient projection method was applied to the dual QP problem and it was tailored for the MPC application. Results from numerical experiments indicate that the performance of the new algorithm is very good, both for linear MPC as well as for hybrid MPC. It is also noticed that the number of QP iterations is significantly reduced compared to classical active set methods. |
doi_str_mv | 10.1109/CDC.2008.4738961 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>swepub_6IE</sourceid><recordid>TN_cdi_ieee_primary_4738961</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4738961</ieee_id><sourcerecordid>oai_DiVA_org_liu_44336</sourcerecordid><originalsourceid>FETCH-LOGICAL-i212t-c28c2880a5c62090a4d6956ebbefcd13b5576b4997b9d32e49481de50ba5a9643</originalsourceid><addsrcrecordid>eNpVkF1LwzAYhSM6cM7dC97kB9iZr6bN5ejmBwy8UW9r2ryrGWkz01bx3xvZEIQDL-flOefiIHRFyYJSom6LVbFghOQLkfFcSXqC5irLqWBCcMoEP_3nuTxDU0IVTRijcoKmmUqkIDF3ji76fkdiE5Fyit6W2Iza4SZoY6Eb8D74HdSD9R3-GLUJerD17zMCbWu7BmvX-GCH9xYP2jofwOCtD7j1BlwEwdiY_gRc-24I3l2iyVa7HubHO0Mvd-vn4iHZPN0_FstNYhllQ1KzPConOq0lI4poYaRKJVQVbGtDeZWmmayEUlmlDGcglMipgZRUOtVKCj5DN4fe_gv2Y1Xug211-C69tuXKvi5LH5rS2bGM-3AZ8esDbgHgDz5uy38AtylqXw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A dual gradient projection quadratic programming algorithm tailored for model predictive control</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Axehill, D. ; Hansson, A.</creator><creatorcontrib>Axehill, D. ; Hansson, A.</creatorcontrib><description>The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for on-line linear MPC, and it is crucial in branch and bound for hybrid MPC. In this paper, a dual active set-like QP method was chosen because of its warm start properties. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. Gradient projection methods are methods known to be able to identify this active set very fast and such a method was therefore chosen in this work. The gradient projection method was applied to the dual QP problem and it was tailored for the MPC application. Results from numerical experiments indicate that the performance of the new algorithm is very good, both for linear MPC as well as for hybrid MPC. It is also noticed that the number of QP iterations is significantly reduced compared to classical active set methods.</description><identifier>ISSN: 0191-2216</identifier><identifier>ISBN: 9781424431236</identifier><identifier>ISBN: 1424431239</identifier><identifier>ISBN: 9781424431243</identifier><identifier>ISBN: 1424431247</identifier><identifier>EISBN: 9781424431243</identifier><identifier>EISBN: 1424431247</identifier><identifier>DOI: 10.1109/CDC.2008.4738961</identifier><identifier>LCCN: 79-640961</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automatic control ; Control systems ; Hybrid systems ; Mixed integer quadratic programming ; Model predictive control ; Optimal control ; Predictive control ; Predictive models ; Projection algorithms ; Quadratic programming ; Riccati equations ; TECHNOLOGY ; TEKNIKVETENSKAP</subject><ispartof>2008 47th IEEE Conference on Decision and Control, 2008, p.3057-3064</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4738961$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,309,310,778,782,787,788,883,2054,4038,4039,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4738961$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-44336$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Axehill, D.</creatorcontrib><creatorcontrib>Hansson, A.</creatorcontrib><title>A dual gradient projection quadratic programming algorithm tailored for model predictive control</title><title>2008 47th IEEE Conference on Decision and Control</title><addtitle>CDC</addtitle><description>The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for on-line linear MPC, and it is crucial in branch and bound for hybrid MPC. In this paper, a dual active set-like QP method was chosen because of its warm start properties. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. Gradient projection methods are methods known to be able to identify this active set very fast and such a method was therefore chosen in this work. The gradient projection method was applied to the dual QP problem and it was tailored for the MPC application. Results from numerical experiments indicate that the performance of the new algorithm is very good, both for linear MPC as well as for hybrid MPC. It is also noticed that the number of QP iterations is significantly reduced compared to classical active set methods.</description><subject>Automatic control</subject><subject>Control systems</subject><subject>Hybrid systems</subject><subject>Mixed integer quadratic programming</subject><subject>Model predictive control</subject><subject>Optimal control</subject><subject>Predictive control</subject><subject>Predictive models</subject><subject>Projection algorithms</subject><subject>Quadratic programming</subject><subject>Riccati equations</subject><subject>TECHNOLOGY</subject><subject>TEKNIKVETENSKAP</subject><issn>0191-2216</issn><isbn>9781424431236</isbn><isbn>1424431239</isbn><isbn>9781424431243</isbn><isbn>1424431247</isbn><isbn>9781424431243</isbn><isbn>1424431247</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVkF1LwzAYhSM6cM7dC97kB9iZr6bN5ejmBwy8UW9r2ryrGWkz01bx3xvZEIQDL-flOefiIHRFyYJSom6LVbFghOQLkfFcSXqC5irLqWBCcMoEP_3nuTxDU0IVTRijcoKmmUqkIDF3ji76fkdiE5Fyit6W2Iza4SZoY6Eb8D74HdSD9R3-GLUJerD17zMCbWu7BmvX-GCH9xYP2jofwOCtD7j1BlwEwdiY_gRc-24I3l2iyVa7HubHO0Mvd-vn4iHZPN0_FstNYhllQ1KzPConOq0lI4poYaRKJVQVbGtDeZWmmayEUlmlDGcglMipgZRUOtVKCj5DN4fe_gv2Y1Xug211-C69tuXKvi5LH5rS2bGM-3AZ8esDbgHgDz5uy38AtylqXw</recordid><startdate>200812</startdate><enddate>200812</enddate><creator>Axehill, D.</creator><creator>Hansson, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>ADTPV</scope><scope>BNKNJ</scope><scope>DG8</scope></search><sort><creationdate>200812</creationdate><title>A dual gradient projection quadratic programming algorithm tailored for model predictive control</title><author>Axehill, D. ; Hansson, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i212t-c28c2880a5c62090a4d6956ebbefcd13b5576b4997b9d32e49481de50ba5a9643</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Automatic control</topic><topic>Control systems</topic><topic>Hybrid systems</topic><topic>Mixed integer quadratic programming</topic><topic>Model predictive control</topic><topic>Optimal control</topic><topic>Predictive control</topic><topic>Predictive models</topic><topic>Projection algorithms</topic><topic>Quadratic programming</topic><topic>Riccati equations</topic><topic>TECHNOLOGY</topic><topic>TEKNIKVETENSKAP</topic><toplevel>online_resources</toplevel><creatorcontrib>Axehill, D.</creatorcontrib><creatorcontrib>Hansson, A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>SwePub</collection><collection>SwePub Conference</collection><collection>SWEPUB Linköpings universitet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Axehill, D.</au><au>Hansson, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A dual gradient projection quadratic programming algorithm tailored for model predictive control</atitle><btitle>2008 47th IEEE Conference on Decision and Control</btitle><stitle>CDC</stitle><date>2008-12</date><risdate>2008</risdate><spage>3057</spage><epage>3064</epage><pages>3057-3064</pages><issn>0191-2216</issn><isbn>9781424431236</isbn><isbn>1424431239</isbn><isbn>9781424431243</isbn><isbn>1424431247</isbn><eisbn>9781424431243</eisbn><eisbn>1424431247</eisbn><abstract>The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for on-line linear MPC, and it is crucial in branch and bound for hybrid MPC. In this paper, a dual active set-like QP method was chosen because of its warm start properties. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. Gradient projection methods are methods known to be able to identify this active set very fast and such a method was therefore chosen in this work. The gradient projection method was applied to the dual QP problem and it was tailored for the MPC application. Results from numerical experiments indicate that the performance of the new algorithm is very good, both for linear MPC as well as for hybrid MPC. It is also noticed that the number of QP iterations is significantly reduced compared to classical active set methods.</abstract><pub>IEEE</pub><doi>10.1109/CDC.2008.4738961</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0191-2216 |
ispartof | 2008 47th IEEE Conference on Decision and Control, 2008, p.3057-3064 |
issn | 0191-2216 |
language | eng |
recordid | cdi_ieee_primary_4738961 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Automatic control Control systems Hybrid systems Mixed integer quadratic programming Model predictive control Optimal control Predictive control Predictive models Projection algorithms Quadratic programming Riccati equations TECHNOLOGY TEKNIKVETENSKAP |
title | A dual gradient projection quadratic programming algorithm tailored for model predictive control |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T22%3A11%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-swepub_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20dual%20gradient%20projection%20quadratic%20programming%20algorithm%20tailored%20for%20model%20predictive%20control&rft.btitle=2008%2047th%20IEEE%20Conference%20on%20Decision%20and%20Control&rft.au=Axehill,%20D.&rft.date=2008-12&rft.spage=3057&rft.epage=3064&rft.pages=3057-3064&rft.issn=0191-2216&rft.isbn=9781424431236&rft.isbn_list=1424431239&rft.isbn_list=9781424431243&rft.isbn_list=1424431247&rft_id=info:doi/10.1109/CDC.2008.4738961&rft.eisbn=9781424431243&rft.eisbn_list=1424431247&rft_dat=%3Cswepub_6IE%3Eoai_DiVA_org_liu_44336%3C/swepub_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i212t-c28c2880a5c62090a4d6956ebbefcd13b5576b4997b9d32e49481de50ba5a9643%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4738961&rfr_iscdi=true |