infinite-horizon-of-sls
1 Reconstructing SLPs
Assume there exist satisfying
(1) | ||||
(2) |
The transfer functions
satisfies
(3) | ||||
(4) |
2 Notation for sparsity
11todo: 1Notational clash. We use both for sparse transfer functions and for computing the output feedback.Then , and . As each row will be sparse, we denote the reduced transfer function consisting only of the nonzero elements (in order) as . Similarly, denotes the sparse version of .
3 Computing the control signal
Let , , . The control signal is then computed as
(5) | ||||
Note that . Let
(6) | ||||||
Equation (5) then becomes
(7) | ||||
We now show how to compute . Let and . Then compute and . Finally , , , and .
(8) | ||||||
3.1 Simplification for observer-based state feedback
In this case we have and . In this case
(9) | ||||||
Furthermore
3.2 Localized computation of signals.
We will divide the computation into steps performed by each node .
Step one: form and .
Collect and from and stack them in order to form the column vectors and .
Step two: evaluate and at time .
From Jing’s previous work we have state-space realizations
Propagate the following linear system once
Step three: form and .
Collect and from and stack them in order to form the column vectors and .
Step four: compute and .
Note that and are available for computation at time , so that can be done directly in each node . Further and .
Step five: Compute , , , and .
Propagate the following linear systems once
Step six: Compute , . and .
Step seven: form and .
Collect and from and and stack them in order to form the column vectors and respectively.
Compute and .
3.3 Special case: observer-based local feedback
We will divide the computation into steps performed by each node .
Step one: form and .
Collect and from and stack them in order to form the column vectors and .
Step two: evaluate and at time .
From Jing’s previous work we have state-space realizations
Propagate the following linear system once
Step three: form and .
Collect and from and stack them in order to form the column vectors and .
Step four: compute and .
Note that and are available for computation at time , so that can be done directly in each node . Further
and
Step five: Compute , , , and .
Propagate the following states once
Observe them:
Step six: Compute , . and .
Step seven: form and .
Collect and from and and stack them in order to form the column vectors and respectively.