Next Article in Journal
A Comparison Result for the Nabla Fractional Difference Operator
Previous Article in Journal
A Newton-like Midpoint Method for Solving Equations in Banach Space
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Controllability of a Class of Heterogeneous Networked Systems

by
Abhijith Ajayakumar
and
Raju K. George
*,†
Department of Mathematics, Indian Institute of Space Science and Technology, Valiyamala, Thiruvananthapuram 695547, Kerala, India
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Foundations 2023, 3(2), 167-180; https://doi.org/10.3390/foundations3020015
Submission received: 31 December 2022 / Revised: 22 February 2023 / Accepted: 23 March 2023 / Published: 6 April 2023
(This article belongs to the Section Mathematical Sciences)

Abstract

:
This paper examines the controllability of a class of heterogeneous networked systems where the nodes are linear time-invariant systems (LTI), and the network topology is triangularizable. The literature contains necessary and sufficient conditions for the controllability of such systems where the control input matrices are identical in each node. Here, we extend this result to a class of heterogeneous systems where the control input matrices are distinct in each node. Additionally, we discuss the controllability of a more general system with triangular network topology and obtain necessary and sufficient conditions for controllability. Theoretical results are supplemented with numerical examples.

1. Introduction

The controllability of networked dynamical systems remains one of the most challenging problems in the field of control theory. The prevalence of networks of dynamical systems in numerous engineering and technology fields supports the rising emphasis placed on the controllability of networked systems [1,2,3]. In System and Control literature, there are different notions of controllability, including state controllability, structural controllability, etc. The classical idea of controllability, introduced by R. E. Kalman [4] in the 1960s, deals with the ability of a single high-dimensional system to steer itself from an arbitrary initial state to a desired final state, whereas, structural controllability, introduced by Lin [5] in 1974, attempts to obtain some numerical values for the parameters in system matrices describing the system’s dynamics so that it is controllable in the sense of Kalman. Using rank conditions, spectral features, graph-theoretic properties, etc., many authors have explored controllability criteria for such systems over the past few decades [6,7,8,9,10,11,12,13]. The traditional theory of control paved the way for an advanced approach applicable to complex networks with more than one interconnected dynamical system. With time, it was evident that modelling complicated real-life systems required large-scale networks, and the controllability of such systems became unavoidable [14,15,16,17].
Over the years, several approaches have been employed to study the controllability of a dynamical system. Zhou [18] studied the controllability and observability of networked systems having different dynamics in each subsystem. Based on the Popov–Belevitch–Hautus(PBH) test, he obtained some necessary and sufficient conditions for controllability which depended upon the dynamics of the subsystems and the network topology. Wang et al. [19] proposed a set of necessary conditions for the controllability of a homogeneous LTI networked system that required solving matrix equations. Additionally, conditions were derived that can be used to analyze the controllability of the networked system based on network topology, node dynamics, external control inputs, and inner interactions. In Wang L. et al. [19], the interactions between connected nodes are performed through high-dimensional inputs and outputs of the node dynamics. Later, Wang L. et al. [20] studied the controllability of homogeneous networked LTI systems having one-dimensional communication. They obtained a necessary and sufficient condition for the controllability of such systems along with some controllability results over specific network topologies, such as a chain, tree, star, etc. A relatively simple, less computational method for the controllability of homogeneous networked LTI systems was given by Hao et al. [21] in 2018 using spectral properties. Compared with Wang L. et al. [19], the conditions are easy to verify as they do not involve solving matrix equations. All these works discussed the controllability of a networked system with nodes having identical dynamics. However, in real-life situations, the individual nodes may not always have the same dynamics. Controllability of networked systems with heterogeneous dynamics poses a fascinating challenge as the intrinsic dynamics of individual nodes add to the complexity contributed by the network topology. Wang P. et al. [22] tried to extend the results obtained by Wang L. et al. [19] that were for homogeneous systems to heterogeneous systems. Some necessary conditions for controllability were obtained based on the network topology and the subsystem dynamics. Based on this work, Xiang et al. [23] derived necessary and sufficient conditions for controllability of a particular class of heterogeneous systems. Based on the results of Xiang et al. [23], Ajayakumar et al. [24] derived some necessary conditions for the controllability of heterogeneous systems. Using the idea of the determinant factor and the Smith normal form, a necessary and sufficient condition for controllability was derived by Kong et al. [25] for a general heterogeneous networked system. However, the result is difficult to verify as it involves significant computation. Ajayakumar et al. [26] extended the result of Hao et al. [21] that was for the controllability of homogeneous systems to a particular class of heterogeneous systems with identical control input matrices.
In this work, we extend the result in [26] to a class of heterogeneous networked systems, where the control input matrix is non-identical in each node. We also examine the controllability of a more general heterogeneous networked system over some specific network topologies. Necessary and sufficient conditions for the controllability of such systems are obtained. The rest of the paper is arranged as follows. Some preliminary information is given in Section 2. The controllability problem is formulated in Section 3. Section 4 presents the necessary and sufficient conditions for the controllability of the heterogeneous networked system formulated in Section 3. It also provides some controllability results over some specific topologies. Examples are provided to substantiate the derived results. Section 5 concludes the study and outlines the future scope of the research.

2. Preliminaries

