Pith. sign in

REVIEW 1 cited by

Six-Degree-of-Freedom Aircraft Landing Trajectory Planning with Runway Alignment

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 2405.16680 v2 pith:V45QPJ7N submitted 2024-05-26 math.OC

classification math.OC
keywords alignmentrunwayaircrafttrajectoryalgorithmapproachconstraintlanding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a numerical optimization algorithm for generating approach and landing trajectories for a six-degree-of-freedom (6-DoF) aircraft. We improve on the existing research on aircraft landing trajectory generation by formulating the trajectory optimization problem with additional real-world operational constraints, including 6-DoF aircraft dynamics, runway alignment, constant wind field, and obstacle avoidance, to obtain a continuous-time nonconvex optimal control problem. Particularly, the runway alignment constraint enforces the trajectory of the aircraft to be aligned with the runway only during the final approach phase. This is a novel feature that is essential for preventing an approach that is either too steep or too shallow. The proposed method models the runway alignment constraint through a multi-phase trajectory planning scheme, imposing alignment conditions exclusively during the final approach phase. We compare this formulation with the existing state-triggered constraint formulation for runway alignment. To solve the formulated problem, we design a novel sequential convex programming algorithm called xPTR that extends the penalized trust-region (PTR) algorithm by incorporating an extrapolation step to expedite convergence. We validate the proposed method through extensive numerical simulations, including a Monte Carlo study, to evaluate the robustness of the algorithm to varying initial conditions.

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. Optimal Preconditioning for Online Quadratic Cone Programming

    math.OC 2025-01 accept novelty 5.0 of 10

    For quadratic cone programs with strongly convex objectives, choosing the objective scaling factor as sqrt(sigma_min / 2) provably minimizes the KKT condition number, and packaging this with hypersphere and row-normal...

Pith tools