Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization
In midcourse guidance, strong constraints and dual-channel control coupling pose major challenges for trajectory optimization. To address this, this paper proposes an optimal guidance method based on terminal relaxation and range convex programming. The study first derived a range-domain dynamics mo...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Aerospace |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2226-4310/12/7/618 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849409622052438016 |
|---|---|
| author | Jiong Li Jinlin Zhang Jikun Ye Lei Shao Xiangwei Bu |
| author_facet | Jiong Li Jinlin Zhang Jikun Ye Lei Shao Xiangwei Bu |
| author_sort | Jiong Li |
| collection | DOAJ |
| description | In midcourse guidance, strong constraints and dual-channel control coupling pose major challenges for trajectory optimization. To address this, this paper proposes an optimal guidance method based on terminal relaxation and range convex programming. The study first derived a range-domain dynamics model with the angle of attack and bank angle as dual control inputs, augmented with path constraints including heat flux limitations, to formulate the midcourse guidance optimization problem. A terminal relaxation strategy was then proposed to mitigate numerical infeasibility induced by rigid terminal constraints, thereby guaranteeing the solvability of successive subproblems. Through the integration of affine variable transformations and successive linearization techniques, the original nonconvex problem was systematically converted into a second-order cone programming (SOCP) formulation, with theoretical equivalence between the relaxed and original problems established under well-justified assumptions. Furthermore, a heuristic initial trajectory generation scheme was devised, and the solution was obtained via a sequential convex programming (SCP) algorithm. Numerical simulation results demonstrated that the proposed method effectively satisfies strict path constraints, successfully generates feasible midcourse guidance trajectories, and exhibits strong computational efficiency and robustness. Additionally, a systematic comparison was conducted to evaluate the impact of different interpolation methods and discretization point quantities on algorithm performance. |
| format | Article |
| id | doaj-art-181ab03bfdff478cb35eecb910d41d37 |
| institution | Kabale University |
| issn | 2226-4310 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Aerospace |
| spelling | doaj-art-181ab03bfdff478cb35eecb910d41d372025-08-20T03:35:27ZengMDPI AGAerospace2226-43102025-07-0112761810.3390/aerospace12070618Optimal Midcourse Guidance with Terminal Relaxation and Range Convex OptimizationJiong Li0Jinlin Zhang1Jikun Ye2Lei Shao3Xiangwei Bu4Air Defense and Antimissile School, Air Force Engineering University, Xi’an 710038, ChinaAir Defense and Antimissile School, Air Force Engineering University, Xi’an 710038, ChinaAir Defense and Antimissile School, Air Force Engineering University, Xi’an 710038, ChinaAir Defense and Antimissile School, Air Force Engineering University, Xi’an 710038, ChinaAir Defense and Antimissile School, Air Force Engineering University, Xi’an 710038, ChinaIn midcourse guidance, strong constraints and dual-channel control coupling pose major challenges for trajectory optimization. To address this, this paper proposes an optimal guidance method based on terminal relaxation and range convex programming. The study first derived a range-domain dynamics model with the angle of attack and bank angle as dual control inputs, augmented with path constraints including heat flux limitations, to formulate the midcourse guidance optimization problem. A terminal relaxation strategy was then proposed to mitigate numerical infeasibility induced by rigid terminal constraints, thereby guaranteeing the solvability of successive subproblems. Through the integration of affine variable transformations and successive linearization techniques, the original nonconvex problem was systematically converted into a second-order cone programming (SOCP) formulation, with theoretical equivalence between the relaxed and original problems established under well-justified assumptions. Furthermore, a heuristic initial trajectory generation scheme was devised, and the solution was obtained via a sequential convex programming (SCP) algorithm. Numerical simulation results demonstrated that the proposed method effectively satisfies strict path constraints, successfully generates feasible midcourse guidance trajectories, and exhibits strong computational efficiency and robustness. Additionally, a systematic comparison was conducted to evaluate the impact of different interpolation methods and discretization point quantities on algorithm performance.https://www.mdpi.com/2226-4310/12/7/618convex optimizationmidcourse guidancedual-channel controlsequential convex programmingsecond-order cone programming |
| spellingShingle | Jiong Li Jinlin Zhang Jikun Ye Lei Shao Xiangwei Bu Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization Aerospace convex optimization midcourse guidance dual-channel control sequential convex programming second-order cone programming |
| title | Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization |
| title_full | Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization |
| title_fullStr | Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization |
| title_full_unstemmed | Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization |
| title_short | Optimal Midcourse Guidance with Terminal Relaxation and Range Convex Optimization |
| title_sort | optimal midcourse guidance with terminal relaxation and range convex optimization |
| topic | convex optimization midcourse guidance dual-channel control sequential convex programming second-order cone programming |
| url | https://www.mdpi.com/2226-4310/12/7/618 |
| work_keys_str_mv | AT jiongli optimalmidcourseguidancewithterminalrelaxationandrangeconvexoptimization AT jinlinzhang optimalmidcourseguidancewithterminalrelaxationandrangeconvexoptimization AT jikunye optimalmidcourseguidancewithterminalrelaxationandrangeconvexoptimization AT leishao optimalmidcourseguidancewithterminalrelaxationandrangeconvexoptimization AT xiangweibu optimalmidcourseguidancewithterminalrelaxationandrangeconvexoptimization |