In this paper, we use the following notations. I denotes the identity matrix and { e 1 , e 2 , , e n } represents the canonical basis for R n . Let d i a g { a 1 , a 2 , , a n } denote diagonal matrix of order n with diagonal entries a 1 , a 2 , , a n , and u p p e r t r i a n g { a 1 , a 2 , , a n } denotes an upper triangular matrix of the form
a 1 * * * 0 a 2 * * 0 0 a 3 * 0 0 0 a n
Let σ ( A ) denotes the eigen spectrum of a matrix A. The following lemmas will be used in the subsequent sections of this paper.
Lemma 1
([27]). Let A and B be similar matrices, that is, there exists a non-singular matrix P, such that P B P 1 = A . If ν is a left eigenvector of A with respect to the eigenvalue λ, then ν P is an eigenvector of B with respect to the eigenvalue λ.
Lemma 2
([28]). Let A B denotes the Kronecker product of two matrices A and B. We use the following properties of Kronecker product in this paper.
(i) 
( A B ) ( C D ) = ( A C B D ) .
(ii) 
( A B ) 1 = A 1 B 1 if A and B are invertible.
(iii) 
( A + B ) C = A C + B C .
(iv) 
A ( B + C ) = A B + A C .
(v) 
A B = 0 if and only if A = 0 or B = 0 .
Lemma 3
([29]). A linear time-invariant control system characterized by the pair of matrices ( A , B ) is controllable if, and only if, left eigenvectors of A are not orthogonal to columns of B, i.e., ν A = λ ν implies that ν B 0 .

3. Model Formulation

Consider a heterogeneous networked linear time-invariant system with N nodes, where the i t h node is described by the following differential equation:
x i ˙ ( t ) = A i x i ( t ) + j = 1 N c i j H x j ( t ) + d i B i u i ( t ) , i = 1 , 2 , , N
where, x i ( t ) R n is the state vector and u i ( t ) R m is the external control vector. A i is an n × n matrix and B i is an n × m matrix called the state matrix and the control matrix of node i, respectively.
d i = 1 , i f n o d e i i s u n d e r c o n t r o l 0 , o t h e r w i s e
The connection strength between the nodes i and j is given by c i j R . If there is a communication from node j to node i, c i j 0 and otherwise, c i j = 0 , i , j = 1 , 2 , , N . The n × n matrix H denotes the inner coupling matrix describing the interconnections among the states x j , j = 1 , 2 , , N of the nodes.
The network topology and external input channels of the networked system (1), are given by the N × N matrices
C = c i j a n d D = d i a g { d 1 , d 2 , , d N }
respectively. If we denote the state matrix and the total external control input of the networked system (1) by X = x 1 T , , x N T T and U = u 1 T , , u N T T , respectively, using the Kronecker product notation, (1) can be reduced into the following compact form:
X ˙ ( t ) = F X ( t ) + G U ( t )
with,
F = A + C H , G = ( D I ) B
where A = b l o c k d i a g { A 1 , A 2 , , A N } and B = b l o c k d i a g { B 1 , B 2 , , B N } . If the inner coupling matrix is also different in each node, i.e., if the dynamics of the i t h node is given by
x i ˙ ( t ) = A i x i ( t ) + j = 1 N c i j H i x j ( t ) + d i B i u i ( t ) , i = 1 , 2 , , N
the networked system can be reduced to the compact form (3), where
F = A 1 + c 11 H 1 c 12 H 1 c 1 N H 1 c 21 H 2 A 2 + c 22 H 2 c 2 N H 2 c N 1 H N c N 2 H N A N + c N N H N
and G = ( D I ) B .

4. Controllability Results in a General Network Topology

