Timeline for LQR optimal control of accumulator via dynamic programming
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2021 at 23:53 | comment | added | John L. | Good point. I just updated the brute-force program to output the optimal sequences. | |
| Oct 29, 2021 at 23:52 | history | edited | John L. | CC BY-SA 4.0 |
As Rodrigo de Azevedo pointed out, there are two optimal control sequences.
|
| Oct 29, 2021 at 22:18 | comment | added | Rodrigo de Azevedo |
Have you tried [-3. -1. 0. 0.]?
|
|
| Oct 29, 2021 at 22:11 | comment | added | John L. | Yes, "-3, -1, -1, 0" for the problem in question. | |
| Oct 29, 2021 at 22:07 | comment | added | Rodrigo de Azevedo | Are you sure the input sequence you found is unique? | |
| Oct 24, 2021 at 18:52 | history | edited | John L. | CC BY-SA 4.0 |
Minor improvement.
|
| Oct 24, 2021 at 2:44 | history | edited | John L. | CC BY-SA 4.0 |
Added brute force by programming as well as an approach using dynamic programming.
|
| Oct 23, 2021 at 8:48 | history | edited | John L. | CC BY-SA 4.0 |
Added the optimal control sequence.
|
| Oct 23, 2021 at 8:42 | history | edited | John L. | CC BY-SA 4.0 |
Fixed a typo.
|
| Oct 23, 2021 at 8:33 | history | answered | John L. | CC BY-SA 4.0 |