TY - JOUR
T1 - Position-Domain GS-MPCP for Multi-Constraint Flight-Vehicle Trajectory Planning
AU - Zhang, Yonghua
AU - Wang, Zheng
AU - Liu, Yufeng
AU - Qiu, Yanghong
AU - Li, Jiatong
AU - Ning, Xin
AU - Chen, Zhansheng
N1 - Publisher Copyright:
© 2026 Technical Committee on Guidance, Navigation and Control, CSAA.
PY - 2026
Y1 - 2026
N2 - This paper develops a position-domain guidance optimization framework that adopts alongtrack position as the independent variable, enabling spatially indexed enforcement of geometric constraints and decoupling trajectory shaping from time parameterization. Building on this framework, a position-domain generalized spectral model predictive convex programming (PGS-MPCP) method is proposed to remove reliance on a prespecified terminal time or fixed time window, thereby mitigating time-windowinduced infeasibility in multi-constraint missions involving detours, altitude corridors, and no-fly-zone avoidance. The method is validated on a representative sea-skimming precision-strike planning problem with waypoint and terminal impact-angle constraints. Numerical results demonstrate that PGS-MPCP provides substantial improvements over representative MPSP variants in terms of terminal/waypoint accuracy and feasibility preservation. Relative to convex-optimization and pseudospectral methods, it achieves a favorable balance among computational efficiency, constraint satisfaction, and terminal performance, which makes it promising for online planning and real-time guidance. Additional Monte Carlo studies under both initial-condition perturbations and waypoint-geometry uncertainty further verify stable convergence and robust feasibility preservation.
AB - This paper develops a position-domain guidance optimization framework that adopts alongtrack position as the independent variable, enabling spatially indexed enforcement of geometric constraints and decoupling trajectory shaping from time parameterization. Building on this framework, a position-domain generalized spectral model predictive convex programming (PGS-MPCP) method is proposed to remove reliance on a prespecified terminal time or fixed time window, thereby mitigating time-windowinduced infeasibility in multi-constraint missions involving detours, altitude corridors, and no-fly-zone avoidance. The method is validated on a representative sea-skimming precision-strike planning problem with waypoint and terminal impact-angle constraints. Numerical results demonstrate that PGS-MPCP provides substantial improvements over representative MPSP variants in terms of terminal/waypoint accuracy and feasibility preservation. Relative to convex-optimization and pseudospectral methods, it achieves a favorable balance among computational efficiency, constraint satisfaction, and terminal performance, which makes it promising for online planning and real-time guidance. Additional Monte Carlo studies under both initial-condition perturbations and waypoint-geometry uncertainty further verify stable convergence and robust feasibility preservation.
KW - Trajectory planning
KW - convex optimization
KW - model predictive static programming (MPSP)
KW - multiple constraints
UR - https://www.scopus.com/pages/publications/105039696612
U2 - 10.1142/S2737480726500093
DO - 10.1142/S2737480726500093
M3 - 文章
AN - SCOPUS:105039696612
SN - 2737-4807
JO - Guidance, Navigation and Control
JF - Guidance, Navigation and Control
ER -