Reentry trajectory optimization with generalized waypoint constraint using adaptive matching-correction strategy

The reentry trajectory optimization problem with the generalized waypoint constraint is solved using the adaptive matching-correction strategy in this paper. Generally, the reentry trajectory optimization problems are complicated due to their highly nonlinear dynamics and complex path constraints. Particularly, this paper considers the generalized waypoint constraint and proposes the adaptive matching-correction strategy to handle it. Two steps are included in the proposed strategy: “matching step” and “correction step”. The core idea is to find the edge that best matches the generalized waypoint constraint in the process of algorithm iteration, and then pull the edge into the constraint's zone. Compared with the traditional methods to cope with similar problems, the idea of multi-phase optimization is not needed, enhancing the algorithm's ability to tackle the abrupt appearance of the generalized waypoint. Extensive numerical simulations with comparisons are provided to demonstrate the superior performance of the proposed strategy.