On a Relaxation of Time-Varying Actuator Placement

We consider the time-varying actuator placement in continuous time, where the goal is to maximize the trace of the controllability Grammian. A natural relaxation of the problem is to allow the binary {0, 1} variable indicating whether an actuator is used at a given time to take on values in the clos...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE control systems letters 2020-07, Vol.4 (3), p.656-661
1. Verfasser:	Olshevsky, Alex
Format:	Artikel
Sprache:	eng
Schlagworte:	Actuators Control of networks Controllability Level set network analysis and control Optimal scheduling optimization Time-varying systems
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	661
container_issue	3
container_start_page	656
container_title	IEEE control systems letters
container_volume	4
creator	Olshevsky, Alex
description	We consider the time-varying actuator placement in continuous time, where the goal is to maximize the trace of the controllability Grammian. A natural relaxation of the problem is to allow the binary {0, 1} variable indicating whether an actuator is used at a given time to take on values in the closed interval [0, 1]. We show that all optimal solutions of both the original and the relaxed problems can be given via an explicit formula, and that, as long as the input matrix has no zero columns, the solutions sets of the original and relaxed problem coincide.
doi_str_mv	10.1109/LCSYS.2020.2990099
format	Article
fullrecord	<record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_9076635</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9076635</ieee_id><sourcerecordid>10_1109_LCSYS_2020_2990099</sourcerecordid><originalsourceid>FETCH-LOGICAL-c267t-6828b87c690d9f11e28e7fc35ade3104ef68820309394573f46a876566977f3</originalsourceid><addsrcrecordid>eNpNj9tKAzEURYMoWGp_QF_yAzOeJJPLeSyDNyhUnCL4FGJ6IiNzkZkR9O9tbRGf9n5Zm70YuxSQCwF4vSqrlyqXICGXiACIJ2wmC6szUWhz-q-fs8U4vgOAcNKCxBmT644H_kRN-ApT3Xe8T3xTt5Q9h-G77t74Mk6fYeoH_tiESC110wU7S6EZaXHMOatubzblfbZa3z2Uy1UWpbFTZpx0r85Gg7DFJARJRzZFpcOWlICCknFOggJUWGirUmGCs0Ybg9YmNWfysBqHfhwHSv5jqNvdKS_A77X9r7bfa_uj9g66OkA1Ef0BCNYYpdUPnjdRtw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On a Relaxation of Time-Varying Actuator Placement</title><source>IEEE Electronic Library (IEL)</source><creator>Olshevsky, Alex</creator><creatorcontrib>Olshevsky, Alex</creatorcontrib><description>We consider the time-varying actuator placement in continuous time, where the goal is to maximize the trace of the controllability Grammian. A natural relaxation of the problem is to allow the binary {0, 1} variable indicating whether an actuator is used at a given time to take on values in the closed interval [0, 1]. We show that all optimal solutions of both the original and the relaxed problems can be given via an explicit formula, and that, as long as the input matrix has no zero columns, the solutions sets of the original and relaxed problem coincide.</description><identifier>ISSN: 2475-1456</identifier><identifier>EISSN: 2475-1456</identifier><identifier>DOI: 10.1109/LCSYS.2020.2990099</identifier><identifier>CODEN: ICSLBO</identifier><language>eng</language><publisher>IEEE</publisher><subject>Actuators ; Control of networks ; Controllability ; Level set ; network analysis and control ; Optimal scheduling ; optimization ; Time-varying systems</subject><ispartof>IEEE control systems letters, 2020-07, Vol.4 (3), p.656-661</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c267t-6828b87c690d9f11e28e7fc35ade3104ef68820309394573f46a876566977f3</citedby><cites>FETCH-LOGICAL-c267t-6828b87c690d9f11e28e7fc35ade3104ef68820309394573f46a876566977f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9076635$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9076635$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Olshevsky, Alex</creatorcontrib><title>On a Relaxation of Time-Varying Actuator Placement</title><title>IEEE control systems letters</title><addtitle>LCSYS</addtitle><description>We consider the time-varying actuator placement in continuous time, where the goal is to maximize the trace of the controllability Grammian. A natural relaxation of the problem is to allow the binary {0, 1} variable indicating whether an actuator is used at a given time to take on values in the closed interval [0, 1]. We show that all optimal solutions of both the original and the relaxed problems can be given via an explicit formula, and that, as long as the input matrix has no zero columns, the solutions sets of the original and relaxed problem coincide.</description><subject>Actuators</subject><subject>Control of networks</subject><subject>Controllability</subject><subject>Level set</subject><subject>network analysis and control</subject><subject>Optimal scheduling</subject><subject>optimization</subject><subject>Time-varying systems</subject><issn>2475-1456</issn><issn>2475-1456</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNj9tKAzEURYMoWGp_QF_yAzOeJJPLeSyDNyhUnCL4FGJ6IiNzkZkR9O9tbRGf9n5Zm70YuxSQCwF4vSqrlyqXICGXiACIJ2wmC6szUWhz-q-fs8U4vgOAcNKCxBmT644H_kRN-ApT3Xe8T3xTt5Q9h-G77t74Mk6fYeoH_tiESC110wU7S6EZaXHMOatubzblfbZa3z2Uy1UWpbFTZpx0r85Gg7DFJARJRzZFpcOWlICCknFOggJUWGirUmGCs0Ybg9YmNWfysBqHfhwHSv5jqNvdKS_A77X9r7bfa_uj9g66OkA1Ef0BCNYYpdUPnjdRtw</recordid><startdate>202007</startdate><enddate>202007</enddate><creator>Olshevsky, Alex</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202007</creationdate><title>On a Relaxation of Time-Varying Actuator Placement</title><author>Olshevsky, Alex</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c267t-6828b87c690d9f11e28e7fc35ade3104ef68820309394573f46a876566977f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Actuators</topic><topic>Control of networks</topic><topic>Controllability</topic><topic>Level set</topic><topic>network analysis and control</topic><topic>Optimal scheduling</topic><topic>optimization</topic><topic>Time-varying systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Olshevsky, Alex</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE control systems letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Olshevsky, Alex</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On a Relaxation of Time-Varying Actuator Placement</atitle><jtitle>IEEE control systems letters</jtitle><stitle>LCSYS</stitle><date>2020-07</date><risdate>2020</risdate><volume>4</volume><issue>3</issue><spage>656</spage><epage>661</epage><pages>656-661</pages><issn>2475-1456</issn><eissn>2475-1456</eissn><coden>ICSLBO</coden><abstract>We consider the time-varying actuator placement in continuous time, where the goal is to maximize the trace of the controllability Grammian. A natural relaxation of the problem is to allow the binary {0, 1} variable indicating whether an actuator is used at a given time to take on values in the closed interval [0, 1]. We show that all optimal solutions of both the original and the relaxed problems can be given via an explicit formula, and that, as long as the input matrix has no zero columns, the solutions sets of the original and relaxed problem coincide.</abstract><pub>IEEE</pub><doi>10.1109/LCSYS.2020.2990099</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2475-1456
ispartof	IEEE control systems letters, 2020-07, Vol.4 (3), p.656-661
issn	2475-1456 2475-1456
language	eng
recordid	cdi_ieee_primary_9076635
source	IEEE Electronic Library (IEL)
subjects	Actuators Control of networks Controllability Level set network analysis and control Optimal scheduling optimization Time-varying systems
title	On a Relaxation of Time-Varying Actuator Placement
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T16%3A18%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20a%20Relaxation%20of%20Time-Varying%20Actuator%20Placement&rft.jtitle=IEEE%20control%20systems%20letters&rft.au=Olshevsky,%20Alex&rft.date=2020-07&rft.volume=4&rft.issue=3&rft.spage=656&rft.epage=661&rft.pages=656-661&rft.issn=2475-1456&rft.eissn=2475-1456&rft.coden=ICSLBO&rft_id=info:doi/10.1109/LCSYS.2020.2990099&rft_dat=%3Ccrossref_RIE%3E10_1109_LCSYS_2020_2990099%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9076635&rfr_iscdi=true