Research Article
Near-Optimal Guidance with Impact Angle and Velocity Constraints Using Sequential Convex Programming
Table 1
The difference of the states between each iteration for Case A.
| Iteration number | | | | |
| 1 | 1609.9 | 99.583 | 34.035 | 9.9714 | 2 | 1153.1 | 22.390 | 20.542 | 4.9468 | 3 | 392.14 | 26.228 | 5.8535 | 4.6356 | 4 | 109.04 | 7.3673 | 2.0949 | 0.7755 | 5 | 172.03 | 7.4144 | 3.1740 | 0.9927 | 6 | 24.083 | 1.4514 | 0.6722 | 1.1575 | 7 | 12.165 | 0.4772 | 0.1826 | 0.0942 | 8 | 6.8327 | 0.3021 | 0.1312 | 0.0663 | 9 | 7.9768 | 0.5660 | 0.2726 | 0.3389 | 10 | 6.1521 | 0.5061 | 0.2743 | 0.4331 | 11 | 6.3616 | 0.5203 | 0.2565 | 0.4382 | 12 | 6.4974 | 0.5345 | 0.2853 | 0.4701 | 13 | 0.7938 | 0.0694 | 0.0382 | 0.0506 |
|
|