From Antsaklis & Michel. A Linear Systems Primer. Exercise: 5.4. Consider the state equation,
x[k + 1] = [1 1 0; 0 1 0; 0 0 1]x[k] + [0; 1; 1]u[k], y[k] = [1 1 0; 0 1 0]x[k].
(a) Is x1 = [3; 2; 2] reachable? If yes, what is the minimum number of steps required to transfer the state from the zero state to x1? What inputs do you need?
(b) Determine all states that are reachable.
(c) Determine all states that are unobservable.
(d) Optional - Extra Credit, 2 extra points!! If x_dot = Ax + Bu is given with (A, B) as in (a), what is the minimum time required to transfer the state from the zero state to x1? What is an appropriate u(t)?