A Comparison of Powered Descent Guidance Laws for Mars Pinpoint Landing

Ploen, Scott R.; Açıkmeşe, A. Behçet; Wolf, Aron A.

doi:10.2514/6.2006-6676

Cited by 51 publications

(35 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, when large target redesignations are needed, the Apollo guidance uses much more fuel than a fuel optimal trajectory. 6,7 Also, care must be taken to define a proper value of t go in order that the trajectory meet the desired characteristics. More details of the Apollo lunar descent guidance can be found in references 8, 9, and 10.…”

Section: Iia Apollo Lunar Descent Guidancementioning

confidence: 99%

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

Rea

2010

AIAA Guidance, Navigation, and Control Conference

View full text Add to dashboard Cite

Current renewed interest in exploration of the moon, Mars, and other planetary objects is driving technology development in many fields of space system design. In particular, there is a desire to land both robotic and human missions on the moon and elsewhere. The landing guidance system must be able to deliver the vehicle to a desired soft landing while meeting several constraints necessary for the safety of the vehicle. Due to performance limitations of current launch vehicles, it is desired to minimize the amount of fuel used. In addition, the landing site may change in real-time in order to avoid previously undetected hazards which become apparent during the landing maneuver.This complicated maneuver can be broken into simpler subproblems that bound the full problem. One such subproblem is to find a minimum-fuel landing solution that meets constraints on the initial state, final state, and bounded thrust acceleration magnitude. With the assumptions of constant gravity and negligible atmosphere, the form of the optimal steering law is known, and the equations of motion can be integrated analytically, resulting in a system of five equations in five unknowns. It is shown that this system of equations can be reduced analytically to two equations in two unknowns. With an additional assumption of constant thrust acceleration magnitude, this system can be reduced further to one equation in one unknown. It is shown that these unknowns can be bounded analytically. An algorithm is developed to quickly and reliably solve the resulting one-dimensional bounded search, and it is used as a real-time guidance applied to a lunar landing test case.

show abstract

Section: Iia Apollo Lunar Descent Guidancementioning

confidence: 99%

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

Rea

2010

AIAA Guidance, Navigation, and Control Conference

View full text Add to dashboard Cite

show abstract

“…8. The control command u is calculated via the Apollo polynomial descent guidance law (Klumpp, 1974;Ploen et al, 2006).…”

Section: Idr/mo Navigation Performances Verificationmentioning

confidence: 99%

An innovative navigation scheme of powered descent phase for Mars pinpoint landing

Qin

Zhu

Cui

et al. 2014

Advances in Space Research

View full text Add to dashboard Cite

“…The explicit enforcement of the lower bound on thrust magnitude and the numerical efficiency and accuracy make the convex PDG algorithm a strong candidate for flight implementation [9]. Additionally, compared to heritage algorithms, the convex PDG algorithm provides a significant increase in the initial states from which pinpoint landing can be achieved [11].…”

Section: Introductionmentioning

confidence: 98%

“…These approaches provide guidance solutions that have a limited envelop of initial states from which a spacecraft can maneuver toward the desired target without violating the physical state and control constraints [11]. Other methods enforce the appropriate constraints but with nonlinear optimization [6], [7], which has no guarantee on convergence time or that the most fuel optimal solution will be found.…”

Section: Introductionmentioning

confidence: 99%

Lossless convexification of Powered-Descent Guidance with non-convex thrust bound and pointing constraints

Carson

Açıkmeşe

Blackmore

2011

Proceedings of the 2011 American Control Conference

View full text Add to dashboard Cite

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.

show abstract

A Comparison of Powered Descent Guidance Laws for Mars Pinpoint Landing

Cited by 51 publications

References 6 publications

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

Analytical Dimensional Reduction of a Fuel Optimal Powered Descent Subproblem

An innovative navigation scheme of powered descent phase for Mars pinpoint landing

Lossless convexification of Powered-Descent Guidance with non-convex thrust bound and pointing constraints

Contact Info

Product

Resources

About