DocumentCode :
803257
Title :
Determination of reachable set for a linear discrete system
Author :
Lin, Jeng N.
Author_Institution :
Lockheed-Georgia Company, Marrieta, Georgia, USA
Volume :
15
Issue :
3
fYear :
1970
fDate :
6/1/1970 12:00:00 AM
Firstpage :
339
Lastpage :
342
Abstract :
An easily implemented method for obtaining the reachable set 
, of an 
th-order discrete system with constraints on the input is described. This method uses elementary matrix calculations at each step to construct the boundary hyperplanes of the reachable set. The result can be applied to determine the minimum control time required for a given terminal state. If 
, the method of echelon matrix analysis is employed to solve the same problem.
, of an th-order discrete system with constraints on the input is described. This method uses elementary matrix calculations at each step to construct the boundary hyperplanes of the reachable set. The result can be applied to determine the minimum control time required for a given terminal state. If , the method of echelon matrix analysis is employed to solve the same problem.Keywords :
Linear systems, time-invariant discrete-time; Control systems; Cost function; Density functional theory; Filters; Optimal control; Sampling methods; Standards development; State estimation; Stochastic resonance; Testing;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.1970.1099456
Filename :
1099456
Link To Document :
