This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Analytical Expression and Deconstruction of the Volume of the Controllability Ellipsoid thanks: Work supported by the National Natural Science Foundation of China (Grant No. 61273005)

Mingwang Zhao Information Science and Engineering School, Wuhan University of Science and Technology, Wuhan, Hubei, 430081, China
Tel.: +86-27-68863897
Work supported by the National Natural Science Foundation of China (Grant No. 61273005)
Abstract

In this article, we present three theorems and develop an effective analytical method to compute analytically the volume of the controllability ellipsoid for the linear discrete-time (LDT) systems with nn different eigenvalues. Furthermore, by deconstructing the analytical expression of the volume, some factors on the shape of the ellipsoid, the side length of its circumscribed rhomboid, the evenness of the eigenvalue distribution of the LDT system are constructed. Based on the analytical expression of the volume and these factors, the control ability can be defined, computing, analyzed, and optimized for the LDT systems.

keywords:
volume computation , controllability ellipsoid , controllability Grammian matrix , discrete-time systems , state controllability
journal: Journal Name

1 Introduction

In control theory, linear discrete-time (LDT) systems can be formulated as follows:

xk+1=Axk+Buk,xkRn,ukRr,x_{k+1}=Ax_{k}+Bu_{k},\quad x_{k}\in R^{n},u_{k}\in R^{r}, (1)

where xkx_{k} and uku_{k} are the state variable and input variable, respectively, and matrices ARn×nA\in R^{n\times n} and BRn×rB\in R^{n\times r} are the state matrix and input matrix in the system models, respectively, [6] [2]. To investigate the controllability of the LDT systems (1), the controllability Grammian matrix can be defined as follows

GN=i=0N1AiB(AiB)T,NnG_{N}=\sum_{i=0}^{N-1}A^{i}B\left(A^{i}B\right)^{T},\;N\geq n (2)

That the rank of the Grammian matrix GNG_{N} is nn, the dimension of the state space of the LDT systems (1), is the well-known criterion on the state controllability. By the controllability Grammian matrix, the controllability ellipsoid that can describe the maximum controllable region under the total-energy constraint (k=0N1uN221)\left(\sum_{k=0}^{N-1}\|u_{N}\|^{2}_{2}\leq 1\right) can be defined as follows [3] [7] [10] [8] [1]

EN={x|x=GN1/2zN,zNRn:zN21}E_{N}=\left\{x\left|x=G_{N}^{1/2}z_{N},\forall z_{N}\in R^{n}:\|z_{N}\|_{2}\leq 1\right.\right\} (3)

In papers [11], [4], [9], and [5], the determinant value det(GN)\det\left(G_{N}\right) and the minimum eigenvalue λmin(GN)\lambda_{\textnormal{min}}\left(G_{N}\right) of the controllability Grammian matrix GNG_{N}, correspondingly the volume vol(EN)\textnormal{vol}\left(E_{N}\right) and the minimum radius rmin(EN)r_{\textnormal{min}}\left(E_{N}\right) of the controllability ellipsoid ENE_{N}, can be used to quantify the control ability of the input variables to the state space, and then be chosen as the objective functions for optimizing and promoting the control ability of the dynamical systems. Due to lack of the analytical computing of the determinant det(GN)\det\left(G_{N}\right) and eigenvalue λmin(GN)\lambda_{\textnormal{min}}\left(G_{N}\right), correspondingly the volume vol(EN)\textnormal{vol}\left(E_{N}\right) and the radius rmin(EN)r_{\textnormal{min}}\left(E_{N}\right), these optimizing problems for the control ability are solved very difficulty, and few achievements about that have been made.

In this paper, the analytical volume-computation of the controllability ellipsoid ENE_{N}, when the system (1) is a sigle input system, is studied and an analytical expression on that NN\rightarrow\infty will be proven. By deconstructing the analytical volume expression, some factors for the ellipsoid ENE_{N}, such as, the shape factor, the minimum circumscribed rhomboid, etc, can be got. Therefore, the analytical volume and the shape factor of the ellipsoid, the minimum side length of the rhomboid can be used to describe the control ability and can be chosen as the objective functions and the constraint conditions for optimizing and promoting the control ability. Because of the analytical expression of these objective functions and constraint conditions, the optimizing problems will be solved with very effective optimizing computation.

2 The analytical volume-computing of the controllability ellipsoid for the matrix AA with nn different eigenvalues

Based on the linear system theory [6], [2], the LDT system (1) can be transformed as the Jordan canonical form, and especially the LDT system (1) with nn different eigenvalues can be transformed as the diagonal canonical form. Obviously, if the Jordan canonical form is Σ(P1AP,P1B)\Sigma(P^{-1}AP,P^{-1}B) with the Jordan transformation matrix PP, the corresponding controllability Grammian matrix can be expressed respectively as

G¯N=P1GNPT\displaystyle\overline{G}_{N}=P^{-1}G_{N}P^{-T} (4)

And then, the determinant det(G¯N)\det\left(\overline{G}_{N}\right) is (detP)2det(GN)\left(\det P\right)^{-2}\det\left(G_{N}\right) and the volume of the controllability ellipsoid is |detP|1vol(EN)|\det P|^{-1}\textnormal{vol}\left(E_{N}\right). In this paper, the determinant and ellipsoid volume for the diagonal canonical form, respectively, are computed analytically and related results can be generalized to the general systems Σ(A,B)\Sigma(A,B).

