Table 2 Sub-optimal solutions for 2-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 | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Â | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | Â | Â |
k = 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 12.5 | 0.156 |
| Â | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | Â | Â |
k = 1 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | 1 | 1 | 11.5 | 0.718 |
| Â | 0 | 0 | 0 | 0 | 0 | 2 | 2 | 1 | 1 | 1 | Â | Â |
| Â | 0 | 0 | 0 | 0 | 2 | 0 | 2 | 1 | 1 | 1 | Â | Â |
k = 2 | 0 | 0 | 0 | 2 | 0 | 0 | 2 | 1 | 1 | 1 | 15.5 | 9.375 |
| Â | 0 | 0 | 2 | 0 | 0 | 0 | 2 | 1 | 1 | 1 | Â | Â |
| Â | 0 | 2 | 0 | 0 | 0 | 0 | 2 | 1 | 1 | 1 | Â | Â |
| Â | 2 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | 1 | 1 | Â | Â |