Positive Input Reachability And Controllability Of Positive Systems
Document Type
Article
Publication Date
9-1-1987
Published In
Linear Algebra And Its Applications
Abstract
We study controllability and reachability for discrete linear control systems, x(k + 1) = Ax(k) + Bu(k), in which the state vector x(k), the control vector u(k), the n × n matrix A, and the n × m matrix B have nonnegative entries. For an unconstrained system, controllability is equivalent to reachability from the zero state in n steps. Furthermore, (A, B) is controllable if and only if the matrix Cₙ = [B AB A²B ⋅⋅⋅ Aⁿ⁻¹B] has rank n. We show that these properties are not equivalent for positive systems. This has important implications for control strategy. The timing of control inputs and the size and structure of the control matrix B are much more critical. The zero-nonzero pattern of Cₙ plays a crucial role. We illustrate these fundamental differences with models of a two species reversible chemical reaction, and with two pharmacokinetic models of drug distribution in the human body.
Recommended Citation
P. G. Coxson and Helene Shapiro.
(1987).
"Positive Input Reachability And Controllability Of Positive Systems".
Linear Algebra And Its Applications.
Volume 94,
35-53.
DOI: 10.1016/0024-3795(87)90076-0
https://works.swarthmore.edu/fac-math-stat/229