When the system Σ(A,B)\Sigma(A,B) is a sigle-input diagonal canonical form as

A=diag{λ1,λ2,,λn},B=[b1,b2,,bn]T\displaystyle A=\textnormal{diag}\{\lambda_{1},\lambda_{2},\dots,\lambda_{n}\},\;B=[b_{1},b_{2},\dots,b_{n}]^{T} (5)

the controllability Grammian matrix can be rewritten as

GN\displaystyle G_{N} =i=0N1AiB(AiB)T\displaystyle=\sum_{i=0}^{N-1}A^{i}B\left(A^{i}B\right)^{T}
=i=0N1[b12λ12ib1b2λ1iλ2ib1bnλ1iλnib1b2λ1iλ2ib22λ22ib2bnλ2iλnib1bnλ1iλnib2bnλ2iλnibn2λn2i]\displaystyle=\sum_{i=0}^{N-1}\left[\begin{array}[]{cccc}b_{1}^{2}\lambda_{1}^{2i}&b_{1}b_{2}\lambda_{1}^{i}\lambda_{2}^{i}&\cdots&b_{1}b_{n}\lambda_{1}^{i}\lambda_{n}^{i}\\ b_{1}b_{2}\lambda_{1}^{i}\lambda_{2}^{i}&b_{2}^{2}\lambda_{2}^{2i}&\cdots&b_{2}b_{n}\lambda_{2}^{i}\lambda_{n}^{i}\\ \vdots&\vdots&\ddots&\vdots\\ b_{1}b_{n}\lambda_{1}^{i}\lambda_{n}^{i}&b_{2}b_{n}\lambda_{2}^{i}\lambda_{n}^{i}&\cdots&b_{n}^{2}\lambda_{n}^{2i}\end{array}\right] (10)
=[b121λ12N1λ12b1b21λ1Nλ2N1λ1λ2b1bn1λ1NλnN1λ1λnb1b21λ1Nλ2N1λ1λ2b221λ22N1λ22b2bn1λ2NλnN1λ2λnb1bn1λ1NλnN1λ1λnb2bn1λ2NλnN1λ2λnbn21λn2N1λn2]\displaystyle=\left[\begin{array}[]{cccc}b_{1}^{2}\frac{1-\lambda_{1}^{2N}}{1-\lambda_{1}^{2}}&b_{1}b_{2}\frac{1-\lambda_{1}^{N}\lambda_{2}^{N}}{1-\lambda_{1}\lambda_{2}}&\cdots&b_{1}b_{n}\frac{1-\lambda_{1}^{N}\lambda_{n}^{N}}{1-\lambda_{1}\lambda_{n}}\\ b_{1}b_{2}\frac{1-\lambda_{1}^{N}\lambda_{2}^{N}}{1-\lambda_{1}\lambda_{2}}&b_{2}^{2}\frac{1-\lambda_{2}^{2N}}{1-\lambda_{2}^{2}}&\cdots&b_{2}b_{n}\frac{1-\lambda_{2}^{N}\lambda_{n}^{N}}{1-\lambda_{2}\lambda_{n}}\\ \vdots&\vdots&\ddots&\vdots\\ b_{1}b_{n}\frac{1-\lambda_{1}^{N}\lambda_{n}^{N}}{1-\lambda_{1}\lambda_{n}}&b_{2}b_{n}\frac{1-\lambda_{2}^{N}\lambda_{n}^{N}}{1-\lambda_{2}\lambda_{n}}&\cdots&b_{n}^{2}\frac{1-\lambda_{n}^{2N}}{1-\lambda_{n}^{2}}\end{array}\right] (15)

When all eigenvalues λi(1,1),i=1,n¯\lambda_{i}\in(-1,1),i=\overline{1,n}, and NN\rightarrow\infty, we have

G=[b121λ12b1b21λ1λ2b1bn1λ1λnb1b21λ1λ2b221λ22b2bn1λ2λnb1bn1λ1λnb2bn1λ2λnbn21λn2]\displaystyle G_{\infty}=\left[\begin{array}[]{cccc}\frac{b_{1}^{2}}{1-\lambda_{1}^{2}}&\frac{b_{1}b_{2}}{1-\lambda_{1}\lambda_{2}}&\cdots&\frac{b_{1}b_{n}}{1-\lambda_{1}\lambda_{n}}\\ \frac{b_{1}b_{2}}{1-\lambda_{1}\lambda_{2}}&\frac{b_{2}^{2}}{1-\lambda_{2}^{2}}&\cdots&\frac{b_{2}b_{n}}{1-\lambda_{2}\lambda_{n}}\\ \vdots&\vdots&\ddots&\vdots\\ \frac{b_{1}b_{n}}{1-\lambda_{1}\lambda_{n}}&\frac{b_{2}b_{n}}{1-\lambda_{2}\lambda_{n}}&\cdots&\frac{b_{n}^{2}}{1-\lambda_{n}^{2}}\end{array}\right] (20)

Before discussing the analytical volume computing of the infinite-time controllability ellipsoid EE_{\infty} for the diagonal canonical form, a theorem about the determinant of the matrix GG_{\infty} is put forward and proven as follows.

Theorem 1

