ある種の非線形離散時間システムの最小実現

概要

論文の詳細を見る
Polynomial state-affine systems described by {x(k+1)=(A+∑ri=1ui(k)Ni)x(k)+∑ri=1ui(k)Biy(k)=Cx(k) can be considered to constitute an important class of nonlinear discrete-time systems, which corresponds to a class of bilinear systems in continuous-time systems. The purpose of this paper is to investigate the criteria for span-reachability and distinguishability of the polynomial state-affine systems, and to develop an algorithm for the minimal realization by extensively using the generalized Hankel matrix, which was originally introduced by Isidori for the minimal realization of bilinear, systems. Further application of this algorithm is attempted to realize a particular class of systems whose input/output maps can be expressed in polynomial forms of input variables.
公益社団法人計測自動制御学会の論文