Location of Repository

Lossless Convexification of Powered-Descent Guidance with Non-Convex Thrust Bound and Pointing Constraints

By John M. Carson Iii and Lars Blackmore

Abstract

Abstract — A numerically-efficient, convex formulation of PDG (Powered-Descent Guidance) for Mars pinpoint and precision landing has been enhanced to include thrust pointing constraints. The original algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, maximum speed limits and descent within a glideslope cone (surface impact avoidance). The thrust bounds are non-convex, so the original formulation developed a lossless convexification of these constraints. Likewise, thrust pointing constraints are non-convex. In this paper we present a relaxation for the thrust pointing constraint such that the enhanced PDG algorithm generates a lossless convexification for both the thrust bound and thrust pointing constraints. Pointing constraints are needed for onboard terrain-relative sensors that have specific field-of-view requirements during landing. I

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.298.1226
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.mit.edu/larsb/www/C... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.