For all eigenvalues λi(1,1),i=1,n¯\lambda_{i}\in(-1,1),i=\overline{1,n}, we have

Fλ1,λ2,,λn\displaystyle F^{\lambda_{1},\lambda_{2},\dots,\lambda_{n}}_{\infty} =det[11λ1211λ1λ211λ1λn11λ1λ211λ2211λ2λn11λ1λn11λ2λn11λn2]\displaystyle=\det\left[\begin{array}[]{cccc}\frac{1}{1-\lambda_{1}^{2}}&\frac{1}{1-\lambda_{1}\lambda_{2}}&\cdots&\frac{1}{1-\lambda_{1}\lambda_{n}}\\ \frac{1}{1-\lambda_{1}\lambda_{2}}&\frac{1}{1-\lambda_{2}^{2}}&\cdots&\frac{1}{1-\lambda_{2}\lambda_{n}}\\ \vdots&\vdots&\ddots&\vdots\\ \frac{1}{1-\lambda_{1}\lambda_{n}}&\frac{1}{1-\lambda_{2}\lambda_{n}}&\cdots&\frac{1}{1-\lambda_{n}^{2}}\end{array}\right] (25)
=[1i<jn(λjλi1λiλj)2]×(i=1n11λi2)\displaystyle=\left[\prod_{1\leq i<j\leq n}\left(\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right)^{2}\right]\times\left(\prod_{i=1}^{n}\frac{1}{1-\lambda_{i}^{2}}\right) (26)

Proof. The theorem can be proven by induction method as follows.

(1) When n=1n=1 and 22, we have

Fλ1\displaystyle F^{\lambda_{1}}_{\infty} =det[11λ12]=11λ12\displaystyle=\det\left[\frac{1}{1-\lambda_{1}^{2}}\right]=\frac{1}{1-\lambda_{1}^{2}} (27)
Fλ1,λ2\displaystyle F^{\lambda_{1},\lambda_{2}}_{\infty} =det[11λ1211λ1λ211λ1λ211λ22]=(λ2λ1)2(1λ1λ2)2(1λ12)(1λ22)\displaystyle=\det\left[\begin{array}[]{cc}\frac{1}{1-\lambda_{1}^{2}}&\frac{1}{1-\lambda_{1}\lambda_{2}}\\ \frac{1}{1-\lambda_{1}\lambda_{2}}&\frac{1}{1-\lambda_{2}^{2}}\end{array}\right]=\frac{\left(\lambda_{{}_{2}}-\lambda_{1}\right)^{2}}{\left(1-\lambda_{1}\lambda_{2}\right)^{2}\left(1-\lambda_{1}^{2}\right)\left(1-\lambda_{2}^{2}\right)} (30)

And then, for n=1n=1 and 22, Eq. (26) holds.

(2) It is assumed that for a given kk, Eq. (26) holds for n=k1n=k-1, that is, we have,

Fλ1,λ2,,λk1=[1i<jk1(λjλi1λiλj)2]×(i=1k111λi2)\displaystyle F^{\lambda_{1},\lambda_{2},\dots,\lambda_{k}-1}_{\infty}=\left[\prod_{1\leq i<j\leq k-1}\left(\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right)^{2}\right]\times\left(\prod_{i=1}^{k-1}\frac{1}{1-\lambda_{i}^{2}}\right) (31)

(3) For n=kn=k, we have

Fλ1,λ2,,λk\displaystyle F_{\infty}^{\lambda_{1},\lambda_{2},\dots,\lambda_{k}} =det[11λ1211λ1λ211λ1λk11λ1λ211λ2211λ2λk11λ1λk11λ2λk11λk2]\displaystyle=\det\left[\begin{array}[]{cccc}\frac{1}{1-\lambda_{1}^{2}}&\frac{1}{1-\lambda_{1}\lambda_{2}}&\cdots&\frac{1}{1-\lambda_{1}\lambda_{k}}\\ \frac{1}{1-\lambda_{1}\lambda_{2}}&\frac{1}{1-\lambda_{2}^{2}}&\cdots&\frac{1}{1-\lambda_{2}\lambda_{k}}\\ \vdots&\vdots&\ddots&\vdots\\ \frac{1}{1-\lambda_{1}\lambda_{k}}&\frac{1}{1-\lambda_{2}\lambda_{k}}&\cdots&\frac{1}{1-\lambda_{k}^{2}}\end{array}\right] (36)
=det[11λ12000q22q2k0q2kqkk]\displaystyle=\det\left[\begin{array}[]{cccc}\frac{1}{1-\lambda_{1}^{2}}&0&\cdots&0\\ 0&q_{22}&\cdots&q_{2k}\\ \vdots&\vdots&\ddots&\vdots\\ 0&q_{2k}&\cdots&q_{kk}\end{array}\right] (41)

where

