Convex programming approach to powered descent guidance for mars landing

710 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

ECOS: An SOCP solver for embedded systems (2013, background): “6-8] for some potential applications of SOCPs; a recent example for real-time SOCP is minimum-fuel powered descent for landing spacecraft [10].”
Solving Nonconvex Optimal Control Problems by Convex Optimization (2014, methodology): “In the last few years, however, a practical and well-formulated planetary soft-landing problem has been cast into a convex problem by a novel lossless convexification method to overcome nonconvex control constraints and successfully solved by a primal-dual interior-point algorithm [7–10].”
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization (2010, methodology): “The 2009 Mars Science Laboratory mission aims to achieve a landing ellipse of around 10 km [3].”
Entry Trajectory Optimization by Second-Order Cone Programming (2016, background): “[1–5], and relaxation methodology for the problem of spacecraft rendezvous and proximity operations in Refs.”
Survey of convex optimization for aerospace applications (2017, background): “Nevertheless, it can be relaxed into the following convex control constraints [10]:”
Autonomous Trajectory Planning for Rendezvous and Proximity Operations by Conic Optimization (2012, methodology): “(54) [11].”