2017IFAC-PapersOnLineOpen access

Discrete-Time Dynamical Networks with Diagonal Controllability Gramian

Shiyu Zhao, Fabio Pasqualetti

Open full text 12 citations

Abstract

The controllability Gramian of a dynamical network carries rich information of the fundamental properties of the network. How to identify the connections from these fundamental properties to the network topology and weights is of great interest. It is, however, very challenging to do that because the Gramian is an extremely complicated function of the network topology and weights. In this paper, we consider the simplest case where the Gramian is diagonal. One of the main contributions of this paper is to prove the necessary and sufficient graphical conditions for a discrete-time dynamical network to feature a diagonal Gramian. The explicit relations between the values of the diagonal entries of the Gramian and the network weights are also established. The proposed results may be used to design networks with desired control energy and robustness performance.

About this research paper

What this paper is about

The controllability Gramian of a dynamical network carries rich information of the fundamental properties of the network. How to identify the connections from these fundamental properties to the network topology and weights is of great interest. It is, however, very challenging to do that because the Gramian is an extremely complicated function of the network topology and weights. In this paper, we consider the simplest case where the Gramian is diagonal. One of the main contributions of this paper is to prove the necessary and sufficient graphical conditions for a discrete-time dynamical network to feature a diagonal Gramian. The explicit relations between the values of the diagonal entries of the Gramian and the network weights are also established. The proposed results may be used to design networks with desired control energy and robustness performance.

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The controllability Gramian of a dynamical network carries rich information of the fundamental properties of the network. How to identify the connections from these fundamental properties to the network topology and weights is of great interest. It is, however, very challenging to do that because the Gramian is an extremely complicated function of the network topology and weights. In this paper, we consider the simplest case where the Gramian is diagonal. One of the main contributions of this paper is to prove the necessary and sufficient graphical conditions for a discrete-time dynamical network to feature a diagonal Gramian. The explicit relations between the values of the diagonal entries of the Gramian and the network weights are also established. The proposed results may be used to design networks with desired control energy and robustness performance.

Key concepts: Gramian matrix, Controllability Gramian, Controllability, Diagonal, Network controllability, Topology (electrical circuits), Mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Discrete-Time Dynamical Networks with Diagonal Controllability Gramian — Research Paper | ScholarLens