q22\displaystyle q_{22} =11λ2211λ1λ2×1λ121λ1λ2\displaystyle=\frac{1}{1-\lambda_{2}^{2}}-\frac{1}{1-\lambda_{1}\lambda_{2}}\times\frac{1-\lambda_{1}^{2}}{1-\lambda_{1}\lambda_{2}}
=12λ1λ2λ12λ22(1λ12λ22+λ12λ22)(1λ22)(1λ1λ2)2\displaystyle=\frac{1-2\lambda_{1}\lambda_{2}-\lambda_{1}^{2}\lambda_{2}^{2}-\left(1-\lambda_{1}^{2}-\lambda_{2}^{2}+\lambda_{1}^{2}\lambda_{2}^{2}\right)}{\left(1-\lambda_{2}^{2}\right)\left(1-\lambda_{1}\lambda_{2}\right)^{2}}
=(λ2λ1)2(1λ22)(1λ1λ2)2\displaystyle=\frac{\left(\lambda_{2}-\lambda_{1}\right)^{2}}{\left(1-\lambda_{2}^{2}\right)\left(1-\lambda_{1}\lambda_{2}\right)^{2}} (42)
q2k\displaystyle q_{2k} =11λ2λk11λ1λk×1λ121λ1λ2\displaystyle=\frac{1}{1-\lambda_{2}\lambda_{k}}-\frac{1}{1-\lambda_{1}\lambda_{k}}\times\frac{1-\lambda_{1}^{2}}{1-\lambda_{1}\lambda_{2}}
=(1λ1λ2)(1λ1λk)(1λ2λk)(1λ12)(1λ1λ2)(1λ1λk)(1λ2λk)\displaystyle=\frac{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)-\left(1-\lambda_{2}\lambda_{k}\right)\left(1-\lambda_{1}^{2}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)}
=1λ1λ2λ1λk+λ12λ2λk(1λ2λkλ12+λ12λ2λk)(1λ1λ2)(1λ1λk)(1λ2λk)\displaystyle=\frac{1-\lambda_{1}\lambda_{2}-\lambda_{1}\lambda_{k}+\lambda_{1}^{2}\lambda_{2}\lambda_{k}-\left(1-\lambda_{2}\lambda_{k}-\lambda_{1}^{2}+\lambda_{1}^{2}\lambda_{2}\lambda_{k}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)}
=λ1λ2λ1λk(λ2λkλ12)(1λ1λ2)(1λ1λk)(1λ2λk)\displaystyle=\frac{-\lambda_{1}\lambda_{2}-\lambda_{1}\lambda_{k}-\left(-\lambda_{2}\lambda_{k}-\lambda_{1}^{2}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)}
=(λ2λ1)(λkλ1)(1λ1λ2)(1λ1λk)(1λ2λk)\displaystyle=\frac{\left(\lambda_{2}-\lambda_{1}\right)\left(\lambda_{k}-\lambda_{1}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)} (43)
\displaystyle\dots

And then, we have

