Determination of the Transitivity of Bilinear Systems

We consider a bilinear control system on R₀ⁿ = Rⁿ - \ 0\\[{{dx}}{{dt}}(A_0 + ∑i = 1^r {u_i (t)A_i } )x,\] where x ∈ Rⁿ ,A₀, A₁ , ⋯ ,Aᵣ are n × n real matrices, g is the Lie algebra they generate, and u₁ (t), ⋯ ,uᵣ (t) are real valued control functions. Although there exists a standard rank condition in terms of the Lie algebra g which Sussman and Jurdjevic have shown to be sufficient to guarantee accessibility, it is primarily of theoretical interest, being essentially impossible to apply to given data. In this paper the authors investigate the possibility of developing algorithms involving only rational computations on the matrices, which would determine whether the rank condition is everywhere satisfied, i.e. whether the bilinear system has the accessibility or, in some instances, controllability property. This is equivalent to determining whether or not the matrix Lie group G generated by exp (tAᵢ ), i = 0,1, ⋯ ,r, is or is not transitive on R₀ⁿ. The possible transitive Lie groups have been classified by one of the authors. Using this classification, it is shown that there do exist various sequences of rational operations on the matrices A₀ ,A₁ , ⋯ ,Aᵣ which enable one in a finite number of steps to decide whether or not the system has the accessibility-transitivity property.