Sequential convex programming without penalty function for reentry trajectory optimization problem
Sequential convex programming (SCP) has been extensively utilized in reentry trajectory optimization due to its high computational efficiency. However, the current SCP approaches primarily rely on penalty function, where the selection of the penalty function weight presents a significant challenge....
Uložené v:
| Vydané v: | Acta astronautica Ročník 225; s. 402 - 416 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.12.2024
|
| Predmet: | |
| ISSN: | 0094-5765 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Sequential convex programming (SCP) has been extensively utilized in reentry trajectory optimization due to its high computational efficiency. However, the current SCP approaches primarily rely on penalty function, where the selection of the penalty function weight presents a significant challenge. In this paper, an improved trust region shrinking SCP algorithm is proposed that separates the treatment of the objective function and constraint violation without the need for selecting penalty function weight and introduction of slack variables. Firstly, from the perspective of multi-objective optimization, the filter and acceptance condition are introduced to ensure that the proposed algorithm converges to feasible solutions and then to the optimal solution based on switching condition and sufficient condition. Then an effective feasibility restoration phase is proposed to address infeasibility of subproblems without introducing slack variables, while ensuring the robustness of the proposed algorithm. Additionally, a theoretical analysis is provided to guarantee the convergence of the algorithm. Finally, simulations are conducted to verify that the proposed algorithm demonstrates a 69.54% improvement in average solution time and stronger robustness compared to basic trust region shrinking SCP algorithm. Simultaneously, the proposed algorithm also demonstrates an advantage in solving speed compared to a particular advanced penalty function-based SCP algorithm.
•An improved SCP algorithm is proposed without the need for penalty function weight.•A feasibility restoration phase is proposed to address infeasibility of subproblems.•Reentry trajectory optimization is discretized using Radau pseudospectral method.•Simulations are tested in reentry trajectory optimization with four SCP algorithms. |
|---|---|
| AbstractList | Sequential convex programming (SCP) has been extensively utilized in reentry trajectory optimization due to its high computational efficiency. However, the current SCP approaches primarily rely on penalty function, where the selection of the penalty function weight presents a significant challenge. In this paper, an improved trust region shrinking SCP algorithm is proposed that separates the treatment of the objective function and constraint violation without the need for selecting penalty function weight and introduction of slack variables. Firstly, from the perspective of multi-objective optimization, the filter and acceptance condition are introduced to ensure that the proposed algorithm converges to feasible solutions and then to the optimal solution based on switching condition and sufficient condition. Then an effective feasibility restoration phase is proposed to address infeasibility of subproblems without introducing slack variables, while ensuring the robustness of the proposed algorithm. Additionally, a theoretical analysis is provided to guarantee the convergence of the algorithm. Finally, simulations are conducted to verify that the proposed algorithm demonstrates a 69.54% improvement in average solution time and stronger robustness compared to basic trust region shrinking SCP algorithm. Simultaneously, the proposed algorithm also demonstrates an advantage in solving speed compared to a particular advanced penalty function-based SCP algorithm.
•An improved SCP algorithm is proposed without the need for penalty function weight.•A feasibility restoration phase is proposed to address infeasibility of subproblems.•Reentry trajectory optimization is discretized using Radau pseudospectral method.•Simulations are tested in reentry trajectory optimization with four SCP algorithms. |
| Author | Dong, Cheng-Long Xie, Lei He, Rui-Zhi Zhang, Hong-Bo |
| Author_xml | – sequence: 1 givenname: Cheng-Long orcidid: 0009-0007-2314-4161 surname: Dong fullname: Dong, Cheng-Long email: dongchenglong19@nudt.edu.cn – sequence: 2 givenname: Lei surname: Xie fullname: Xie, Lei email: xielei17@nudt.edu.cn – sequence: 3 givenname: Rui-Zhi surname: He fullname: He, Rui-Zhi email: heruizhi_nudt@sina.com – sequence: 4 givenname: Hong-Bo orcidid: 0000-0001-7865-5670 surname: Zhang fullname: Zhang, Hong-Bo email: zhanghb1304@nudt.edu.cn |
| BookMark | eNqNkMtOwzAQRb0oEm3hG8gPJNjOy12wqCpeUiUWwNpy7HFxlNjBcQvl63ELYsEGVjOLOVd3zgxNrLOA0AXBGcGkumwzIYMQY_Auo5gWGWYZLusJmmK8KNKyrspTNBvHFmNcU7aYouYRXrdggxFdIp3dwXsyeLfxou-N3SRvJry4bUgGsKIL-0RvrQzG2UQ7n3iIoN8nwYsWZHBxdUMwvfkQx5sY1HTQn6ETLboRzr_nHD3fXD-t7tL1w-39arlOZU7KkAIo0EA11aqSQpBCVIowmktW10yxhqmSNbQgtSgIbiSlEkAvFJQ0L3BDST5HV1-50rtx9KC5NOHYJBY0HSeYHyTxlv9I4gdJHDMeJUW-_sUP3vTC7_9BLr9IiO_tDHg-SgNWgjI-iuHKmT8zPgGRk5CJ |
| CitedBy_id | crossref_primary_10_3390_aerospace12060539 crossref_primary_10_1088_1742_6596_2977_1_012085 crossref_primary_10_1016_j_ast_2025_110056 |
| Cites_doi | 10.1016/j.actaastro.2022.07.033 10.1016/j.ast.2020.105682 10.1016/j.ast.2022.107887 10.1007/s10957-015-0831-8 10.1137/S105262340038081X 10.1016/j.paerosci.2021.100696 10.1016/j.asr.2023.12.056 10.2514/1.G005916 10.2514/1.27553 10.1109/TIE.2019.2939934 10.1016/j.actaastro.2017.04.013 10.1016/j.automatica.2014.06.008 10.1109/TAES.2021.3050645 10.1016/j.ast.2020.106374 10.1016/j.ifacol.2017.08.789 10.1007/s42064-017-0003-8 10.1016/j.actaastro.2023.10.012 10.2514/1.G002150 10.1007/s101070100244 10.1145/2558904 10.1016/j.actaastro.2012.04.006 10.2514/1.A34640 10.2514/1.G001210 10.1016/j.actaastro.2023.03.031 10.2514/1.G006766 10.1016/j.actaastro.2022.07.046 10.1109/TAES.2022.3153761 10.2514/1.G007266 |
| ContentType | Journal Article |
| Copyright | 2024 IAA |
| Copyright_xml | – notice: 2024 IAA |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.actaastro.2024.08.057 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 416 |
| ExternalDocumentID | 10_1016_j_actaastro_2024_08_057 S0094576524004983 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACIWK ACNNM ACRLP ACRPL ADBBV ADEZE ADMUD ADNMO ADTZH AEBSH AECPX AEIPS AEKER AENEX AFFNX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AI. AIEXJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU ASPBG AVWKF AXJTR AZFZN BELOY BJAXD BKOJK BLXMC BNPGV CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HVGLF HZ~ IHE J1W JJJVA KOM LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDP SES SET SEW SPC SPCBC SSH SST SSZ T5K T9H VH1 VOH WUQ ZMT ~02 ~G- 9DU AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c315t-eedefe2f2fd6caa14a6d1823c8778d8b8d58b2417a410bc22ceef9de52340b213 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001320057900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0094-5765 |
| IngestDate | Sat Nov 29 02:58:48 EST 2025 Tue Nov 18 22:01:42 EST 2025 Sun Apr 06 06:54:26 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Penalty function Sequential convex programming Reentry trajectory optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c315t-eedefe2f2fd6caa14a6d1823c8778d8b8d58b2417a410bc22ceef9de52340b213 |
| ORCID | 0009-0007-2314-4161 0000-0001-7865-5670 |
| PageCount | 15 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_actaastro_2024_08_057 crossref_primary_10_1016_j_actaastro_2024_08_057 elsevier_sciencedirect_doi_10_1016_j_actaastro_2024_08_057 |
| PublicationCentury | 2000 |
| PublicationDate | December 2024 2024-12-00 |
| PublicationDateYYYYMMDD | 2024-12-01 |
| PublicationDate_xml | – month: 12 year: 2024 text: December 2024 |
| PublicationDecade | 2020 |
| PublicationTitle | Acta astronautica |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Acikmese, Ploen (b11) 2007; 30 Fletcher, Leyffer (b30) 2002; 91 Chen, Wu, Sun, Wang (b6) 2024; 214 Mao, Szmuk, Acikmese (b21) 2016 Xiong, Li, Zhao, Hu (b10) 2022; 201 Nocedal, Wright (b29) 2006 Zhao, Song (b14) 2017; 137 Zhang, Su, Gong (b26) 2022; 130 Xie, Zhou, Zhang, Tang (b19) 2024; 73 Xie, Zhou, Zhang, Tang (b23) 2023 Zhou, He, Zhang, Tang, Bao (b28) 2021; 109 Wang, Lu (b25) 2020; 57 Kayama, Howell, Bando, Hokamoto (b9) 2022; 45 Xie, He, Zhang, Tang (b17) 2022; 58 Cui, Zhao, Zhu (b8) 2022; 199 Wang, Grant (b20) 2017; 40 Mao, Dueri, Szmuk, Açıkmeşe (b22) 2017; 50 Liu, Shen (b13) 2016; 168 Zhang, Zhang, Li (b15) 2023; 207 Chai, Tsourdos, Savvaris, Chai, Xia (b4) 2021; 57 Harris, Açıkmeşe (b7) 2014; 50 Domahidi, Chu, Boyd (b32) 2013 Li, Pang, Wei, Cui, Liu (b1) 2020; 98 Chai, Tsourdos, Savvaris, Xia, Chai (b5) 2020; 67 Jun, Sifeng, Zhenyu, Xibin, Huabo (b12) 2023; 46 Liu, Shen, Lu (b16) 2016; 39 Patterson, Rao (b33) 2014; 41 Liu, Lu, Pan (b3) 2017; 1 Xie, Zhou, Zhang, Tang (b18) 2023; 46 Malyuta, Reynolds, Szmuk, Mesbahi, Acikmese, Carson (b27) 2019 Chai, Tsourdos, Savvaris, Chai, Xia, Philip Chen (b2) 2021; 122 Fletcher, Leyffer, Toint (b31) 2002; 13 Xie, Liu, Liu, Tang, Zheng (b24) 2012; 77 Wang (10.1016/j.actaastro.2024.08.057_b25) 2020; 57 Patterson (10.1016/j.actaastro.2024.08.057_b33) 2014; 41 Zhou (10.1016/j.actaastro.2024.08.057_b28) 2021; 109 Acikmese (10.1016/j.actaastro.2024.08.057_b11) 2007; 30 Xie (10.1016/j.actaastro.2024.08.057_b17) 2022; 58 Chai (10.1016/j.actaastro.2024.08.057_b2) 2021; 122 Xiong (10.1016/j.actaastro.2024.08.057_b10) 2022; 201 Wang (10.1016/j.actaastro.2024.08.057_b20) 2017; 40 Domahidi (10.1016/j.actaastro.2024.08.057_b32) 2013 Fletcher (10.1016/j.actaastro.2024.08.057_b31) 2002; 13 Zhang (10.1016/j.actaastro.2024.08.057_b26) 2022; 130 Liu (10.1016/j.actaastro.2024.08.057_b3) 2017; 1 Xie (10.1016/j.actaastro.2024.08.057_b24) 2012; 77 Xie (10.1016/j.actaastro.2024.08.057_b18) 2023; 46 Cui (10.1016/j.actaastro.2024.08.057_b8) 2022; 199 Kayama (10.1016/j.actaastro.2024.08.057_b9) 2022; 45 Fletcher (10.1016/j.actaastro.2024.08.057_b30) 2002; 91 Zhao (10.1016/j.actaastro.2024.08.057_b14) 2017; 137 Nocedal (10.1016/j.actaastro.2024.08.057_b29) 2006 Chai (10.1016/j.actaastro.2024.08.057_b5) 2020; 67 Zhang (10.1016/j.actaastro.2024.08.057_b15) 2023; 207 Li (10.1016/j.actaastro.2024.08.057_b1) 2020; 98 Malyuta (10.1016/j.actaastro.2024.08.057_b27) 2019 Xie (10.1016/j.actaastro.2024.08.057_b19) 2024; 73 Harris (10.1016/j.actaastro.2024.08.057_b7) 2014; 50 Mao (10.1016/j.actaastro.2024.08.057_b21) 2016 Xie (10.1016/j.actaastro.2024.08.057_b23) 2023 Chai (10.1016/j.actaastro.2024.08.057_b4) 2021; 57 Mao (10.1016/j.actaastro.2024.08.057_b22) 2017; 50 Jun (10.1016/j.actaastro.2024.08.057_b12) 2023; 46 Liu (10.1016/j.actaastro.2024.08.057_b13) 2016; 168 Chen (10.1016/j.actaastro.2024.08.057_b6) 2024; 214 Liu (10.1016/j.actaastro.2024.08.057_b16) 2016; 39 |
| References_xml | – volume: 77 start-page: 167 year: 2012 end-page: 181 ident: b24 article-title: Rapid generation of entry trajectories with waypoint and no-fly zone constraints publication-title: Acta Astronaut. – volume: 46 start-page: 1 year: 2023 end-page: 8 ident: b18 article-title: Higher-order soft-trust-region-based sequential convex programming publication-title: J. Guid. Control Dyn. – volume: 91 start-page: 239 year: 2002 end-page: 269 ident: b30 article-title: Nonlinear programming without a penalty function publication-title: Math. Program. – volume: 98 year: 2020 ident: b1 article-title: Online trajectory optimization for power system fault of launch vehicles via convex programming publication-title: Aerosp. Sci. Technol. – volume: 67 start-page: 6904 year: 2020 end-page: 6915 ident: b5 article-title: Real-time reentry trajectory planning of hypersonic vehicles: A two-step strategy incorporating fuzzy multiobjective transcription and deep neural network publication-title: IEEE Trans. Ind. Electron. – volume: 41 start-page: 1 year: 2014 end-page: 37 ident: b33 article-title: GPOPS-II: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive Gaussian quadrature collocation methods and sparse nonlinear programming publication-title: ACM Trans. Math. Software – volume: 46 start-page: 718 year: 2023 end-page: 725 ident: b12 article-title: Sequential convex programming using augmented Lagrange multiplier method and concave–convex decomposition publication-title: J. Guid. Control Dyn. – start-page: 3636 year: 2016 end-page: 3641 ident: b21 article-title: Successive convexification of non-convex optimal control problems and its convergence properties publication-title: 2016 IEEE 55th Conference on Decision and Control – volume: 122 year: 2021 ident: b2 article-title: Review of advanced guidance and control algorithms for space/aerospace vehicles publication-title: Prog. Aerosp. Sci. – volume: 73 start-page: 3195 year: 2024 end-page: 3208 ident: b19 article-title: Hybrid-order soft trust region-based sequential convex programming for reentry trajectory optimization publication-title: Adv. Space Res. – volume: 57 start-page: 1373 year: 2020 end-page: 1386 ident: b25 article-title: Improved sequential convex programming algorithms for entry trajectory optimization publication-title: J. Spacecr. Rockets – volume: 109 year: 2021 ident: b28 article-title: Sequential convex programming method using adaptive mesh refinement for entry trajectory planning problem publication-title: Aerosp. Sci. Technol. – volume: 207 start-page: 331 year: 2023 end-page: 339 ident: b15 article-title: Mixed-integer trajectory optimization with no-fly zone constraints for a hypersonic vehicle publication-title: Acta Astronaut. – volume: 214 start-page: 125 year: 2024 end-page: 136 ident: b6 article-title: Distributed safe trajectory optimization for large-scale spacecraft formation reconfiguration publication-title: Acta Astronaut. – volume: 45 start-page: 623 year: 2022 end-page: 637 ident: b9 article-title: Low-thrust trajectory design with successive convex optimization for libration point orbits publication-title: J. Guid. Control Dyn. – volume: 39 start-page: 227 year: 2016 end-page: 241 ident: b16 article-title: Entry trajectory optimization by second-order cone programming publication-title: J. Guid. Control Dyn. – volume: 50 start-page: 4063 year: 2017 end-page: 4069 ident: b22 article-title: Successive convexification of non-convex optimal control problems with state constraints publication-title: IFAC-PapersOnLine – volume: 130 year: 2022 ident: b26 article-title: Hp-adaptive RPD based sequential convex programming for reentry trajectory optimization publication-title: Aerosp. Sci. Technol. – year: 2019 ident: b27 article-title: Discretization performance and accuracy analysis for the rocket powered descent guidance problem publication-title: AIAA Scitech 2019 Forum – year: 2006 ident: b29 publication-title: Numerical Optimization – volume: 1 start-page: 23 year: 2017 end-page: 40 ident: b3 article-title: Survey of convex optimization for aerospace applications publication-title: Astrodynamics – start-page: 1 year: 2023 end-page: 16 ident: b23 article-title: Descent property in sequential second-order cone programming for nonlinear trajectory optimization publication-title: J. Guid. Control Dyn. – volume: 50 start-page: 2304 year: 2014 end-page: 2311 ident: b7 article-title: Lossless convexification of non-convex optimal control problems for state constrained linear systems publication-title: Automatica – volume: 168 start-page: 917 year: 2016 end-page: 943 ident: b13 article-title: Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles publication-title: J. Optim. Theory Appl. – volume: 57 start-page: 1685 year: 2021 end-page: 1701 ident: b4 article-title: Solving constrained trajectory planning problems using biased particle swarm optimization publication-title: IEEE Trans. Aerosp. Electron. Syst. – volume: 30 start-page: 1353 year: 2007 end-page: 1366 ident: b11 article-title: Convex programming approach to powered descent guidance for mars landing publication-title: J. Guid. Control Dyn. – volume: 137 start-page: 60 year: 2017 end-page: 69 ident: b14 article-title: Reentry trajectory optimization with waypoint and no-fly zone constraints using multiphase convex programming publication-title: Acta Astronaut. – volume: 201 start-page: 209 year: 2022 end-page: 223 ident: b10 article-title: Rocket landing guidance using convex optimization and proportional navigation considering performance-limited engine publication-title: Acta Astronaut. – volume: 13 start-page: 44 year: 2002 end-page: 59 ident: b31 article-title: On the global convergence of a filter–SQP algorithm publication-title: SIAM J. Optim. – volume: 58 start-page: 3337 year: 2022 end-page: 3352 ident: b17 article-title: Oscillation phenomenon in trust-region-based sequential convex programming for the nonlinear trajectory planning problem publication-title: IEEE Trans. Aerosp. Electron. Syst. – volume: 40 start-page: 2603 year: 2017 end-page: 2615 ident: b20 article-title: Constrained trajectory optimization for planetary entry via sequential convex programming publication-title: J. Guid. Control Dyn. – start-page: 3071 year: 2013 end-page: 3076 ident: b32 article-title: ECOS: An SOCP solver for embedded systems publication-title: 2013 European Control Conference – volume: 199 start-page: 313 year: 2022 end-page: 326 ident: b8 article-title: Obstacle avoidance guidance for planetary landing using convex trajectory and adaptive curvature regulation publication-title: Acta Astronaut. – volume: 201 start-page: 209 year: 2022 ident: 10.1016/j.actaastro.2024.08.057_b10 article-title: Rocket landing guidance using convex optimization and proportional navigation considering performance-limited engine publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2022.07.033 – volume: 98 year: 2020 ident: 10.1016/j.actaastro.2024.08.057_b1 article-title: Online trajectory optimization for power system fault of launch vehicles via convex programming publication-title: Aerosp. Sci. Technol. doi: 10.1016/j.ast.2020.105682 – volume: 130 year: 2022 ident: 10.1016/j.actaastro.2024.08.057_b26 article-title: Hp-adaptive RPD based sequential convex programming for reentry trajectory optimization publication-title: Aerosp. Sci. Technol. doi: 10.1016/j.ast.2022.107887 – volume: 168 start-page: 917 issue: 3 year: 2016 ident: 10.1016/j.actaastro.2024.08.057_b13 article-title: Rapid smooth entry trajectory planning for high lift/drag hypersonic glide vehicles publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-015-0831-8 – volume: 13 start-page: 44 issue: 1 year: 2002 ident: 10.1016/j.actaastro.2024.08.057_b31 article-title: On the global convergence of a filter–SQP algorithm publication-title: SIAM J. Optim. doi: 10.1137/S105262340038081X – volume: 122 year: 2021 ident: 10.1016/j.actaastro.2024.08.057_b2 article-title: Review of advanced guidance and control algorithms for space/aerospace vehicles publication-title: Prog. Aerosp. Sci. doi: 10.1016/j.paerosci.2021.100696 – volume: 73 start-page: 3195 issue: 6 year: 2024 ident: 10.1016/j.actaastro.2024.08.057_b19 article-title: Hybrid-order soft trust region-based sequential convex programming for reentry trajectory optimization publication-title: Adv. Space Res. doi: 10.1016/j.asr.2023.12.056 – start-page: 3636 year: 2016 ident: 10.1016/j.actaastro.2024.08.057_b21 article-title: Successive convexification of non-convex optimal control problems and its convergence properties – volume: 45 start-page: 623 issue: 4 year: 2022 ident: 10.1016/j.actaastro.2024.08.057_b9 article-title: Low-thrust trajectory design with successive convex optimization for libration point orbits publication-title: J. Guid. Control Dyn. doi: 10.2514/1.G005916 – volume: 30 start-page: 1353 issue: 5 year: 2007 ident: 10.1016/j.actaastro.2024.08.057_b11 article-title: Convex programming approach to powered descent guidance for mars landing publication-title: J. Guid. Control Dyn. doi: 10.2514/1.27553 – volume: 67 start-page: 6904 issue: 8 year: 2020 ident: 10.1016/j.actaastro.2024.08.057_b5 article-title: Real-time reentry trajectory planning of hypersonic vehicles: A two-step strategy incorporating fuzzy multiobjective transcription and deep neural network publication-title: IEEE Trans. Ind. Electron. doi: 10.1109/TIE.2019.2939934 – start-page: 3071 year: 2013 ident: 10.1016/j.actaastro.2024.08.057_b32 article-title: ECOS: An SOCP solver for embedded systems – volume: 137 start-page: 60 year: 2017 ident: 10.1016/j.actaastro.2024.08.057_b14 article-title: Reentry trajectory optimization with waypoint and no-fly zone constraints using multiphase convex programming publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2017.04.013 – volume: 50 start-page: 2304 issue: 9 year: 2014 ident: 10.1016/j.actaastro.2024.08.057_b7 article-title: Lossless convexification of non-convex optimal control problems for state constrained linear systems publication-title: Automatica doi: 10.1016/j.automatica.2014.06.008 – volume: 57 start-page: 1685 issue: 3 year: 2021 ident: 10.1016/j.actaastro.2024.08.057_b4 article-title: Solving constrained trajectory planning problems using biased particle swarm optimization publication-title: IEEE Trans. Aerosp. Electron. Syst. doi: 10.1109/TAES.2021.3050645 – year: 2019 ident: 10.1016/j.actaastro.2024.08.057_b27 article-title: Discretization performance and accuracy analysis for the rocket powered descent guidance problem – volume: 109 year: 2021 ident: 10.1016/j.actaastro.2024.08.057_b28 article-title: Sequential convex programming method using adaptive mesh refinement for entry trajectory planning problem publication-title: Aerosp. Sci. Technol. doi: 10.1016/j.ast.2020.106374 – volume: 50 start-page: 4063 issue: 1 year: 2017 ident: 10.1016/j.actaastro.2024.08.057_b22 article-title: Successive convexification of non-convex optimal control problems with state constraints publication-title: IFAC-PapersOnLine doi: 10.1016/j.ifacol.2017.08.789 – volume: 1 start-page: 23 issue: 1 year: 2017 ident: 10.1016/j.actaastro.2024.08.057_b3 article-title: Survey of convex optimization for aerospace applications publication-title: Astrodynamics doi: 10.1007/s42064-017-0003-8 – volume: 214 start-page: 125 year: 2024 ident: 10.1016/j.actaastro.2024.08.057_b6 article-title: Distributed safe trajectory optimization for large-scale spacecraft formation reconfiguration publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2023.10.012 – volume: 40 start-page: 2603 issue: 10 year: 2017 ident: 10.1016/j.actaastro.2024.08.057_b20 article-title: Constrained trajectory optimization for planetary entry via sequential convex programming publication-title: J. Guid. Control Dyn. doi: 10.2514/1.G002150 – start-page: 1 year: 2023 ident: 10.1016/j.actaastro.2024.08.057_b23 article-title: Descent property in sequential second-order cone programming for nonlinear trajectory optimization publication-title: J. Guid. Control Dyn. – volume: 91 start-page: 239 issue: 2 year: 2002 ident: 10.1016/j.actaastro.2024.08.057_b30 article-title: Nonlinear programming without a penalty function publication-title: Math. Program. doi: 10.1007/s101070100244 – year: 2006 ident: 10.1016/j.actaastro.2024.08.057_b29 – volume: 41 start-page: 1 issue: 1 year: 2014 ident: 10.1016/j.actaastro.2024.08.057_b33 article-title: GPOPS-II: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive Gaussian quadrature collocation methods and sparse nonlinear programming publication-title: ACM Trans. Math. Software doi: 10.1145/2558904 – volume: 77 start-page: 167 year: 2012 ident: 10.1016/j.actaastro.2024.08.057_b24 article-title: Rapid generation of entry trajectories with waypoint and no-fly zone constraints publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2012.04.006 – volume: 57 start-page: 1373 issue: 6 year: 2020 ident: 10.1016/j.actaastro.2024.08.057_b25 article-title: Improved sequential convex programming algorithms for entry trajectory optimization publication-title: J. Spacecr. Rockets doi: 10.2514/1.A34640 – volume: 39 start-page: 227 issue: 2 year: 2016 ident: 10.1016/j.actaastro.2024.08.057_b16 article-title: Entry trajectory optimization by second-order cone programming publication-title: J. Guid. Control Dyn. doi: 10.2514/1.G001210 – volume: 207 start-page: 331 year: 2023 ident: 10.1016/j.actaastro.2024.08.057_b15 article-title: Mixed-integer trajectory optimization with no-fly zone constraints for a hypersonic vehicle publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2023.03.031 – volume: 46 start-page: 718 issue: 4 year: 2023 ident: 10.1016/j.actaastro.2024.08.057_b12 article-title: Sequential convex programming using augmented Lagrange multiplier method and concave–convex decomposition publication-title: J. Guid. Control Dyn. doi: 10.2514/1.G006766 – volume: 199 start-page: 313 year: 2022 ident: 10.1016/j.actaastro.2024.08.057_b8 article-title: Obstacle avoidance guidance for planetary landing using convex trajectory and adaptive curvature regulation publication-title: Acta Astronaut. doi: 10.1016/j.actaastro.2022.07.046 – volume: 58 start-page: 3337 issue: 4 year: 2022 ident: 10.1016/j.actaastro.2024.08.057_b17 article-title: Oscillation phenomenon in trust-region-based sequential convex programming for the nonlinear trajectory planning problem publication-title: IEEE Trans. Aerosp. Electron. Syst. doi: 10.1109/TAES.2022.3153761 – volume: 46 start-page: 1 issue: 11 year: 2023 ident: 10.1016/j.actaastro.2024.08.057_b18 article-title: Higher-order soft-trust-region-based sequential convex programming publication-title: J. Guid. Control Dyn. doi: 10.2514/1.G007266 |
| SSID | ssj0007289 |
| Score | 2.3947213 |
| Snippet | Sequential convex programming (SCP) has been extensively utilized in reentry trajectory optimization due to its high computational efficiency. However, the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 402 |
| SubjectTerms | Penalty function Reentry trajectory optimization Sequential convex programming |
| Title | Sequential convex programming without penalty function for reentry trajectory optimization problem |
| URI | https://dx.doi.org/10.1016/j.actaastro.2024.08.057 |
| Volume | 225 |
| WOSCitedRecordID | wos001320057900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0094-5765 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0007289 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fa9swEBZZu4ftYewn69oNPewtaNiyHMl7y0pLO0YZtIOwFyPJ8prQOiF1Q_Lf9yTLstsVujH2IoKDJFv36XR3fLpD6CMcGbHWkSEqSihh0BJVKkHgcFCa2QRPWrtiE_zkREwm2ffBYNPehVld8KoS63W2-K-ihmcgbHt19i_EHQaFB_AbhA4tiB3aPxL8qSNH11OX-KNamXXLwbps466WirwwMJBla8K5FuiGloNTLze2bsTMRfM3wzmolEt_V3Poq8_0DdqxruVQXtmAunRx8WAZe67v_rmpfpFvc39Cwj8TX9zZTLtArJP09ZT8PA8PQyj7CPqSL_N-fIKyO1yPcHGmYyk5RZwxAq5O2lfElKY9Vcoi2juVWXMj8zeF38QeZgC-WrqP_WTfwWVlbRJf38mmfWpnthNb7izLRPIIbVOeZqAQt8fHB5Ov4RjnVDS-k3_TW-TAe6e737TpmStnz9Ez72fgcYOPF2hgqpfoaS_75CukOqTgBim4hxTskYI9UnCLFAxIwR4puEMK7iMFe6S8Rj8OD872j4gvuUF0Eqc1AYvJlIaWtCxGWsqYyVEBHmiiBeeiEEoUqVCwvblkcaQ0pWBjlVlhUpqwSNE4eYO2qnll3iKsYBRT8pFMS80Mh60vFDgPClwSmEOUO2jUrlaufT56WxblIm-Jh7M8LHNulzm3BVNTvoOi0HHRpGR5uMvnVhy5tywbizEHHD3U-d2_dN5FT7pNsYe26uW1eY8e61U9vVp-8Ji7AdjBqpk |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sequential+convex+programming+without+penalty+function+for+reentry+trajectory+optimization+problem&rft.jtitle=Acta+astronautica&rft.au=Dong%2C+Cheng-Long&rft.au=Xie%2C+Lei&rft.au=He%2C+Rui-Zhi&rft.au=Zhang%2C+Hong-Bo&rft.date=2024-12-01&rft.pub=Elsevier+Ltd&rft.issn=0094-5765&rft.volume=225&rft.spage=402&rft.epage=416&rft_id=info:doi/10.1016%2Fj.actaastro.2024.08.057&rft.externalDocID=S0094576524004983 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0094-5765&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0094-5765&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0094-5765&client=summon |