Fλ1,λ2,,λk\displaystyle F_{\infty}^{\lambda_{1},\lambda_{2},\dots,\lambda_{k}} =11λ12det[(λ2λ1)2(1λ22)(1λ1λ2)2(λ2λ1)(λkλ1)(1λ1λ2)(1λ1λk)(1λ2λk)(λ2λ1)(λkλ1)(1λ1λ2)(1λ1λk)(1λ2λk)(λkλ1)2(1λk2)(1λ1λk)2]\displaystyle=\frac{1}{1-\lambda_{1}^{2}}\det\left[\begin{array}[]{ccc}\frac{\left(\lambda_{2}-\lambda_{1}\right)^{2}}{\left(1-\lambda_{2}^{2}\right)\left(1-\lambda_{1}\lambda_{2}\right)^{2}}&\cdots&\frac{\left(\lambda_{2}-\lambda_{1}\right)\left(\lambda_{k}-\lambda_{1}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)}\\ \vdots&\ddots&\vdots\\ \frac{\left(\lambda_{2}-\lambda_{1}\right)\left(\lambda_{k}-\lambda_{1}\right)}{\left(1-\lambda_{1}\lambda_{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)\left(1-\lambda_{2}\lambda_{k}\right)}&\cdots&\frac{\left(\lambda_{k}-\lambda_{1}\right)^{2}}{\left(1-\lambda_{k}^{2}\right)\left(1-\lambda_{1}\lambda_{k}\right)^{2}}\end{array}\right] (47)
=11λ12i=2k(λiλ11λiλ1)2det[11λ2211λ2λk11λ2λk11λk2]\displaystyle=\frac{1}{1-\lambda_{1}^{2}}\prod_{i=2}^{k}\left(\frac{\lambda_{i}-\lambda_{1}}{1-\lambda_{i}\lambda_{1}}\right)^{2}\det\left[\begin{array}[]{ccc}\frac{1}{1-\lambda_{2}^{2}}&\cdots&\frac{1}{1-\lambda_{2}\lambda_{k}}\\ \vdots&\ddots&\vdots\\ \frac{1}{1-\lambda_{2}\lambda_{k}}&\cdots&\frac{1}{1-\lambda_{k}^{2}}\end{array}\right] (51)
=11λ12i=2k(λiλ11λiλ1)2×Fλ2,λ3,,λk\displaystyle=\frac{1}{1-\lambda_{1}^{2}}\prod_{i=2}^{k}\left(\frac{\lambda_{i}-\lambda_{1}}{1-\lambda_{i}\lambda_{1}}\right)^{2}\times F_{\infty}^{\lambda_{2},\lambda_{3},\dots,\lambda_{k}} (52)

Therefore, by Eq. (31) and Eq. (52), we have, Eq. (26) holds for n=kn=k.

In summary, the theorem is proven by the inductive method. \qed

Based on Theorem 1, the determinant of the controllability Grammian matrix and the volume of the controllability ellipsoid for the diagonal canonical form are as follows

det(G)\displaystyle\det\left(G_{\infty}\right) =FNλ1,λ2,,λni=1nbi2\displaystyle=F_{N}^{\lambda_{1},\lambda_{2},\dots,\lambda_{n}}\prod_{i=1}^{n}b_{i}^{2} (53)
vol(E)\displaystyle\textnormal{vol}\left(E_{\infty}\right) =Hndet(G)=HnFNλ1,λ2,,λni=1nbi2\displaystyle=H_{n}\sqrt{\det\left(G_{\infty}\right)}=H_{n}\sqrt{F_{N}^{\lambda_{1},\lambda_{2},\dots,\lambda_{n}}\prod_{i=1}^{n}b_{i}^{2}}
=Hn|1i<jnλjλi1λiλj|×|i=1nbi(1λi2)1/2|\displaystyle=H_{n}\left|\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right|\times\left|\prod_{i=1}^{n}\frac{b_{i}}{\left(1-\lambda_{i}^{2}\right)^{1/2}}\right| (54)

where the hypersphere volume-coefficient HnH_{n} and the Gamma function Γ(s)\varGamma(s) can be defined as

Hn\displaystyle H_{n} =πn/2Γ(n2+1)\displaystyle=\frac{\pi^{n/2}}{\varGamma\left(\frac{n}{2}+1\right)} (55)
Γ(s)\displaystyle\varGamma(s) ={(s1)Γ(s1)s>1πs=1/2\displaystyle=\left\{\begin{array}[]{ll}(s-1)\varGamma(s-1)&s>1\\ \sqrt{\pi}&s=1/2\end{array}\right. (58)

According to the above computation for the diagonal canonical form, a theorem on the the determinant of the controllability Grammian matrix and the volume of the controllability ellipsoid for the general systems Σ(A,B)\Sigma(A,B) is can be established as follows.

Theorem 2

For the LDT systems Σ(A,B)\Sigma(A,B) with nn different eigenvalues λi(1,1),i=1,n¯\lambda_{i}\in(-1,1),i=\overline{1,n}, the determinant of the controllability Grammian matrix and the volume the controllability ellipsoid for the systems can be computed analytically as follows

det(G)\displaystyle\det\left(G_{\infty}\right) =FNλ1,λ2,,λn(det(P)i=1nqiB)2\displaystyle=F_{N}^{\lambda_{1},\lambda_{2},\dots,\lambda_{n}}\left(\det(P)\prod_{i=1}^{n}q_{i}B\right)^{2} (59)
vol(E)\displaystyle\textnormal{vol}\left(E_{\infty}\right) =Hn|det(P)1i<jnλjλi1λiλj|×|i=1nqiB(1λi2)1/2|\displaystyle=H_{n}\left|\det(P)\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right|\times\left|\prod_{i=1}^{n}\frac{q_{i}B}{\left(1-\lambda_{i}^{2}\right)^{1/2}}\right| (60)

where qiq_{i} is the ii-th unit left eigenvector of the matrix AA, and the matrix PP is the diagonalization transformation matrix constructed by all unit right eigenvectors of matrix AA.

In papers [11], [4], [9], and [5], the determinant value det(GN)\det\left(G_{N}\right) of the controllability Grammian matrix GNG_{N} and the volume vol(EN)\textnormal{vol}\left(E_{N}\right) the controllability ellipsoid ENE_{N} are chosen as the objective functions for optimizing the control ability. Because lack of the analytical computing methods for det(GN)\det\left(G_{N}\right) and vol(EN)\textnormal{vol}\left(E_{N}\right), these optimizing problems for the control ability are solved very difficulty, and few achievements about that have been made. Based on the above analytical computing of det(G)\det\left(G_{\infty}\right) and vol(E)\textnormal{vol}\left(E_{\infty}\right), these optimizing problems for promoting the control ability can be solved conviently and the controlled plants with the better control abilty and dynamical performance can be designed.

3 Decoding the Controllability Ellipsoid

According to the computing equation (60), two factors are deconstructed as follows.

F1\displaystyle F_{1} =|1i<jnλjλi1λiλj|\displaystyle=\left|\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right| (61)
F2,i\displaystyle F_{2,i} =|qiB|(1λi2)1/2\displaystyle=\frac{\left|q_{i}B\right|}{\left(1-\lambda_{i}^{2}\right)^{1/2}} (62)

In fact, the above two factors can be used to describe the shape and size of the controllability ellipsoid ENE_{N} and the eigenvalue evenness of the LDT system.

3.1 The ellipsoid shape factor

The controllability ellipsoid ENE_{N} in the original space and the invariant eigen-space can be represented respectively as the following equation

xT(GN)1/2x1\displaystyle x^{T}\left(G_{N}\right)^{-1/2}x\leq 1 (63)
xT(G¯N)1/2x1\displaystyle x^{T}\left(\overline{G}_{N}\right)^{-1/2}x\leq 1 (64)

The nn radii of the ellipsoid E¯N\overline{E}_{N} in the invariant eigen-space are indeed the nn eigenvalues of the Garmmian matrix G¯N\overline{G}_{N}, and then the shape of the ellipsoid E¯N\overline{E}_{N} can be characterized by the sizes of all nn radii of the ellipsoid. So is the ellipsoid GNG_{N}.

By Eq. (61), we can see, when some two eigenvalues of the system matrix AA are approximately equal, the minimum radius of the ellipsoid E¯N\overline{E}_{N} will be approximately zero, and the ellipsoid E¯N\overline{E}_{N} will be flattened. Therefore, if the distributions of all eigenvalues of the matrix AA are even, the ratio between the minimum and maximum radii can be avoided as a small value and then the ellipsoid E¯N\overline{E}_{N} will be avoided flattened.

The factor F1F_{1} deconstructed from the volume computing equation (60) can be used to describe the evenness of the eigenvalue distribution of the Grammian matrix GNG_{N} and then the uniformity of the nn radii of the ellipsoid E¯N\overline{E}_{N}. The bigger the value of the factor F1F_{1}, the more evenness of the eigenvalue distribution of the matrix GNG_{N} in (1,1)(-1,1) is, the smaller the ratio between the minimum and maximum radii of the ellipsoid E¯N\overline{E}_{N} is, and then the greater the volume of the ellipsoid is.

To some extent, the minimum eigenvalue λmin(GN)\lambda_{\textnormal{min}}\left(G_{N}\right) of the Grammian matrix GNG_{N} and the minimum radius rmin(EN)r_{\textnormal{min}}\left(E_{N}\right) of the ellipsoid ENE_{N} can be used to quantify the control ability of the input variables to the state space, and then be chosen as the objective functions for optimizing the control ability of the dynamical systems in papers [11], [4], [9], and [5]. Due to lack of the analytical computing methods for λmin(GN)\lambda_{\textnormal{min}}\left(G_{N}\right) and rmin(EN)r_{\textnormal{min}}\left(E_{N}\right), these optimizing problems for the control ability are solved very difficulty. In fact, the minimum radius rmin(EN)r_{\textnormal{min}}\left(E_{N}\right), that is, the minimum distance between the original and the boundary of the ellipsoid, is proportional to the above shape factor F1F_{1}. The bigger the factor F1F_{1} is, and the bigger the minimum radius rmin(EN)r_{\textnormal{min}}\left(E_{N}\right) is. Therefore, optimizing the factor F1F_{1} is equal to optimizing λmin(GN)\lambda_{\textnormal{min}}\left(G_{N}\right) and rmin(EN)r_{\textnormal{min}}\left(E_{N}\right), and then based on the above analytical expression of the fact F1F_{1}, optimizing control ability of the LDT systems can be carried out conveniently and effectively.

Fig. 1 shows the 2-dimensional ellipsoids E30E_{30}, i.e., the sampling number N=30N=30, generated by the 3 matrix pairs (A,b)(A,b) that the matrix AA is with the different eigenvalues and matrix bb is a same vector, and Fig. 2 shows the 2-dimensional ellipsoids generated by the diagonal matrix pairs of these 3 matrix pairs (A,b)(A,b), that is, the ellipsoids in Fig. 2 are in the invariant eigen-space. These figures show us that the smaller the difference of two eigenvalues of the systems matrix AA is, the more flat the controllability ellipsoid is.

Refer to caption

(a) (0.85,0.9,0.2128))

Refer to caption

(b) (0.6,0.9,0.6522)

Refer to caption

(c) (0.4,0.9,0.7813)

Figure 1: The 2-dimensional ellipsoid with (λ1,λ2,F1)(\lambda_{1},\lambda_{2},F_{1})
Refer to caption

(a) (0.85,0.9,0.2128))

Refer to caption

(b) (0.6,0.9,0.6522)

Refer to caption

(c) (0.4,0.9,0.7813)

Figure 2: The 2-dimensional ellipsoid with (λ1,λ2,F1)(\lambda_{1},\lambda_{2},F_{1}) in the eigen-space

3.2 The shape factors in 2-dimensional section of the ellipsoid

In fact, the shape of the ellipsoid can be observed by the shape of the each 2-dimensional section of the ellipsoid in the eigen-space. For example, for any two eigenvalues λi\lambda_{i} and λj\lambda_{j}, the shape factor of the 2-dimensional section xixjx_{i}-x_{j} of the ellipsoid in the eigen-space can be deconstructed from the shape factor F1F_{1} as follows

F1,i,j=|λjλi1λiλj|\displaystyle F_{1,i,j}=\left|\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right| (65)

Therefore, all factor F1,i,jF_{1,i,j} can describe the shape of the each section of the ellipsoid and then can construct the shape factor F1F_{1} of the ellipsoid.

3.3 The eigenvalue evenness factor of the LDT system

Beyond for describing the shape of the ellipsoid, the factor F1F_{1} can be used to describe the evenness of the eigenvalue distribution of the LDT system Σ(A,B)\Sigma(A,B). The bigger the value of the factor F1F_{1} is, the more even the distribution of the nn eigenvalues of the matrix AA is, and then the bigger the controllable region of the system is, and the stronger the control ability of the systems is.

As we know, many computing and designing methods for control laws are based on the pole assignment method with a set of given expecting closed-loop poles. How to determine the expecting closed-loop poles to obtain the greater control ability and dynamical performance for the closed-loop systems? There has been no good answer to this question. By the above analysis, we can see, optimizing the evenness factor F1F_{1} of the given expecting closed-loop poles, we can get a clsode-loop system with the greater control ability and dynamical performance by the pole assignment control method.

3.4 The circumscribed hypercube and circumscribed rhomboid

The factor F2,iF_{2,i} is indeed the biggest distance of the boundary of the ellipsoid E¯N\overline{E}_{N} in the ii-dimensional space. In fact, the nn side lengths of the circumscribed hypercube of the ellipsoid E¯N\overline{E}_{N}, shown in Fig. 2, are 2F2,i,i=1,n¯2F_{2,i},i=\overline{1,n}, and then the volume of circumscribed hypercube is the production 2ni=1nF2,i2^{n}\prod_{i=1}^{n}F_{2,i} among the all factor F2,iF_{2,i}. By the volume equation (60), the volume of the ellipsoid can be represented as the volume of the circumscribed hypercube, the shape factor F1F_{1}, and some constant coefficient.

Therefore, we have the following discussions:

(1) When the circumscribed hypercubes of two controllability ellipsoids are approximated, the bigger the shape factor F1F_{1} is , the bigger the volume of the ellipsoid is. Furthermore, the almost all 2-dimensional shape factors F1,i,jF_{1,i,j} for some ellipsoid are bigger than the another, the whole ellipsoid can be said to be bigger than the another.

(2) When the shape factors F1F_{1} of two controllability ellipsoids are approximated, the bigger the circumscribed hypercubes is, the bigger the volume of the ellipsoid is. Furthermore, the almost all 2-dimensional shape factors F1,i,jF_{1,i,j} for the two ellipsoids are approximated, the whole ellipsoid with the bigger circumscribed hypercubes can be said to be bigger than the another.

4 Analytic Volume-Computation for the systems with the complex eigenvalues

Theorem 2 for the LDT systems with the real eigenvalues can be generalized to the LDT systems with the complex eigenvalues, and the corresponding the theorem can be stated as follows.

Theorem 3

When all nn different complex eigenvalues λi(i=1,n¯)\lambda_{i}\left(i=\overline{1,n}\right) of the LDT systems Σ(A,B)\Sigma(A,B) satisfy that |λi|[0,1)|\lambda_{i}|\in[0,1), the determinant of the controllability Grammian matrix and the volume the controllability ellipsoid for the systems can be computed analytically as follows

det(G)\displaystyle\det\left(G_{\infty}\right) =[det(P)1i<jnλjλi1λiλj]2[i=1n(qiB)21|λi|2]\displaystyle=\left[\det(P)\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right]^{2}\left[\prod_{i=1}^{n}\frac{\left(q_{i}B\right)^{2}}{1-\left|\lambda_{i}\right|^{2}}\right] (66)
vol(E)\displaystyle\textnormal{vol}\left(E_{\infty}\right) =Hn|det(P)1i<jnλjλi1λiλj|×|i=1nqiB(1|λi|2)1/2|\displaystyle=H_{n}\left|\det(P)\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right|\times\left|\prod_{i=1}^{n}\frac{q_{i}B}{\left(1-\left|\lambda_{i}\right|^{2}\right)^{1/2}}\right| (67)

where the complex vector qiq_{i} is the ii-th unit left eigenvector of the matrix AA, and the complex matrix PP is the diagonalization transformation matrix constructed by all unit right eigenvector of the matrix AA.

Similar to Section 3, based on these analytical expression, the shape factors of the controllability ellipsoid and the evenness factor of the eigenvalue distribution for LDT systems with complex eigenvalues can be got.

According to the computing equation (67), some factors described the shape and size of the controllability ellipsoid are deconstructed as follows.

F1\displaystyle F_{1} =|1i<jnλjλi1λiλj|\displaystyle=\left|\prod_{1\leq i<j\leq n}\frac{\lambda_{j}-\lambda_{i}}{1-\lambda_{i}\lambda_{j}}\right| (68)
F2,i\displaystyle F_{2,i} =|qiB|(1|λi|2)1/2\displaystyle=\frac{\left|q_{i}B\right|}{\left(1-\left|\lambda_{i}\right|^{2}\right)^{1/2}} (69)

Similar to the factors for the matrix AA with the real eigenvalues in Eqs. (61) and (62), the above factors can be describe the shape and size of the controllability ellipsoid ENE_{N} and the eigenvalue evenness factor of the LDT systems.

For the conjugate complex eigenvalue pair (λi,λi+1)=(λi,λi)\left(\lambda_{i},\lambda_{i+1}\right)=\left(\lambda_{i},\lambda_{i}^{*}\right), the shape factor of the 2-dimensional section of the ellipsoid in the eigen-space is

F1,i,i+1=|λiλi1λiλi|=2Imλi1|λi|2\displaystyle F_{1,i,i+1}=\left|\frac{\lambda_{i}^{*}-\lambda_{i}}{1-\lambda_{i}\lambda_{i}^{*}}\right|=\frac{2\textnormal{Im}\lambda_{i}}{1-\left|\lambda_{i}\right|^{2}} (70)

Fig. 3 shows the 2-dimensional ellipsoids EN(30)E_{N}(30) generated by the following matrix pairs (A,b)(A,b) with the complex eigenvalues

A=[0.8aa0.8],b=[11]\displaystyle A=\left[\begin{array}[]{cc}0.8&-a\\ a&0.8\end{array}\right],\;\;b=\left[\begin{array}[]{c}1\\ 1\end{array}\right] (75)

where a=0.1,0.2,0.3a=0.1,0.2,0.3, the corresponding the eirenvalues are 0.8±0.1i,0.8±0.2i,0.8±0.3i0.8\pm 0.1i,0.8\pm 0.2i,0.8\pm 0.3i, and the factors F1=1.032,2.282,4.121F_{1}=1.032,2.282,4.121. By Fig. 3, we can see, the bigger the image part of the conjugate complex eigenvalue pair is, the greater the volume of the ellipsoid.

Refer to caption
Figure 3: The 2-dimensional ellipsoid with the complex eigenvalues

5 Numerical Experiments

Example 1

Computing the volume, shape factor, and the side lengths of the circumscribe hypercube of the controllability ellipsoid generated by the following matrix pair

(A,b)=([0100010.4321.742.3],[001])\displaystyle(A,b)=\left(\left[\begin{array}[]{ccc}0&1&0\\ 0&0&1\\ 0.432&-1.74&2.3\end{array}\right],\left[\begin{array}[]{c}0\\ 0\\ 1\end{array}\right]\right) (82)

By the diagonal matrix transformation, the diagonal matrix pair is as follows

(A^,b^)=(diag{0.6,0.8,0.9},[2.034,7.158,5.235]T)\displaystyle\left(\hat{A},\hat{b}\right)=\left(\textnormal{diag}\{0.6,0.8,0.9\},[2.034,7.158,5.235]^{T}\right) (83)

and then, the analytical computing results about the volume and these factors are as Table 1

Table 1: Computing results of the volume and shape factors for the systems Σ(A,B)\Sigma(A,B)
factors values
volume: 298.8566
shape factor F1F_{1}: 0.0896
2-D shape factors F1,1,2,F1,1,3,F1,2,3F_{1,1,2},F_{1,1,3},F_{1,2,3}: 0.3846,   0.6522,   0.3571
the side length F2,1,F2,2,F2,3F_{2,1},F_{2,2},F_{2,3}: 2.5425,  11.9300,  12.0099

Fig. 4 shows the 3-dimensional ellipsoids EN(60)E_{N}(60) generated by the above matrix pairs (A^,b^)\left(\hat{A},\hat{b}\right) in the eigen-space, from three visual angle, and these 3 figures show us the 3 sections of the ellipsoid.

Refer to caption
Figure 4: The 3-dimensional ellipsoid in the eifen-sapce

6 Conclusions

In this article, we present three theorems and develop an effective analytical method to compute the volume of the controllability ellipsoid for the LDT systems with nn different eigenvalues. Furthermore, by deconstructing the analytical expression of the volume, some factors on the shape of the ellipsoid, the side length of its circumscribed rhomboid, the evenness of the eigenvalue distribution of the LDT system are constructed. Based on the analytical expression of the volume and these factors, the control ability can be defined, computing, analyzed, and optimized.

References

  • Canfield and Nkhumise [2017] S.L. Canfield, R. Nkhumise, Controllability ellipse to evaluate performance of mobile manipulators for manufacturing tasks, Journal of Mechanisms and Robotics 9 (2017).
  • Chen [1998] C.T. Chen, Linear system theory and design, Oxford University Press, Inc. New York, NY, USA, 3rd edition, 1998.
  • Dullerud and Paganini [2000] G.E. Dullerud, F. Paganini, A Course in Robust Control Theory: A Convex Approach, Sringer, 2000.
  • Georges [1995] D. Georges, The use of observability and controllability gramians or functions for optimal sensor and actuator location in finite-dimensional systems, in: Proc. of IEEE Conf. on Decision and Control, New Orleans, LA, USA, p. 3319–3324.
  • Ilkturk [2015] U. Ilkturk, Observability Methods in Sensor Scheduling, Ph.D. thesis, ARIZONA STATE UNIVERSITY, 2015.
  • Kailath [1980] T. Kailath, Linear systems, Prentice-Hall, Englewood Cliffs, NJ, 1980.
  • Kurzhanskiy and Varaiya [2007] A. Kurzhanskiy, P. Varaiya, Ellipsoidal techniques for reachability analysis of discrete-time linear systems, IEEE Trans. on Automatic Control 52 (2007) 26–38.
  • Nkhumise [2016] R.M. Nkhumise, Controllability Ellipse – a Method to Eavluate Performance of Mobile Manipulators Applied to Welding, Master’s thesis, Tennessee Technological University, 2016.
  • Pasqualetti et al. [2014] F. Pasqualetti, S. Zampieri, F. Bullo, Controllability metrics, limitations and algorithms for complex networks, IEEE Trans. on Control of Network Systems 1 (2014) 40–52.
  • Polyak et al. [2008] B. Polyak, S. Nazin, M. Khlebnikov, The invariant ellipsoid technique for analysis and design of linear control systems, in: Advances in Mechanics: Dynamics and Control: Proceedings of the 14th International Workshop on Dynamics and Control, ed. F.L. Chernousko, G.V. Kostin, V.V. Saurin, Moscow: Nauka,, pp. 239–246.
  • VanderVelde and Carignan [1982] W. VanderVelde, C. Carignan, A dynamic measure of controllability and observability for the placement of actuators and sensors on large space structures, Technical Report, NASA-CR-168520, SSL-2-82, 1982.