Given a reachable discrete-time linear system (A, b), the reachable set is a cone when a positive constraint is imposed on the input. The problem to be studied is the geometrical structure of the reachable set R = cone(b, Ab, A(2)b,...) in terms of the spectrum of A. Zn particular, conditions which ensure R, or its closure (R) over bar, is a polyhedral proper cone are derived. The impact of the given results on finite-time reachability and positive realizability is also discussed.
Polyhedral reachable set with positive controls / Farina, Lorenzo; Benvenuti, Luca. - In: MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS. - ISSN 0932-4194. - 10:4(1997), pp. 364-380. [10.1007/bf01211552]
Polyhedral reachable set with positive controls
FARINA, Lorenzo;BENVENUTI, Luca
1997
Abstract
Given a reachable discrete-time linear system (A, b), the reachable set is a cone when a positive constraint is imposed on the input. The problem to be studied is the geometrical structure of the reachable set R = cone(b, Ab, A(2)b,...) in terms of the spectrum of A. Zn particular, conditions which ensure R, or its closure (R) over bar, is a polyhedral proper cone are derived. The impact of the given results on finite-time reachability and positive realizability is also discussed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
