In this post I introduce the mathematical language that will be frequently used to develop further concepts and topics in this blog.
Here I basically adopt the notation, ideas and principles of behavioral system theory. I include some references to complete material (including proofs) regarding this theory at the end of this post.
Notation
Rn denotes the space of n dimensional real vectors.
Rm×n denotes the space of m×n real matrices.
R∙×m denotes the space of real matrices with m columns and an unspecified finite number of rows.
Given matrices A,B∈R∙×m, col(A,B) denotes the matrix obtained by stacking A over B.
R[s] denotes the ring of polynomials with real coefficients in the indeterminate s.
Rm×n(s) denotes the set of rational m×n matrices.
C∞(R,Rw) denotes the set of infinitely differentiable functions from R to Rw.
Linear differential behaviors
Consider a linear time-invariant dynamical system whose physical laws are described by the following set of linear differential equations:
R0w+R1ddtw+...+RLdLdtLw=0.
with Ri∈R∙×w, i=0,...,L, and w=col(w1,...,ww) is the vector of external variables.
Such equations can be expressed in a compact way as
R(ddt)w=0,
where R∈R∙×w[s]. Therefore, R(s)=R0+R1s+⋯+RLsL, represents the set of differential equations.
If we adopt C∞ as solution space, we can define a linear differential behavior as
B:={w∈C∞(R,Rw) ∣ R(ddt)w=0}.
In other words, the behavior is defined as the set of trajectories in the kernel of R. For simplicity, we often refer to this set of trajectories as ker R(ddt).
The set of linear differential behaviors taking their values in the signal space Rw is denoted by Lw.
Controllability and Observability
Definition 1. A behavior B∈Lw is controllable if for all w1,w2∈B there exists a t′≥0 and w∈B, such that w(t)=w1(t) for t<0 and w(t+t′)=w2(t) for t≥0.
Controllability can be characterized algebraically as follows.
Proposition 1. Let B:=ker R(ddt), with R∈R∙×w[s]. B is controllable iff R(λ) is full row rank for all λ∈C.
Controllable behaviors admit a special representation called image representation.
Controllable behaviors admit a special representation called image representation.
Proposition 2. Let B∈Lw. There exists z∈N and M∈Rw×z[s] such that B={w ∣ ∃z∈C∞(R,Rz)s.t.w=M(ddt)z}, iff B is controllable.
A behavior described by an image representation w=M(ddt)z as in Prop. 2, is denoted by im M(ddt). The auxiliary variable z is called latent variable whose solution space is C∞(R,Rz).
Definition 2. Let B∈Lw. Partition the external variable as w=col(w1,w2). The variable w2 is observable from w1 if for all col(w1,w2),col(w1,w′2)∈B, it follows that w2=w′2.
Proposition 3. Let B∈Lw be a controllable behavior described by w=M(ddt)z. The latent variable z is observable from w iff M(λ) is of full column rank for all λ∈C.
References:
[1] Polderman, J. W., Willems, J. C., Introduction to mathematical systems theory: a behavioral approach, Springer, 1998.
[2] Willems, J. C., The behavioral approach to open and interconnected systems, IEEE Control Systems, no. 6, pp. 46-99, 2007.
No comments:
Post a Comment