Loading…
Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation
The vertices of a polytopic LPV/qLPV model determine the feasibility of any linear matrix inequality (LMI) based control design as well as the achievable control performance, since the polytope typically includes not only the actual system dynamics. This paper proposes a powerful method to determine...
Saved in:
Published in: | Asian journal of control 2017-01, Vol.19 (1), p.289-301 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23 |
---|---|
cites | cdi_FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23 |
container_end_page | 301 |
container_issue | 1 |
container_start_page | 289 |
container_title | Asian journal of control |
container_volume | 19 |
creator | Kuti, József Galambos, Péter Baranyi, Péter |
description | The vertices of a polytopic LPV/qLPV model determine the feasibility of any linear matrix inequality (LMI) based control design as well as the achievable control performance, since the polytope typically includes not only the actual system dynamics. This paper proposes a powerful method to determine suitable polytopic qLPV Tensor‐Product model forms that allows for fine tuning through constraints on the locations of the vertices. The paper shows that these tuning methods are capable of effectively influencing the closed‐loop control performance results from LMI‐based multi‐objective optimisation. The advantages of the proposed methods are their tractability, low computational complexity, as well as their determinism. The key idea behind the proposed methods is to determine vertices in each decoupled parameter‐dimensions of the TP model in such a way that they form a minimal volume enclosing simplex fulfilling further fine tuning conditions on its shape. This is achieved based on the extension of the Minimal Volume Simplex Analysis (MVSA) method, where the volume of the enclosing simplex polytope is minimized by applying Sequential Quadratic Programming with majorization minimization strategy extended with a set of additional constraints influencing the location of certain vertices according to physically established considerations. Besides the comprehensive presentation of the proposed design methodology an expressive numerical example is provided to demonstrate its effectiveness and usability. |
doi_str_mv | 10.1002/asjc.1375 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1855847155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4294490921</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23</originalsourceid><addsrcrecordid>eNp1kF1LwzAUhoMoOKcX_oOAN-6iW9I0_bgcQ6ey4qBztyFNUu1Im5q0aP-93bpbr87h5XnPgQeAe4zmGCF_wd1BzDGJ6AWY4IQEXogScjnsNMReHPr0Gtw4d0AoxCSmE9CkZV1WXMO90V2lYFZWjVa_8DHdZzO4NbpvTVMKmBqpNFyrWlnelqaGvJYw5XXZdHoMUtV-GWm0-exhYSzcbc-lneW1G5LqxN2Cq4Jrp-7Ocwo-np92qxdv875-XS03nvCTiHo4wjnK_RyFAeKCiIBLIkQQISpymSShkCHKMRcBKQqBYxn4kVAiipGPE4WlT6bgYbzbWPPdKdeyg-lsPbxkOKY0DiJM6UDNRkpY45xVBWvsoMP2DCN2FMqOQtlR6MAuRvan1Kr_H2TL7G11avwB-O54uA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1855847155</pqid></control><display><type>article</type><title>Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation</title><source>Wiley</source><creator>Kuti, József ; Galambos, Péter ; Baranyi, Péter</creator><creatorcontrib>Kuti, József ; Galambos, Péter ; Baranyi, Péter</creatorcontrib><description>The vertices of a polytopic LPV/qLPV model determine the feasibility of any linear matrix inequality (LMI) based control design as well as the achievable control performance, since the polytope typically includes not only the actual system dynamics. This paper proposes a powerful method to determine suitable polytopic qLPV Tensor‐Product model forms that allows for fine tuning through constraints on the locations of the vertices. The paper shows that these tuning methods are capable of effectively influencing the closed‐loop control performance results from LMI‐based multi‐objective optimisation. The advantages of the proposed methods are their tractability, low computational complexity, as well as their determinism. The key idea behind the proposed methods is to determine vertices in each decoupled parameter‐dimensions of the TP model in such a way that they form a minimal volume enclosing simplex fulfilling further fine tuning conditions on its shape. This is achieved based on the extension of the Minimal Volume Simplex Analysis (MVSA) method, where the volume of the enclosing simplex polytope is minimized by applying Sequential Quadratic Programming with majorization minimization strategy extended with a set of additional constraints influencing the location of certain vertices according to physically established considerations. Besides the comprehensive presentation of the proposed design methodology an expressive numerical example is provided to demonstrate its effectiveness and usability.</description><identifier>ISSN: 1561-8625</identifier><identifier>EISSN: 1934-6093</identifier><identifier>DOI: 10.1002/asjc.1375</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc</publisher><subject>Closed loop systems ; Control systems ; Methods ; Quadratic programming ; Systems and control, TP model transformation, polytopic LPV/qLPV modelling, linear matrix inequality</subject><ispartof>Asian journal of control, 2017-01, Vol.19 (1), p.289-301</ispartof><rights>2016 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd</rights><rights>2017 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23</citedby><cites>FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23</cites><orcidid>0000-0002-2319-0551 ; 0000-0003-2795-9783</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Kuti, József</creatorcontrib><creatorcontrib>Galambos, Péter</creatorcontrib><creatorcontrib>Baranyi, Péter</creatorcontrib><title>Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation</title><title>Asian journal of control</title><description>The vertices of a polytopic LPV/qLPV model determine the feasibility of any linear matrix inequality (LMI) based control design as well as the achievable control performance, since the polytope typically includes not only the actual system dynamics. This paper proposes a powerful method to determine suitable polytopic qLPV Tensor‐Product model forms that allows for fine tuning through constraints on the locations of the vertices. The paper shows that these tuning methods are capable of effectively influencing the closed‐loop control performance results from LMI‐based multi‐objective optimisation. The advantages of the proposed methods are their tractability, low computational complexity, as well as their determinism. The key idea behind the proposed methods is to determine vertices in each decoupled parameter‐dimensions of the TP model in such a way that they form a minimal volume enclosing simplex fulfilling further fine tuning conditions on its shape. This is achieved based on the extension of the Minimal Volume Simplex Analysis (MVSA) method, where the volume of the enclosing simplex polytope is minimized by applying Sequential Quadratic Programming with majorization minimization strategy extended with a set of additional constraints influencing the location of certain vertices according to physically established considerations. Besides the comprehensive presentation of the proposed design methodology an expressive numerical example is provided to demonstrate its effectiveness and usability.</description><subject>Closed loop systems</subject><subject>Control systems</subject><subject>Methods</subject><subject>Quadratic programming</subject><subject>Systems and control, TP model transformation, polytopic LPV/qLPV modelling, linear matrix inequality</subject><issn>1561-8625</issn><issn>1934-6093</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp1kF1LwzAUhoMoOKcX_oOAN-6iW9I0_bgcQ6ey4qBztyFNUu1Im5q0aP-93bpbr87h5XnPgQeAe4zmGCF_wd1BzDGJ6AWY4IQEXogScjnsNMReHPr0Gtw4d0AoxCSmE9CkZV1WXMO90V2lYFZWjVa_8DHdZzO4NbpvTVMKmBqpNFyrWlnelqaGvJYw5XXZdHoMUtV-GWm0-exhYSzcbc-lneW1G5LqxN2Cq4Jrp-7Ocwo-np92qxdv875-XS03nvCTiHo4wjnK_RyFAeKCiIBLIkQQISpymSShkCHKMRcBKQqBYxn4kVAiipGPE4WlT6bgYbzbWPPdKdeyg-lsPbxkOKY0DiJM6UDNRkpY45xVBWvsoMP2DCN2FMqOQtlR6MAuRvan1Kr_H2TL7G11avwB-O54uA</recordid><startdate>201701</startdate><enddate>201701</enddate><creator>Kuti, József</creator><creator>Galambos, Péter</creator><creator>Baranyi, Péter</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0002-2319-0551</orcidid><orcidid>https://orcid.org/0000-0003-2795-9783</orcidid></search><sort><creationdate>201701</creationdate><title>Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation</title><author>Kuti, József ; Galambos, Péter ; Baranyi, Péter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Closed loop systems</topic><topic>Control systems</topic><topic>Methods</topic><topic>Quadratic programming</topic><topic>Systems and control, TP model transformation, polytopic LPV/qLPV modelling, linear matrix inequality</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kuti, József</creatorcontrib><creatorcontrib>Galambos, Péter</creatorcontrib><creatorcontrib>Baranyi, Péter</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Asian journal of control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kuti, József</au><au>Galambos, Péter</au><au>Baranyi, Péter</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation</atitle><jtitle>Asian journal of control</jtitle><date>2017-01</date><risdate>2017</risdate><volume>19</volume><issue>1</issue><spage>289</spage><epage>301</epage><pages>289-301</pages><issn>1561-8625</issn><eissn>1934-6093</eissn><abstract>The vertices of a polytopic LPV/qLPV model determine the feasibility of any linear matrix inequality (LMI) based control design as well as the achievable control performance, since the polytope typically includes not only the actual system dynamics. This paper proposes a powerful method to determine suitable polytopic qLPV Tensor‐Product model forms that allows for fine tuning through constraints on the locations of the vertices. The paper shows that these tuning methods are capable of effectively influencing the closed‐loop control performance results from LMI‐based multi‐objective optimisation. The advantages of the proposed methods are their tractability, low computational complexity, as well as their determinism. The key idea behind the proposed methods is to determine vertices in each decoupled parameter‐dimensions of the TP model in such a way that they form a minimal volume enclosing simplex fulfilling further fine tuning conditions on its shape. This is achieved based on the extension of the Minimal Volume Simplex Analysis (MVSA) method, where the volume of the enclosing simplex polytope is minimized by applying Sequential Quadratic Programming with majorization minimization strategy extended with a set of additional constraints influencing the location of certain vertices according to physically established considerations. Besides the comprehensive presentation of the proposed design methodology an expressive numerical example is provided to demonstrate its effectiveness and usability.</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/asjc.1375</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-2319-0551</orcidid><orcidid>https://orcid.org/0000-0003-2795-9783</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1561-8625 |
ispartof | Asian journal of control, 2017-01, Vol.19 (1), p.289-301 |
issn | 1561-8625 1934-6093 |
language | eng |
recordid | cdi_proquest_journals_1855847155 |
source | Wiley |
subjects | Closed loop systems Control systems Methods Quadratic programming Systems and control, TP model transformation, polytopic LPV/qLPV modelling, linear matrix inequality |
title | Minimal Volume Simplex (MVS) Polytopic Model Generation and Manipulation Methodology for TP Model Transformation |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A39%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimal%20Volume%20Simplex%20(MVS)%20Polytopic%20Model%20Generation%20and%20Manipulation%20Methodology%20for%20TP%20Model%20Transformation&rft.jtitle=Asian%20journal%20of%20control&rft.au=Kuti,%20J%C3%B3zsef&rft.date=2017-01&rft.volume=19&rft.issue=1&rft.spage=289&rft.epage=301&rft.pages=289-301&rft.issn=1561-8625&rft.eissn=1934-6093&rft_id=info:doi/10.1002/asjc.1375&rft_dat=%3Cproquest_cross%3E4294490921%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2975-171b0b2b0640ac3c4ad3cc4705cbd996cd60b1ac43ffc18d427cec780219e1d23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1855847155&rft_id=info:pmid/&rfr_iscdi=true |