Ajayakumar et al. [26] studied the controllability of (3) when the network topology is triangularizable, and the system parameter matrices satisfy certain conditions. There the control input matrices were identical in each node. Here, we will extend this result to a system where each node has different control input matrices.
We find that there exists a non-singular matrix T, such that T C T 1 = J , where J = u p p e r t r i a n g { λ 1 , λ 2 , , λ N } is the Jordan Canonical Form of C. Let σ ( A i + λ i H ) = { μ i 1 , , μ i q i } denotes the set of eigenvalues of A i + λ i H , i = 1 , 2 , , N and ξ i j k , k = 1 , , γ i j be the left eigenvectors of A i + λ i H corresponding to μ i j , j = 1 , , q i , i = 1 , , N , where γ i j 1 is the geometric multiplicity of the eigenvalue μ i j . We will make use of the following theorem.
Theorem 1
([26]). Let T be the triangularizing matrix for the network topology matrix C and suppose T I commutes with A. Let ( μ i j , ξ i j k ) denotes the left eigenpair of A i + λ i H . Then the following statements hold true.
(i) 
The eigenspectrum of F is the union of eigenspectrum of A i + λ i H , where, i = 1 , 2 , , N . That is,
σ ( F ) = i = 1 N σ ( A i + λ i H ) = { μ 1 1 , , μ 1 q 1 , , μ N 1 , , μ N q N }
(ii) 
If J is a diagonal matrix, then e i T ξ i j k , k = 1 , , γ i j are the left eigenvectors of F corresponding to the eigenvalue μ i j , j = 1 , , q i , i = 1 , , N .
(iii) 
If J contains a Jordan block of order l 2 for some eigenvalue λ i 0 of C with ξ i j k H = 0 for all i = i 0 , i 0 + 1 , , i 0 + l 1 , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , then e i T ξ i j k , k = 1 , , γ i j are the left eigenvectors of F corresponding to the eigenvalue μ i j , i = 1 , 2 , , N , j = 1 , 2 , , q i .
With the aid of the above result, we can prove the following necessary and sufficient conditions for controllability of the networked system (3).
Theorem 2.
Let T be a non-singular matrix triangularizing matrix C such that T I commutes with A. If J contains a Jordan block of order l 2 corresponding to the eigenvalue λ i 0 of C, then assume that ξ i j k H = 0 for all i = i 0 , i 0 + 1 , , i 0 + l 1 , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , where ξ i j k , i = 1 , 2 , , N , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j are the left eigenvectors of A i + λ i H corresponding to the eigenvalues μ i j , i = 1 , 2 , , N , j = 1 , 2 , , q i . Then, the networked system (3) is controllable if, and only if,
(i) 
e i T D 0 for all i = 1 , , N
(ii) 
For a fixed i, each left eigenvector ξ of A i + λ i H , ξ B j 0 for some j { 1 , 2 , , N } with e i T D j 0 ,
(iii) 
If matrices A i 1 + λ i 1 H , A i 2 + λ i 2 H , , A i p + λ i p H ( λ i k σ ( C ) , k = 1 , , p , w h e r e p > 1 ) have a common eigenvalue σ, then ( e i 1 T D ξ i 1 1 ) B , , ( e i 1 T D ξ i 1 γ i 1 ) B , , ( e i p T D ξ i p 1 ) B , , ( e i p T D ξ i p γ i p ) B are linearly independent vectors, where γ i k 1 is the geometric multiplicity of σ for A i k + λ i k H and ξ i k l ( l = 1 , , γ i k ) are the left eigenvectors of A i k + λ i k H corresponding to σ , k = 1 , , p .
Proof. 
(Necessary part) Fix i. Let ξ be an arbitrary left eigenvector of A i + λ i H . From Theorem 1, we find that e i T ξ is a left eigenvector of F. By Lemma 3, for the networked system (3) to be controllable, we must have
( e i T ξ ) ( D I ) B = ( e i T D ξ ) B 0
This implies that e i T D 0 and ξ B j 0 for some j { 1 , 2 , , N } with e i T D j 0 .
Now, suppose that the matrices A i 1 + λ i 1 H , , A i p + λ i p H ( λ i k σ ( C ) , k = 1 , , p , where p > 1 ) have a common eigenvalue σ . Then the left eigenvectors of F corresponding to σ can be expressed as a linear combination in the form k = 1 p l = 1 γ i k α k l ( e i k T ξ i k l ) , where α k l R ( k = 1 , , p , l = 1 , , γ i k ) are scalars, not all are zero and ξ i k 1 , , ξ i k γ i k , are the eigenvectors of A i k + λ i k H corresponding to the eigenvalue σ , where k = 1 , , p . If the networked system is controllable, then
k = 1 p l = 1 γ i k α k l ( e i k T ξ i k l ) ( D I ) B 0
Consequently, we have
k = 1 p l = 1 γ i k α k l e i k T D ξ i k l B 0
for any scalars α k l R ( k = 1 , , p , l = 1 , , γ i k ) , not all of them are zero. This implies that the vectors e i 1 T D ξ i 1 1 B , , e i 1 T D ξ i 1 γ i 1 B , , ( e i p T D ) ( ξ i p 1 ) B , , e i p T D ξ i p γ i p B are linearly independent in R N n .
(Sufficiency part) To prove the converse part, we will show that if the networked system is uncontrollable, at least one condition in Theorem 1 does not hold. Suppose that the networked system (3) is not controllable. Then by Lemma 3, there exists a left eigenpair ( μ ˜ , v ˜ ) of F, such that v ˜ G = 0 .
If μ ˜ σ ( A i 0 + λ i 0 H ) and μ ˜ σ ( A 1 + λ 1 H ) σ ( A i 0 1 + λ i 0 1 H ) σ ( A i 0 + 1 + λ i 0 + 1 H ) σ ( A i N + λ i N H ) . Again v ˜ can be written as a linear combination, v ˜ = l = 1 γ i 0 j 0 α 0 l ( e i 0 T ξ i 0 j 0 l ) , where ξ i 0 j 0 1 , , ξ i 0 j 0 γ i 0 j 0 of left eigenvectors of A i 0 + λ i 0 H corresponding to μ ˜ , where, α 0 1 , , α 0 γ i 0 j 0 is some non-zero vector. Now v ˜ G = 0 implies
l = 1 γ i 0 j 0 α 0 l ( e i 0 T ξ i 0 j 0 l ) ( D I ) B = ( e i 0 T D ) l = 1 γ i 0 j 0 α 0 l ξ i 0 j 0 l B = 0
This implies that either e i 0 T D = 0 or l = 1 γ i 0 j 0 α 0 l ξ i 0 j 0 l B j = 0 for all j { 1 , 2 , , N } with e i T D j 0 . Keep in mind that l = 1 γ i 0 j 0 α 0 l ξ i 0 j 0 l is a left eigenvector of A i 0 + λ i 0 H . Thus, if the networked system is uncontrollable, then either condition ( i ) or condition ( i i ) does not hold true.
Let μ ˜ be the common eigenvalue of the matrices A i 1 + λ i 1 H , , A i p + λ i p H ( λ i k σ ( C ) , for k = 1 , , p , p > 1 ) . Additionally, let the eigenvectors of A i k + λ i k H corresponding to μ ˜ are ξ i k 1 , , ξ i k γ i k , where k = 1 , , p . Since v ˜ can be expressed in the form k = 1 p l = 1 γ i k α 0 k l e i k T ξ i k l , where α 0 k l ( l = 1 , , γ i k , k = 1 , , p ) are some scalars, which are not all zero. Then, v ˜ G = 0 implies that there exists a non-zero vector α 0 11 , , α 0 1 γ i 1 , , α 0 p 1 , , α 0 p γ i p , such that
k = 1 p l = 1 γ i k α 0 k l e i k T ξ i k l ( D I ) B = k = 1 p l = 1 γ i k α 0 k l ( e i k T D ) ( ξ i k l ) B = 0
This implies that ( e i 1 T D ξ i 1 1 ) B , , ( e i 1 T D ξ i 1 γ i 1 ) B , , ( e i p T D ξ i p 1 ) B , , ( e i p T D ξ i p γ i p ) B are linearly dependent. Thus, at least one condition in Theorem 2 does not hold true, when the networked system is uncontrollable. □
The following examples illustrate the result obtained in Theorem 2.
Example 1.
Consider a heterogeneous networked system with three nodes with the following dynamics; the state matrices and control matrices of each nodes are given by,
A 1 = 1 1 1 0 1 1 0 0 1 , A 2 = A 3 = 1 2 1 0 1 1 1 1 2 , B 1 = 1 0 1 , B 2 = 1 1 1 , B 3 = 1 1 1
The network topology matrix, inner-coupling matrix, and the external control input matrix are, respectively,
C = 0 0 1 0 1 1 0 0 0 , H = 1 1 0 1 1 1 0 0 0 , D = 1 0 0 0 0 0 0 0 1
Nodes { v 1 , v 2 , v 3 } and { u 1 , u 2 } in Figure 1 represents the state nodes and the control nodes respectively. There exists a non-singular matrix T = 1 0 0 0 0 1 0 1 1 , such that T C T 1 = 0 1 0 0 0 0 0 0 1 . We have, λ 1 = 1 , λ 2 = 1 and λ 3 = 1 . Clearly, J contains a Jordan block of order 2 corresponding to 0. ξ 11 1 = 0 0 1 is the only left eigenvector of the matrix A 1 + λ 1 H = A 1 and ξ 11 1 H = 0 . Additionally, T I commutes with A. Then
(i) 
as T D = 1 0 0 0 0 1 0 0 1 , e i T D 0 for all i = 1 , 2 , 3 .
(ii) 
for A 1 + λ 1 H = A 1 = 1 1 1 0 1 1 0 0 1 , the only left eigenvector is ξ 11 1 = 0 0 1 . We have e 1 T D 1 0 and ξ 11 1 B 1 0 .
For the matrix A 2 + λ 2 H = A 2 = 1 2 1 0 1 1 1 1 2 the left eigenvectors are, respectively, ξ 21 1 = 0.44062 0.828911 1 , ξ 22 1 = 0.72031 0.784805 i 0.914456 + 1.47641 i 1 , and ξ 23 1 = 0.72031 + 0.784805 i 0.914456 1.47641 i 1 . We have e 2 T D 3 0 and ξ 21 1 B 3 , ξ 22 1 B 3 , ξ 23 1 B 3 0 .
For the matrix A 3 + λ 3 H = A 3 + H = 2 3 1 1 2 2 1 1 2 , the left eigenvectors are, respectively, ξ 31 1 = 0.720551 1.09001 1 , ξ 32 1 = 0.0875483 0.34424 i 0.681369 + 0.450503 i 1 , and ξ 33 1 = 0.0875483 + 0.34424 i 0.681369 0.450503 i 1 . We have e 3 T D 3 0 and ξ 31 1 B 3 , ξ 32 1 B 3 , ξ 33 1 B 3 0 .
(iii) 
as the matrices A 1 , A 2 and A 3 + H do not have any common eigenvalues, third condition of Theorem 2 is satisfied.
Thus, all the conditions of Theorem 2 are satisfied and hence the system is controllable.
The following illustration demonstrates how Theorem 2 can be used to make an uncontrollable system controllable.
Example 2.
Consider a heterogeneous networked system with three nodes with the following dynamics; the state matrices and control matrices of each nodes are given by,
A 1 = 0 0 0 0 1 2 0 0 1 , A 2 = A 3 = 0 1 1 2 1 1 0 2 1 , B 1 = 0 1 1 , B 2 = 0 1 0 , B 3 = 0 1 1
The network topology matrix, inner-coupling matrix, and the external control input matrix are, respectively,
C = 1 1 1 0 0 1 0 1 0 , H = 1 1 0 0 1 1 0 1 1 , D = 1 0 0 0 0 0 0 0 0
There exists T = 1 0 0 0 1 1 0 1 2 1 2 , such that T C T 1 = 1 1 0 0 1 0 0 0 1 . The eigenvalues of C are, λ 1 = 1 , λ 2 = 1 and λ 3 = 1 . Clearly, J contains a Jordan block of order 2. Observe that ξ 11 1 = 0 1 1 is the only left eigenvector corresponding to the matrix A 1 + H and ξ 11 1 H = 0 . Additionally, T I commutes with A. Here, as T D = 1 0 0 0 0 0 0 0 0 , we have e 2 T D = e 3 T D = 0 . Then, by Theorem 2, the networked system is not controllable. From Figure 2, we can see that only node v 1 have an external control input. It is easy to observe, if either node v 2 or v 3 is supplied with a control input, e i T D 0 for all i = 1 , 2 , 3 . Suppose that node v 2 is supplied with an external control input as shown in Figure 3. That is, D = 1 0 0 0 1 0 0 0 0 . Even then the networked system is not controllable as e 1 T D 1 is the only non-zero entry in e 1 T D and ξ 11 1 B 1 = 0 . If we could change the control input matrix B 1 so that ξ 11 1 B 1 0 , we can make this uncontrollable system to a controllable system. For example, consider B 1 = 1 1 0 . Then,
(i) 
as T D = 1 0 0 0 1 0 0 1 2 0 , e i T D 0 for all i = 1 , 2 , 3 .
(ii) 
for A 1 + H = 1 1 0 0 2 1 0 1 0 , the only left eigenvector is ξ 11 1 = 0 1 1 . We have e 1 T D 1 0 and ξ 11 1 B 1 0 .
For A 2 + H = 1 2 1 2 2 0 0 3 0 , the left eigenvectors are ξ 21 1 = 3.90547 5.67363 1 , ξ 22 1 = 0.452737 + 1.15383 i 0.336813 1.0993 i 1 , and ξ 23 1 = 0.452737 1.15383 i 0.336813 + 1.0993 i 1 . We have e 2 T D 2 0 and ξ 21 1 B 2 , ξ 22 1 B 2 , ξ 23 1 B 2 0 .
and for the matrix A 3 H = 1 0 1 2 0 2 0 1 2 , the left eigenvectors are ξ 31 1 = 2 1 0 , ξ 32 1 = 0.25 + 0.661438 i 0.375 0.330719 i 1 , and ξ 33 1 = 0.25 0.661438 i 0.375 + 0.330719 i 1 . We have e 3 T D 2 0 and ξ 31 1 B 2 , ξ 32 1 B 2 , ξ 33 1 B 2 0 .
(iii) 
as the matrices A 1 + H , A 2 + H and A 3 H do not have any common eigenvalues, third condition of Theorem 2 is satisfied.
Thus, all the conditions of Theorem 2 are satisfied and, hence, the system is controllable.
Thus, with the help of conditions in Theorem 2 we can modify the system components in order to make an uncontrollable system controllable. Now, suppose that ( A i + λ i H , B j ) is controllable for some j { 1 , 2 , , N } with e i T D j 0 . Then, by Lemma 3, for each left eigenvector ξ of A i + λ i H , ξ B j 0 . From this idea, we can derive the following result as a corollary of Theorem 2, which gives a sufficient condition for controllability.
Corollary 1.
Let T be a non-singular matrix triagularizing matrix C, such that T I commutes with A. If J contains a Jordan block of order l 2 corresponding to the eigenvalue λ i 0 of C, then assume that ξ i j k H = 0 for all i = i 0 , i 0 + 1 , , i 0 + l 1 , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , where ξ i j k , i = 1 , 2 , , N , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j are the left eigenvectors of A i + λ i H corresponding to the eigenvalues μ i j , i = 1 , 2 , , N , j = 1 , 2 , , q i . Then, the networked system (3) is controllable if the following conditions are satisfied.
(i) 
e i T D 0 for all i = 1 , , N ;
(ii) 
For a fixed i, ( A i + λ i H , B j ) is controllable for some j { 1 , 2 , , N } with e i T D j 0 ;
(iii) 
If matrices A i 1 + λ i 1 H , A i 2 + λ i 2 H , , A i p + λ i p H ( λ i k σ ( C ) , k = 1 , , p , w h e r e p > 1 ) have a common eigenvalue σ, then ( e i 1 T D ξ i 1 1 ) B , , ( e i 1 T D ξ i 1 γ i 1 ) B , , ( e i p T D ξ i p 1 ) B , , ( e i p T D ξ i p γ i p ) B are linearly independent vectors, where γ i k 1 is the geometric multiplicity of σ for A i k + λ i k H and ξ i k l ( l = 1 , , γ i k ) are the left eigenvectors of A i k + λ i k H corresponding to σ , k = 1 , , p .
Example 3.
Consider a networked system with three nodes, where the dynamics of the system is given as follows:
A 1 = A 2 = A 3 = 1 1 0 2 1 2 0 2 1 , B 1 = 1 1 0 , B 2 = 1 0 0 , B 3 = 1 0 1 , H = 0 1 0 1 0 1 0 1 1
The network topology matrix and the eternal input matrix are given by
C = 0 0 1 1 0 0 1 0 0 , D = 1 0 0 0 1 0 0 0 0
C is diagonalizable with T = 0 1 1 3 2 0 3 2 3 2 0 3 2 , such that T C T 1 = 0 0 0 0 1 0 0 0 1 = J . We have λ 1 = 0 , λ 2 = 1 and λ 1 = 1 . Clearly, J does not contain any Jordan blocks and T I commutes with A. Then
(i) 
as T D = 0 1 0 3 2 0 0 3 2 0 0 , e i T D 0 for all i = 1 , 2 , 3 .
(ii) 
We have e 1 T D 2 , e 2 T D 1 , e 3 T D 1 0 . Here ( A 1 , B 2 ) , ( A 2 + H , B 1 ) and ( A 1 H , B 2 ) are controllable.
(iii) 
Here, A 1 and A 3 H has a common eigenvalue, σ = 1 . The corresponding left eigenvectors are, respectively, ξ = 2 0 1 and ν = 1 0 0 . Clearly, ( e 1 T D ξ ) B 0 and ( e 3 T D ν ) B 0 .
Thus, all the conditions of Corollary 1 are satisfied and hence the given system is controllable.
If B i = B for all i = 1 , 2 , , N , then the following result by Ajayakumar et al. [26] can be obtained as a consequence of Corollary 1.
Theorem 3
([26]). Let T be a non-singular matrix triangularizing matrix C, such that T I commutes with A. If J contains a Jordan block of order l 2 corresponding to the eigenvalue λ i 0 of C, then assume that ξ i j k H = 0 for all i = i 0 , i 0 + 1 , , i 0 + l 1 , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , where ξ i j k , i = 1 , 2 , , N , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j are the left eigenvectors of A i + λ i H corresponding to the eigenvalues μ i j , i = 1 , 2 , , N , j = 1 , 2 , , q i . Then, the networked system (3) is controllable if, and only if,
(i)
e i T D 0 for all i = 1 , , N ;
(ii)
( A i + λ i H , B ) is controllable, for i = 1 , 2 , , N ;
(iii)
If matrices A i 1 + λ i 1 H , A i 2 + λ i 2 H , , A i p + λ i p H ( λ i k σ ( C ) , k = 1 , , p , w h e r e p > 1 ) have a common eigenvalue σ, then ( e i 1 T D ) ( ξ i 1 1 B ) , , ( e i 1 T D ) ( ξ i 1 γ i 1 B ) , , ( e i p T D ) ( ξ i p 1 B ) , , ( e i p T D ) ( ξ i p γ i p B ) are linearly independent vectors, where γ i k 1 is the geometric multiplicity of σ for A i k + λ i k H and ξ i k l ( l = 1 , , γ i k ) are the left eigenvectors of A i k + λ i k H corresponding to σ , k = 1 , , p .

