Title :
Computation of state reachable points of descriptor systems
Author :
Datta, Subashish ; Mehrmann, Volker
Author_Institution :
Inst. fur Math., Tech. Univ. Berlin, Berlin, Germany
Abstract :
This paper considers the problem of computing the state reachable points, from the origin, of a linear constant coefficient descriptor system. A numerical algorithm is proposed that can be implemented to characterize the reachable set in a numerically stable way. The original descriptor system is transformed into a strangeness-free system within the behavioral framework followed by a projection that separates the system into its differential and algebraic parts. It is shown that the computation of the image space of two matrices, associated with the projected system, is enough to compute the reachable set (from the origin). Moreover, a characterization is presented of all the inputs by which one can reach to any arbitrary points in the reachable set. The effectiveness of the proposed approach is demonstrated through numerical examples.
Keywords :
differential algebraic equations; matrix algebra; reachability analysis; set theory; behavioral framework; descriptor systems; linear constant coefficient descriptor system; numerical algorithm; state reachable points; strangeness-free system; Arrays; Differential equations; Equations; Indexes; Mathematical model; Trajectory; Vectors; Linear descriptor system; behavior formulation; reachability; strangeness-free formulation;
Conference_Titel :
Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
978-1-4799-7746-8
DOI :
10.1109/CDC.2014.7040391