Optimal and Approximate Solutions to Linear Quadratic Regulation of a Class of Graphon Dynamical Systems
arXiv:1911.02421 · doi:10.1109/CDC40024.2019.9030095
Abstract
In this paper we study the linear quadratic regulation (LQR) problem for dynamical systems coupled over large-scale networks and obtain locally computable low-complexity solutions. The underlying large or even infinite networks are represented by graphons and the couplings appear in both the dynamics and the quadratic cost. The optimal solution is obtained first for graphon dynamical systems for the special case where the graphons are exactly characterized by finite spectral summands. The complexity of generating these control solutions involves solving d+1 scalar Riccati equations where d is the number of non-zero eigenvalues in the spectral representation. Based on this, we provide a suboptimal low-complexity solution for problems with general graphon couplings via spectral approximations and analyze the performance under the approximate control. Finally, a numerical example is given to illustrate the explicit solution and demonstrate the simplicity of the solution.
arXiv comment7 pages, 58th IEEE Conference on Decision and Control (CDC 2019)
References in corpus (1)
Cited by in corpus (4)
- Graphon Control of Large-scale Networks of Linear Systems
- Subspace Decomposition for Graphon LQR: Applications to VLSNs of Harmonic Oscillators
- Spectral Representations of Graphons in Very Large Network Systems Control
- An Overview of Some Extensions of Mean Field Games beyond Perfect Homogeneity and Anonymity