Controllability Results in a Special Network Topology

Now we will discuss the controllability of system (5), when the network topology is given by an upper/lower triangular matrix and the state matrices have certain properties. Here, also, we will characterize the eigenvalues and eigenvectors of the state matrix F.
Theorem 4.
Assume that C is an upper triangular matrix. Let σ ( A i + c i i H i ) = { μ i 1 , μ i 2 , , μ i q i } be the set of eigenvalues of A i + c i i H i , i = 1 , 2 , , N . Then, the set of all eigenvalues of F is given by σ F = { μ 1 1 , μ 1 2 , , μ 1 q 1 , , μ N 1 , μ N 2 , , μ N q N } . Let ξ i j k , k = 1 , 2 , , γ i j be the left eigenvectors of A i + c i i H i associated with the eigenvalue μ i j , where γ i j is the geometric multiplicity of μ i j for A i + c i i H i . If ξ i j k H i = 0 , for i = 1 , 2 , , N 1 , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , then e i ξ i j 1 , e i ξ i j 1 , e i ξ i j γ i j , are the left eigenvectors of F associated with the eigenvalues μ i j .
Proof. 
Suppose that C is an upper triangular matrix, say C = c 11 c 12 c 1 N 0 c 22 c 2 N 0 0 c N N .
Then
F = A 1 0 0 0 A 2 0 0 0 0 A N + c 11 H 1 c 12 H 1 c 1 N H 1 0 c 22 H 2 c 2 N H 2 0 0 c N N H N = A 1 + c 11 H 1 c 12 H 1 c 1 n H 1 0 A 2 + c 22 H 2 c 2 n H 2 0 0 A N + c N N H N
is a block upper triangular matrix. Therefore, the eigenvalues of F are precisely the eigenvalues of the matrices A i + c i i H i , i = 1 , 2 , , N . That is, if σ ( A i + c i i H i ) = μ i 1 , μ i 2 , , μ i q i are the eigenvalues of A i + c i i H i , i = 1 , 2 , , N , then
σ ( F ) = i = 1 N σ ( A i + c i i H i ) = μ 1 1 , μ 1 2 , , μ 1 q 1 , , μ N 1 , μ N 2 , , μ N q N
are the eigenvalues of F. Now, if ξ i j k , k = 1 , 2 , , γ i j represents the left eigenvectors of A i + c i i H associated with the eigenvalue μ i j , then clearly e N ξ N j 1 , e N ξ N j 2 , , e N ξ N j γ N j are left eigenvectors of F corresponding to the eigenvalue μ N j . If ξ i j k H i = 0 , k = 1 , 2 , , γ i j , i = 1 , 2 , , N 1 , j = 1 , 2 , , q i , then e i ξ i j 1 , e i ξ i j 2 , e i ξ i j γ i j are left eigenvectors of F associated with the eigenvalue μ i j . Now, we will prove that the the only linearly independent left eigenvectors of F are of the form e i ξ , where ξ is a left eigenvector of A i + c i i H i for some i. For example, take ξ 1 , ξ 2 , , ξ N R n , such that ξ = ξ 1 ξ 2 ξ N R N n is a left eigenvector of F. Then ξ F = μ ξ for some eigenvalue μ of F implies that
ξ 1 A 1 + c 11 H 1 ξ 1 H + ξ 2 A 2 + c 22 H 2 i = 1 N 1 ξ i H + ξ N A N + c N N H N T = μ ξ 1 ξ 2 ξ N
Then, clearly μ is an eigenvalue of A 1 + c 11 H 1 with left eigenvector ξ 1 . Then, by our hypothesis, ξ 1 H 1 = 0 . Thus,
ξ 1 H 1 + ξ 2 A 2 + c 22 H 2 = ξ 2 A 2 + c 22 H 2 = μ ξ 2
implies that μ is an eigenvalue of A 2 + c 22 H 2 with left eigenvector ξ 2 . Proceeding like this, we determine that μ is an eigenvalue of A i + c i i H i for all i = 1 , 2 , , N with ξ i as left eigenvector. Then, ξ can be expressed as ξ = i = 1 N e i ξ i , and we have already seen that e i ξ i are left eigenvectors of F for any left eigenvector ξ i of A i + c i i H i . Thus, if A i + c i i H i , i = 1 , 2 , , N does not have any common eigenvalue, the only left eigenvectors of F are e i ξ i j k , i = 1 , 2 , , N , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j , where ξ i j k , k = 1 , 2 , , γ i j are the linearly independent left eigenvectors of A i + c i i H corresponding to the eigenvalue μ i j . Now, suppose that A i 1 + c i 1 i 1 H , A i 2 + c i 2 i 2 H , , A i r + c i r i r H have a common eigenvalue μ with left eigenvectors ξ i 1 , ξ i 2 , , ξ i r , respectively, where i 0 , i 1 , , i r { 1 , 2 , , N } . Then, α = 1 r e i α ξ i α is a left eigenvector of F corresponding to the eigenvalue μ . □
Theorem 5.
Let C be an upper∖lower triangular matrix. Suppose the eigenvectors of A i + c i i H i satisfy the conditions given in Theorem 4, then the networked system (3) is controllable if, and only if,
(i) 
Every node have external control input.
(ii) 
A i + c i i H i , B i is controllable for all i = 1 , 2 , N .
Proof. 
Suppose that the networked system (3) is controllable and suppose that d i = 0 for some i, say i 0 , i.e., d i 0 = 0 . Then the control matrix for the networked system (3) is given by
G = d 1 B 1 0 0 0 0 d 2 B 2 0 0 0 0 d i 0 B i 0 0 0 0 0 d N B N = d 1 B 1 0 0 0 0 d 2 B 2 0 0 0 0 0 0 0 0 0 d N B N
We have proved that e i 0 ξ i 0 j k , k = 1 , 2 , , γ i 0 j are left eigenvectors of F corresponding to the eigenvalue μ i 0 j , where j = 1 , 2 , , q i 0 . Observe that for any j = 1 , 2 , , q i 0 , k = 1 , 2 , , γ i 0 j , e i 0 ξ i 0 j k G = 0 . Then, by Lemma 3, the given system is not controllable, which is a contradiction. Now, suppose that A i + c i i H i , B i is not controllable for some i, say i 1 . Again by Lemma 3, for some eigenvalue μ i 1 j 1 (where j 1 { 1 , 2 , , q i 1 } ) of A i 1 + c i 1 i 1 H i 1 there exists a left eigenvector ξ i 1 j 1 k 1 (where k 1 { 1 , 2 , , γ i 1 j 1 } ), such that ξ i 1 j 1 k 1 B i 1 = 0 . Then clearly e i 1 ξ i 1 j 1 k 1 G = 0 , which is a contradiction.
Conversely, suppose that both ( i ) and ( i i ) are satisfied. We have the left eigenvectors of F are e i ξ i j k , where i = 1 , 2 , , N , j = 1 , 2 , , q i , k = 1 , 2 , , γ i j or their linear combinations. Now e i ξ i j k G = 0 if, and only if, either d i = 0 , ξ i j k B i = 0 or both for some i. Both of these situations contradict our hypothesis. Then by Lemma 3, system (3) is controllable. □
Example 4.
Consider a heterogeneous networked system with three nodes, where the state matrices and control matrices are given by
A 1 = 1 2 1 1 1 1 0 1 2 , A 2 = 1 0 0 1 1 0 0 1 1 , A 3 = 1 1 1 0 1 0 0 1 1 , B 1 = 1 0 1 , B 2 = 1 1 1 , B 3 = 0 1 1
The inner-coupling matrices are given by,
H 1 = 1 1 1 0 0 0 1 1 1 , H 2 = 0 0 0 1 2 0 1 0 1 , H 3 = 1 0 2 0 0 0 2 1 1
The left eigenvectors of A 1 are ξ 11 1 = 1 1 1 , ξ 12 1 = 1 1 1 and the only left eigenvector of A 2 is ξ 21 1 = 1 0 0 . We have ξ 11 1 H 1 = ξ 12 1 H 1 = ξ 21 1 H 2 = 0 .
(i) 
From Figure 4, it is clear that all the nodes have external control input.
(ii) 
( A 1 , B 1 ) , ( A 2 , B 2 ) and ( A 3 + H 3 , B 3 ) are controllable.
Thus, all the conditions of Theorem 5 are satisfied. Therefore, the given networked system is controllable.

