2019 IEEE 58th Conference on Decision and Control (CDC) 2019
DOI: 10.1109/cdc40024.2019.9029266
|View full text |Cite
|
Sign up to set email alerts
|

Networked control of coupled subsystems: Spectral decomposition and low-dimensional solutions

Abstract: In this paper, we investigate optimal networked control of coupled subsystems where the dynamics and the cost couplings depend on an underlying undirected weighted graph. The graph coupling matrix may be the adjacency matrix, the Laplacian matrix, or any other symmetric matrix corresponding to the underlying graph. We use the spectral decomposition of the graph coupling matrix to decompose the overall system into (L + 1) systems with decoupled dynamics and cost, where L is the rank of the coupling matrix. Cons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 38 publications
0
4
0
Order By: Relevance
“…See [26], [38] for the details of the solution method, which provides solutions to a more general class of graphon control problems with network couplings in states, controls and costs.…”
Section: B Minimum Energy Graphon State-to-state Controlmentioning
confidence: 99%
“…See [26], [38] for the details of the solution method, which provides solutions to a more general class of graphon control problems with network couplings in states, controls and costs.…”
Section: B Minimum Energy Graphon State-to-state Controlmentioning
confidence: 99%
“…We want to reduce the infection level, limit the actions cost and make sure that subpopulations on the network receive almost the same amount of resources as their weighted neighbors for equity purposes. This forms a good example to illustrate the polynomial structures appearing in the cost functions in [14], [38].…”
Section: Controlling Epidemic Processes On Network Based On Specmentioning
confidence: 99%
“…The number L of non-zero eigenvalues can be much smaller than N . The optimal solution [38] to be executed at community i is given by…”
Section: Controlling Epidemic Processes On Network Based On Specmentioning
confidence: 99%
“…The solution method was first developed for linear quadratic mean-field control problems in [12], [20] (where couplings are of rank one). This idea is further generalized and applied to the control of graphon and network coupled systems in [4], [21], [22]. A closely related recent paper [23] discusses decoupling linear quadratic control problems based on state transformations (or coordinate transformation) to formulate equivalent problems and applies it to generate low-complexity solutions to costsensitive linear quadratic control problems with mean-field couplings.…”
Section: Introductionmentioning
confidence: 99%