DocumentCode :
3038138
Title :
Reachability and controllability of discrete time descriptor systems
Author :
Anastasia, G. ; Karampetakis, Nicholas P.
Author_Institution :
Dept. of Math., Aristotle Univ. of Thessaloniki, Thessaloniki, Greece
fYear :
2012
fDate :
6-8 Dec. 2012
Firstpage :
1
Lastpage :
6
Abstract :
The causal and non-causal reachability Gramians are used, in order to define the reachability subspace which is the set of all states reachable from the origin. Controllability of the disrete-time regular descriptor system by means of the forward solution is examined and new criteria for testing reachability (controllability from the origin) and controllability to the origin in the forward sense are proved.
Keywords :
controllability; discrete time systems; reachability analysis; set theory; causal reachability Gramians; discrete time regular descriptor system controllability; discrete time regular descriptor system reachability subspace; forward solution; noncausal reachability Gramians; Controllability; Educational institutions; Equations; Testing; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Computing and Control Applications (CCCA), 2012 2nd International Conference on
Conference_Location :
Marseilles
Print_ISBN :
978-1-4673-4694-8
Type :
conf
DOI :
10.1109/CCCA.2012.6417867
Filename :
6417867
Link To Document :
بازگشت