5. Conclusions and Future Scope of Work

This paper provides a necessary and sufficient condition for the controllability of a heterogeneous networked system. Ajayakumar et al. [26] analyzed heterogeneous networked systems having identical control matrices in each node and obtained a necessary and sufficient conditions for controllability. Based on this work, it is possible to identify the nodes that required external control inputs in order to make the uncontrollable system controllable. In the present work, control matrices are considered to be distinct in each node and in addition to identifying the nodes that will receive control inputs, it is also possible to identify the control input matrices that needed to be employed. The existing results tell us less than ours about how subsystem dynamics, network topology, etc., affect the controllability of a networked system, and our results are easy to validate. In addition, controllability results for a more general class of heterogeneous networked systems over a particular network topology are obtained. We plan to look into the controllability of networked systems over more general network topologies in the future. The ability to control networked systems with delays and impulses could be another study area. However, research is performed in this direction for homogeneous networked systems with one-way communication and control delays, and this kind of study still needs to be performed on heterogeneous networked systems.

Author Contributions

Conceptualization, A.A. and R.K.G.; methodology, A.A. and R.K.G.; software, A.A.; validation, A.A. and R.K.G.; formal analysis, A.A. and R.K.G.; investigation, A.A. and R.K.G.; writing—original draft preparation, A.A.; writing—review and editing, R.K.G.; visualization, R.K.G.; supervision, R.K.G.; project administration, R.K.G.; funding acquisition, A.A. All authors have read and agreed to the published version of the manuscript.

