Table 6 Sub-optimal solutions for 3-gene example (T = 10) by Reserving Place Algorithm
From: On finite-horizon control of genetic regulatory networks with multiple hard-constraints
k | Control Strategy σ = i1i2 …, iT | Cost | Computing Time | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
k = 0 | Â | Â | Â | Â | - | Â | Â | Â | Â | Â | - | 0.08 |
k = 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 2 | 6.5 | 0.644 |
| Â | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | Â | Â |
k = 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 2 | 8 | 6.22 |