Optimization of the H-norm of Dynamic Flow Networks

Alexander Johansson, Jieqiang Wei*, Henrik Sandberg, Karl H. Johansson*, Jie Chen

*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

4 Citations (Scopus)

Abstract

In this paper, we study the H- norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the H- norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the H- norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the H- norm, which is in terms of the algebraic connectivity of the graph on which the distribution network is defined.
Original languageEnglish
Title of host publication2018 Annual American Control Conference (ACC)
PublisherIEEE
Pages1280-1285
ISBN (Electronic)978-1-5386-5428-6
ISBN (Print)978-1-5386-5429-3
DOIs
Publication statusPublished - 2018
Event1st Annual American Control Conference (ACC 2018) - Wisconsin Center, Milwaukee, United States
Duration: 27 Jun 201829 Jun 2018
http://acc2018.a2c2.org

Publication series

NameAmerican Control Conference (ACC)
PublisherIEEE
ISSN (Print)0743-1619
ISSN (Electronic)2378-5861

Conference

Conference1st Annual American Control Conference (ACC 2018)
PlaceUnited States
CityMilwaukee
Period27/06/1829/06/18
Internet address

Research Keywords

  • SYSTEMS

Fingerprint

Dive into the research topics of 'Optimization of the H-norm of Dynamic Flow Networks'. Together they form a unique fingerprint.

Cite this