Optimal Design of Switched Networks of Positive Linear Systems via Geometric Programming
From MaRDI portal
Publication:5358535
Abstract: In this paper, we propose an optimization framework to design a network of positive linear systems whose structure switches according to a Markov process. The optimization framework herein proposed allows the network designer to optimize the coupling elements of a directed network, as well as the dynamics of the nodes in order to maximize the stabilization rate of the network and/or the disturbance rejection against an exogenous input. The cost of implementing a particular network is modeled using posynomial cost functions, which allow for a wide variety of modeling options. In this context, we show that the cost-optimal network design can be efficiently found using geometric programming in polynomial time. We illustrate our results with a practical problem in network epidemiology, namely, the cost-optimal stabilization of the spread of a disease over a time-varying contact network.
Cited in
(8)- Second-order moment-closure for tighter epidemic thresholds
- Block sparse design of distributed controllers for dynamical network systems
- \(N\)-intertwined SIS epidemic model with Markovian switching
- Stability analysis and \(\mathcal{L}_1\)-gain characterization for switched positive systems under dwell-time constraint
- State-feedback control of positive switching systems with Markovian jumps
- Homogenized first-moment analysis of two-time-scale positive Markov jump linear systems
- Sign-stability of positive Markov jump linear systems
- Probability rate optimization of positive Markov jump linear systems via DC programming
This page was built for publication: Optimal Design of Switched Networks of Positive Linear Systems via Geometric Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358535)