Convex Optimisation Algorithm & The Unique Problem Of Rocket Landings

SpaceX recently utilised a convex optimisation method to figure out the optimal landing route for the rocket, which was aided by real-time computer vision data. In a rocket, the landing trajectory should be replanned in real time to accomplish precision landing under substantial initial state deviation. When new data is acquired while in flight, rapid progression, a way of planning that can meet the real-time need, will be required in the future.  The landing trajectory planning issue is highly nonconvex due to nonlinear dynamics and many nonconvex state and control restrictions, making it challenging to solve in real time using existing nonconvex optimization algorithms.  In solving fast trajectory optimization issues, a study found that convex optimization approaches have