Nonlinear optimal control synthesis via occupation measures

We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given OCP, using a hierarchy of linear matrix inequality (LMI) relax...

Full description

Saved in:
Bibliographic Details
Main Authors: Henrion, D., Lasserre, J.B., Savorgnan, C.
Format: Conference Proceeding
Language:English
Subjects:
Cost function
Differential equations
Helium
Linear matrix inequalities
Mathematics
Optimal control
Polynomials
System testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 4754
container_issue
container_start_page 4749
container_title
container_volume
creator Henrion, D.
Lasserre, J.B.
Savorgnan, C.
description We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given OCP, using a hierarchy of linear matrix inequality (LMI) relaxations. In the second part, we extend the methodology to approximate the optimal value function on a given set and we use such a function to constructively and computationally derive an almost optimal control law. Numerical examples show the effectiveness of the approach.
doi_str_mv 10.1109/CDC.2008.4739136
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4739136</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4739136</ieee_id><sourcerecordid>4739136</sourcerecordid><originalsourceid>FETCH-LOGICAL-i217t-1c8a88743f89e0c4803fbebfcca71be38bbef1fbffb78fca860c26d059143f3f3</originalsourceid><addsrcrecordid>eNpVkE1LxDAYhCO6YF33LnjJH2jNm8R84Enq-gGLXvS8JPENRrpNabrC_nsL7kXmMMxhHoYh5ApYA8DsTfvQNpwx00gtLAh1QlZWG5BcSgFcitN_WagzUjGwUHMOakEqbWslmVVwTi5K-WYziSlVkbvX3HepRzfSPExp5zoacj-NuaPl0E9fWFKhP8nRHMJ-cFPKPd2hK_sRyyVZRNcVXB19ST4e1-_tc715e3pp7zd14qCnGoJxxmgporHIgjRMRI8-huA0eBTGe4wQfYxemxicUSxw9cluLcydWUty_cdNiLgdxnnleNgefxC_vmNOFQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Nonlinear optimal control synthesis via occupation measures</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Henrion, D. ; Lasserre, J.B. ; Savorgnan, C.</creator><creatorcontrib>Henrion, D. ; Lasserre, J.B. ; Savorgnan, C.</creatorcontrib><description>We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given OCP, using a hierarchy of linear matrix inequality (LMI) relaxations. In the second part, we extend the methodology to approximate the optimal value function on a given set and we use such a function to constructively and computationally derive an almost optimal control law. Numerical examples show the effectiveness of the approach.</description><identifier>ISSN: 0191-2216</identifier><identifier>ISBN: 9781424431236</identifier><identifier>ISBN: 1424431239</identifier><identifier>EISBN: 9781424431243</identifier><identifier>EISBN: 1424431247</identifier><identifier>DOI: 10.1109/CDC.2008.4739136</identifier><identifier>LCCN: 79-640961</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cost function ; Differential equations ; Helium ; Linear matrix inequalities ; Mathematics ; Optimal control ; Polynomials ; System testing</subject><ispartof>2008 47th IEEE Conference on Decision and Control, 2008, p.4749-4754</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4739136$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4739136$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Henrion, D.</creatorcontrib><creatorcontrib>Lasserre, J.B.</creatorcontrib><creatorcontrib>Savorgnan, C.</creatorcontrib><title>Nonlinear optimal control synthesis via occupation measures</title><title>2008 47th IEEE Conference on Decision and Control</title><addtitle>CDC</addtitle><description>We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given OCP, using a hierarchy of linear matrix inequality (LMI) relaxations. In the second part, we extend the methodology to approximate the optimal value function on a given set and we use such a function to constructively and computationally derive an almost optimal control law. Numerical examples show the effectiveness of the approach.</description><subject>Cost function</subject><subject>Differential equations</subject><subject>Helium</subject><subject>Linear matrix inequalities</subject><subject>Mathematics</subject><subject>Optimal control</subject><subject>Polynomials</subject><subject>System testing</subject><issn>0191-2216</issn><isbn>9781424431236</isbn><isbn>1424431239</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>eNpVkE1LxDAYhCO6YF33LnjJH2jNm8R84Enq-gGLXvS8JPENRrpNabrC_nsL7kXmMMxhHoYh5ApYA8DsTfvQNpwx00gtLAh1QlZWG5BcSgFcitN_WagzUjGwUHMOakEqbWslmVVwTi5K-WYziSlVkbvX3HepRzfSPExp5zoacj-NuaPl0E9fWFKhP8nRHMJ-cFPKPd2hK_sRyyVZRNcVXB19ST4e1-_tc715e3pp7zd14qCnGoJxxmgporHIgjRMRI8-huA0eBTGe4wQfYxemxicUSxw9cluLcydWUty_cdNiLgdxnnleNgefxC_vmNOFQ</recordid><startdate>20080101</startdate><enddate>20080101</enddate><creator>Henrion, D.</creator><creator>Lasserre, J.B.</creator><creator>Savorgnan, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20080101</creationdate><title>Nonlinear optimal control synthesis via occupation measures</title><author>Henrion, D. ; Lasserre, J.B. ; Savorgnan, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i217t-1c8a88743f89e0c4803fbebfcca71be38bbef1fbffb78fca860c26d059143f3f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Cost function</topic><topic>Differential equations</topic><topic>Helium</topic><topic>Linear matrix inequalities</topic><topic>Mathematics</topic><topic>Optimal control</topic><topic>Polynomials</topic><topic>System testing</topic><toplevel>online_resources</toplevel><creatorcontrib>Henrion, D.</creatorcontrib><creatorcontrib>Lasserre, J.B.</creatorcontrib><creatorcontrib>Savorgnan, C.</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 Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Henrion, D.</au><au>Lasserre, J.B.</au><au>Savorgnan, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Nonlinear optimal control synthesis via occupation measures</atitle><btitle>2008 47th IEEE Conference on Decision and Control</btitle><stitle>CDC</stitle><date>2008-01-01</date><risdate>2008</risdate><spage>4749</spage><epage>4754</epage><pages>4749-4754</pages><issn>0191-2216</issn><isbn>9781424431236</isbn><isbn>1424431239</isbn><eisbn>9781424431243</eisbn><eisbn>1424431247</eisbn><abstract>We consider nonlinear optimal control problems (OCPs) for which all problem data are polynomial. In the first part of the paper, we review how occupation measures can be used to approximate pointwise the optimal value function of a given OCP, using a hierarchy of linear matrix inequality (LMI) relaxations. In the second part, we extend the methodology to approximate the optimal value function on a given set and we use such a function to constructively and computationally derive an almost optimal control law. Numerical examples show the effectiveness of the approach.</abstract><pub>IEEE</pub><doi>10.1109/CDC.2008.4739136</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0191-2216
ispartof 2008 47th IEEE Conference on Decision and Control, 2008, p.4749-4754
issn 0191-2216
language eng
recordid cdi_ieee_primary_4739136
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Cost function
Differential equations
Helium
Linear matrix inequalities
Mathematics
Optimal control
Polynomials
System testing
title Nonlinear optimal control synthesis via occupation measures
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T15%3A27%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Nonlinear%20optimal%20control%20synthesis%20via%20occupation%20measures&rft.btitle=2008%2047th%20IEEE%20Conference%20on%20Decision%20and%20Control&rft.au=Henrion,%20D.&rft.date=2008-01-01&rft.spage=4749&rft.epage=4754&rft.pages=4749-4754&rft.issn=0191-2216&rft.isbn=9781424431236&rft.isbn_list=1424431239&rft_id=info:doi/10.1109/CDC.2008.4739136&rft.eisbn=9781424431243&rft.eisbn_list=1424431247&rft_dat=%3Cieee_6IE%3E4739136%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i217t-1c8a88743f89e0c4803fbebfcca71be38bbef1fbffb78fca860c26d059143f3f3%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=4739136&rfr_iscdi=true