Title
The controllability Gramian of lattice graphs.
Abstract
The control of networked dynamical systems continues to receive much attention across the engineering and scientific research fields. Here, we investigate the control of lattice systems which provides analytical insight into the relationship between network structure and controllability. First we derive the exact expression for the individual elements of the controllability Gramian of infinite lattice systems. Second, we focus on nearest neighbor lattices for which the distance between nodes appears in the expression for the controllability Gramian. We show that common control energy metrics scale exponentially with respect to the maximum of all the distances between driver nodes and target nodes.
Year
DOI
Venue
2020
10.1016/j.automatica.2020.108833
Automatica
Keywords
Field
DocType
Networks,Linear optimal control,Lattices,Lyapunov equation,Discrete Fourier transforms
k-nearest neighbors algorithm,Topology,Graph,Mathematical optimization,Lattice (order),Controllability,Dynamical systems theory,Mathematics,Controllability Gramian,Energy metrics,Network structure
Journal
Volume
Issue
ISSN
114
1
0005-1098
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Isaac S. Klickstein112.39
Francesco Sorrentino2349.90