Funding

The first author is receiving financial support from Council of Scientific and Industrial Research (CSIR), India. Second author is not receiving any financial support.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Written informed consent has been obtained from the patient(s) to publish this paper.

Acknowledgments

The first author acknowledges the financial help received from the Council of Scientific and Industrial Research (CSIR), India, for the work and the Department of Mathematics, Indian Institute of Space Science and Technology (IIST), India, for providing the necessary support to carry out this research work.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
LTILinear Time-Invariant
MIMOMulti Input Multi Output

References

  1. Strogatz, S.H. Exploring complex networks. Nature 2001, 410, 268–276. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Wang, X.F.; Chen, G. Complex networks: Small-world, scale-free and beyond. IEEE Circuits Syst. Mag. 2003, 3, 6–20. [Google Scholar] [CrossRef] [Green Version]
  3. Xiang, L.; Chen, F.; Ren, W.; Chen, G. Advances in network controllability. IEEE Circuits Syst. Mag. 2019, 19, 8–32. [Google Scholar] [CrossRef]
  4. Kalman, R.E. On the general theory of control systems. IRE Trans. Autom. Control 1959, 4, 110. [Google Scholar] [CrossRef]
  5. Lin, C.T. Structural controllability. IEEE Trans. Autom. Control 1974, 19, 201–208. [Google Scholar]
  6. Hautus, M.L. Controllability and observability conditions of linear autonomous systems. Ned. Akad. Wet. 1969, 72, 443–448. [Google Scholar]
  7. Glover, K.; Silverman, L. Characterization of structural controllability. IEEE Trans. Autom. Control 1976, 21, 534–537. [Google Scholar] [CrossRef]
  8. Mayeda, H. On structural controllability theorem. IEEE Trans. Autom. Control 1981, 26, 795–798. [Google Scholar] [CrossRef]
  9. Tarokh, M. Measures for controllability, observability and fixed modes. IEEE Trans. Autom. Control 1992, 37, 1268–1273. [Google Scholar] [CrossRef]
  10. Tanner, H.G. On the controllability of nearest neighbor interconnections. In Proceedings of the 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No. 04CH37601), Nassau, Bahamas, 14–17 December 2004; Volume 3, pp. 2467–2472. [Google Scholar]
  11. Rahmani, A.; Mesbahi, M. Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms. In Proceedings of the 2007 American Control Conference, New York, NY, USA, 9–11 July 2007; pp. 2738–2743. [Google Scholar]
  12. Liu, X.; Lin, H.; Chen, B.M. Graph-theoretic characterisations of structural controllability for multi-agent system with switching topology. Int. J. Control 2013, 86, 222–231. [Google Scholar] [CrossRef]
  13. Yazıcıoğlu, A.Y.; Abbas, W.; Egerstedt, M. Graph distances and controllability of networks. IEEE Trans. Autom. Control 2016, 61, 4125–4130. [Google Scholar] [CrossRef] [Green Version]
  14. Farhangi, H. The path of the smart grid. IEEE Power Energy Mag. 2009, 8, 18–28. [Google Scholar] [CrossRef]
  15. Wuchty, S. Controllability in protein interaction networks. Proc. Natl. Acad. Sci. USA 2014, 111, 7156–7160. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  16. Gu, S.; Pasqualetti, F.; Cieslak, M.; Telesford, Q.K.; Alfred, B.Y.; Kahn, A.E.; Medaglia, J.D.; Vettel, J.M.; Miller, M.B.; Grafton, S.T.; et al. Controllability of structural brain networks. IEEE Nat. Commun. 2015, 6, 1–10. [Google Scholar] [CrossRef] [Green Version]
  17. Bassett, D.S.; Sporns, O. Network neuroscience. Nat. Neurosci. 2017, 20, 353–364. [Google Scholar] [CrossRef] [Green Version]
  18. Zhou, T. On the controllability and observability of networked dynamic systems. Automatica 2015, 52, 63–75. [Google Scholar] [CrossRef] [Green Version]
  19. Wang, L.; Chen, G.; Wang, X.; Tang, W.K. Controllability of networked MIMO systems. Automatica 2016, 69, 405–409. [Google Scholar] [CrossRef] [Green Version]
  20. Wang, L.; Wang, X.; Chen, G. Controllability of networked higher-dimensional systems with one-dimensional communication. In Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences; Royal Society: London, UK, 2017; Volume 375, p. 20160215. [Google Scholar]
  21. Hao, Y.; Duan, Z.; Chen, G. Further on the controllability of networked MIMO LTI systems. Int. J. Robust Nonlinear Control 2018, 28, 1778–1788. [Google Scholar] [CrossRef]
  22. Wang, P.; Xiang, L.; Chen, F. Controllability of heterogeneous networked MIMO systems. In Proceedings of the 2017 International Workshop on Complex Systems and Networks (IWCSN), Doha, Qatar, 8–10 December 2017; pp. 45–49. [Google Scholar]
  23. Xiang, L.; Wang, P.; Chen, F.; Chen, G. Controllability of directed networked MIMO systems with heterogeneous dynamics. IEEE Trans. Control Netw. Syst. 2019, 7, 807–817. [Google Scholar] [CrossRef]
  24. Ajayakumar, A.; George, R.K. A Note on Controllability of Directed Networked System with Heterogeneous Dynamics. IEEE Trans. Control Netw. Syst. 2022, 2022, 1–4. [Google Scholar] [CrossRef]
  25. Kong, Z.; Cao, L.; Wang, L.; Guo, G. Controllability of Heterogeneous Networked Systems with Non-identical Inner-coupling Matrices. IEEE Trans. Control Netw. Syst. 2022, 9, 867–878. [Google Scholar] [CrossRef]
  26. Ajayakumar, A.; George, R.K. Controllability of networked systems with heterogeneous dynamics. Math. Control Signals Syst. 2023, 1–20. [Google Scholar] [CrossRef]
  27. Horn, R.A.; Johnson, C.R. Topics in Matrix Analysis; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
  28. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 2012. [Google Scholar]
  29. Rugh, W.J. Linear System Theory; Prentice-Hall, Inc.: Kalamazoo, MI, USA, 1996. [Google Scholar]
