Guidance, Navigation and Control · Trajectory Optimization and Predictive Guidance · M9-L2 · Advanced
Solve the Landing as a Convex Program
Bench log · Hopper on the test range
13:50. Hopper has to land from 250 m and 150 m to one side, with an engine that cannot be throttled below 30% and a glide-slope cone that keeps it clear of the test tower. The guidance engineer has a trajectory from a spreadsheet, and the thrust falls to zero in the middle of it.
You will pick the descent time, pose the landing as a convex problem and solve it with the course solver, and make the guidance replan when a gust displaces the vehicle.
Your task
Lab complete: post-mortem
You have passed every stage. Now connect it back to the theory and move on:
Output
What Python can I use?
Plain Python 3 with the standard library and the course library gnckit: g.solve_convex(c, A, b, G, h, socs) minimizes c·x subject to A x = b, G x ≤ h and second-order cone constraints ||F x + g|| ≤ q·x + d. A solve takes about two seconds in the browser. Your code runs in a background worker: an endless loop is stopped after a few seconds.