Pith. sign in

REVIEW 1 cited by

Successive Convexification for Real-Time 6-DoF Powered Descent Guidance with State-Triggered Constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.10803 v1 pith:N3TMS7AB submitted 2018-11-27 math.OC

classification math.OC
keywords constraintsproblemalgorithmcontroldescentformulationguidanceoptimal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper, we present a real-time successive convexification algorithm for a generalized free-final-time 6-degree-of-freedom powered descent guidance problem. We build on our previous work by introducing the following contributions: (i) a free-ignition-time modification that allows the algorithm to determine the optimal engine ignition time, (ii) a tractable aerodynamics formulation that models both lift and drag, and (iii) a continuous state-triggered constraint formulation that emulates conditionally enforced constraints. In particular, contribution (iii) effectively allows constraints to be enabled or disabled by if-statements conditioned on the solution variables of the parent continuous optimization problem. To the best of our knowledge, this represents a novel formulation in the optimal control literature, and enables a number of interesting applications, including velocity-triggered angle of attack constraints and range-triggered line of sight constraints. Our algorithm converts the resulting generalized powered descent guidance problem from a non-convex free-final-time optimal control problem into a sequence of tractable convex second-order cone programming subproblems. With the aid of virtual control and trust region modifications, these subproblems are solved in succession until convergence is attained. Simulations using a third-party solver demonstrate the real-time capabilities of the proposed algorithm, with a maximum execution time of less than 0.7 seconds over a multitude of problem feature combinations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Auto-tuned Primal-dual Successive Convexification for Hypersonic Reentry Guidance

    math.OC 2024-11 conditional novelty 6.0 of 10

    Auto-SCvx automatically updates penalty weights via closed-form dual variable updates, achieving feasible hypersonic reentry trajectories without hand-tuning constraint penalties.

Pith tools