Figure 1. Controllable heterogeneous networked system with triangularizable network topology C and node dynamics as in (6) and (7).
Figure 1. Controllable heterogeneous networked system with triangularizable network topology C and node dynamics as in (6) and (7).
Foundations 03 00015 g001
Figure 2. Uncontrollable heterogeneous networked system with triangularizable network topology C and node dynamics, as in (8) and (9).
Figure 2. Uncontrollable heterogeneous networked system with triangularizable network topology C and node dynamics, as in (8) and (9).
Foundations 03 00015 g002
Figure 3. Controllable heterogeneous networked system with triangularizable network topology C and node dynamics, as in (8) and (9).
Figure 3. Controllable heterogeneous networked system with triangularizable network topology C and node dynamics, as in (8) and (9).
Foundations 03 00015 g003
Figure 4. Take c 12 = c 13 = c 23 = c 33 = 1 , otherwise c i j = 0 and d 1 = d 2 = d 3 = 1 .
Figure 4. Take c 12 = c 13 = c 23 = c 33 = 1 , otherwise c i j = 0 and d 1 = d 2 = d 3 = 1 .
Foundations 03 00015 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ajayakumar, A.; George, R.K. Controllability of a Class of Heterogeneous Networked Systems. Foundations 2023, 3, 167-180. https://doi.org/10.3390/foundations3020015

AMA Style

Ajayakumar A, George RK. Controllability of a Class of Heterogeneous Networked Systems. Foundations. 2023; 3(2):167-180. https://doi.org/10.3390/foundations3020015

Chicago/Turabian Style

Ajayakumar, Abhijith, and Raju K. George. 2023. "Controllability of a Class of Heterogeneous Networked Systems" Foundations 3, no. 2: 167-180. https://doi.org/10.3390/foundations3020015

APA Style

Ajayakumar, A., & George, R. K. (2023). Controllability of a Class of Heterogeneous Networked Systems. Foundations, 3(2), 167-180. https://doi.org/10.3390/foundations3020015

Article Metrics

Back to TopTop