kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Optimal Input Design Through Infinity Norm Minimization Using Proximal Mapping
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).ORCID iD: 0000-0003-1520-4041
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control).ORCID iD: 0000-0002-9368-3079
2021 (English)In: 2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), Institute of Electrical and Electronics Engineers (IEEE) , 2021, p. 4442-4447Conference paper, Published paper (Refereed)
Abstract [en]

To avoid non-convexity of the criterion, various relaxations are typically used in input design. For example, the input may be assumed to be stationary and the design problem may be formulated in terms of the correlation coefficients. In this contribution, we instead propose a method to directly design the input sequence. This allows to maximize the information obtained from short-time (transient) experiments using non-stationary inputs. We do this by fitting the achieved Fisher matrix to a desired target matrix in a matrix sense, using the infinity norm. The target matrix can either be the desired Fisher matrix, obtained from quality considerations of the intended use of the model, or a matrix directly representing the performance of the application. An often used quantity is the Hessian of the so called the application cost. Thus, the method is formulated as a time domain optimization problem that is non-convex. This optimization problem is solved by alternative minimization and proximal mapping, where we split the problem in three steps where in each step, the cost function is minimized in respect to one of the variables and other variables are kept fix. We repeat these three steps until convergence. The procedure of the algorithm is summarized in a pseudo code. Finally, we illustrate our method in two numerical examples.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2021. p. 4442-4447
Series
IEEE Conference on Decision and Control, ISSN 0743-1546
National Category
Probability Theory and Statistics Economics Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-313027DOI: 10.1109/CDC45484.2021.9683508ISI: 000781990303149Scopus ID: 2-s2.0-85126051725OAI: oai:DiVA.org:kth-313027DiVA, id: diva2:1662639
Conference
60th IEEE Conference on Decision and Control (CDC), DEC 13-17, 2021, ELECTR NETWORK
Note

Part of proceedings: ISBN 978-1-6654-3659-5

QC 20220601

Available from: 2022-06-01 Created: 2022-06-01 Last updated: 2023-01-17Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Parsa, JavadHjalmarsson, Håkan

Search in DiVA

By author/editor
Parsa, JavadHjalmarsson, Håkan
By organisation
Decision and Control Systems (Automatic Control)
Probability Theory and StatisticsEconomicsControl Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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