Feasible Sequential Convex Programming With Inexact Restoration for Multistage Ascent Trajectory Optimization
This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squa...
Saved in:
| Published in: | IEEE transactions on aerospace and electronic systems Vol. 59; no. 2; pp. 1217 - 1230 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.04.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9251, 1557-9603 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squares problem, and then a more optimal iterate is generated by solving a convex programming problem constructed around the newly found feasible solution. By virtue of the inexact restoration idea, the proposed method prevents the common artificial infeasibility issue and can provide the intermediate iterate as a feasible suboptimal solution if the algorithmic procedure terminates before convergence. In addition, the Picard iteration-based convexification and Chebyshev polynomial-based discretization methods are employed in the proposed method, given their benefits in terms of robustness, efficiency, and solution accuracy. Numerical simulations for a minimum-time launch ascent problem are conducted, and the results show that the proposed method exhibits better practical performance than other sequential convex programming methods. |
|---|---|
| AbstractList | This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squares problem, and then a more optimal iterate is generated by solving a convex programming problem constructed around the newly found feasible solution. By virtue of the inexact restoration idea, the proposed method prevents the common artificial infeasibility issue and can provide the intermediate iterate as a feasible suboptimal solution if the algorithmic procedure terminates before convergence. In addition, the Picard iteration-based convexification and Chebyshev polynomial-based discretization methods are employed in the proposed method, given their benefits in terms of robustness, efficiency, and solution accuracy. Numerical simulations for a minimum-time launch ascent problem are conducted, and the results show that the proposed method exhibits better practical performance than other sequential convex programming methods. |
| Author | Yan, Rui Pan, Binfeng Ma, Yangyang |
| Author_xml | – sequence: 1 givenname: Yangyang orcidid: 0000-0001-8642-272X surname: Ma fullname: Ma, Yangyang email: mayy@mail.nwpu.edu.cn organization: School of Astronautics, Northwestern Polytechnical University, Xi'an, China – sequence: 2 givenname: Binfeng orcidid: 0000-0002-0748-3274 surname: Pan fullname: Pan, Binfeng email: panbinfeng@nwpu.edu.cn organization: School of Astronautics, Northwestern Polytechnical University, Xi'an, China – sequence: 3 givenname: Rui surname: Yan fullname: Yan, Rui email: yanrui9557@qq.com organization: Xi'an Institute of Aerospace Propulsion Technology, Xi'an, China |
| BookMark | eNp9kEtLAzEUhYMoWB8_QNwEXE_N604ny1J8gaLYisshGe_UlJlJTVJRf73TVly4cHW5cL5zOOeA7Ha-Q0JOOBtyzvT5bHwxHQomxFBynecy3yEDDjDKdM7kLhkwxotMC-D75CDGRf-qQskBaS_RRGcbpFN8W2GXnGnoxHfv-EEfgp8H07aum9Nnl17pTYcfpkr0EWPywSTnO1r7QO9WTXIxmTnScax6EzoLZoFVL_qk98vkWve1UR-Rvdo0EY9_7iF5uryYTa6z2_urm8n4NquElilDY1_qWkslOSpQ-gV0rRhwK7VRgIAWQFhRCyPAQmWtqgtrWAEAGgGUPCRnW99l8H2rmMqFX4WujyzFSOsiZ6NireJbVRV8jAHrchlca8JnyVm5XrVcr1quVy1_Vu2Z0R-mcmnTLQXjmn_J0y3pEPE3SRfACxDyGyHZiOc |
| CODEN | IEARAX |
| CitedBy_id | crossref_primary_10_1109_TAES_2024_3437330 crossref_primary_10_3390_axioms11120696 crossref_primary_10_1109_TAES_2025_3539639 crossref_primary_10_1109_TAES_2024_3440281 crossref_primary_10_1109_TAES_2024_3368011 crossref_primary_10_1109_TAES_2023_3276726 |
| Cites_doi | 10.1553/etna_vol53s459 10.2514/1.A35194 10.1109/TAES.2021.3133310 10.1109/TAES.2020.3037417 10.2514/1.a35069 10.2514/1.A34640 10.2514/1.45632 10.1023/A:1004632923654 10.1007/s42064-017-0003-8 10.2514/1.G006671 10.2514/2.5045 10.2514/3.21285 10.1016/j.ast.2021.107234 10.1007/s10589-007-9147-4 10.1007/s10107-002-0349-3 10.1109/TAES.2021.3131140 10.1016/j.cam.2014.12.031 10.1145/2558904 10.1109/CDC.2016.7798816 10.1007/s40295-020-00235-y 10.1137/S1052623498344562 10.1007/s40295-015-0061-1 10.2514/1.27553 10.2514/1.G001210 10.2514/1.G002745 10.1016/j.actaastro.2020.12.019 10.2514/1.G005376 10.1137/S1052623402413227 10.1016/j.paerosci.2018.07.007 10.1109/TAES.2021.3128869 10.2514/2.4350 10.2514/2.4862 10.1109/taes.2022.3153761 10.2514/2.4712 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 7TB 8FD FR3 H8D L7M |
| DOI | 10.1109/TAES.2022.3196636 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database Aerospace Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Aerospace Database Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Aerospace Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1557-9603 |
| EndPage | 1230 |
| ExternalDocumentID | 10_1109_TAES_2022_3196636 9851852 |
| Genre | orig-research |
| GroupedDBID | -~X 0R~ 29I 4.4 41~ 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P H~9 IAAWW IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 7TB 8FD FR3 H8D L7M |
| ID | FETCH-LOGICAL-c293t-eabdff93431e4549d59f4051b39a45e5eb552b2f2a25b5cbb4f8ba085559e5543 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000974895700035&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9251 |
| IngestDate | Mon Jun 30 10:09:35 EDT 2025 Tue Nov 18 22:32:05 EST 2025 Sat Nov 29 01:51:34 EST 2025 Wed Aug 27 02:14:28 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-eabdff93431e4549d59f4051b39a45e5eb552b2f2a25b5cbb4f8ba085559e5543 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0748-3274 0000-0001-8642-272X |
| PQID | 2799860784 |
| PQPubID | 85477 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_9851852 proquest_journals_2799860784 crossref_primary_10_1109_TAES_2022_3196636 crossref_citationtrail_10_1109_TAES_2022_3196636 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-04-01 |
| PublicationDateYYYYMMDD | 2023-04-01 |
| PublicationDate_xml | – month: 04 year: 2023 text: 2023-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on aerospace and electronic systems |
| PublicationTitleAbbrev | T-AES |
| PublicationYear | 2023 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref35 ref12 ref34 ref15 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref16 ref19 ref18 ref24 ref23 ref26 ref25 ref22 ref21 ref28 ref27 Malyuta (ref17) 2021 ref29 ref8 ref7 ref9 ref4 ref3 ref6 Mao (ref20) 2018 ref5 |
| References_xml | – ident: ref33 doi: 10.1553/etna_vol53s459 – ident: ref10 doi: 10.2514/1.A35194 – ident: ref11 doi: 10.1109/TAES.2021.3133310 – ident: ref15 doi: 10.1109/TAES.2020.3037417 – ident: ref34 doi: 10.2514/1.a35069 – ident: ref21 doi: 10.2514/1.A34640 – ident: ref7 doi: 10.2514/1.45632 – ident: ref26 doi: 10.1023/A:1004632923654 – ident: ref8 doi: 10.1007/s42064-017-0003-8 – ident: ref23 doi: 10.2514/1.G006671 – year: 2021 ident: ref17 article-title: Convex optimization for trajectory generation – ident: ref6 doi: 10.2514/2.5045 – ident: ref3 doi: 10.2514/3.21285 – ident: ref27 doi: 10.1016/j.ast.2021.107234 – ident: ref30 doi: 10.1007/s10589-007-9147-4 – ident: ref35 doi: 10.1007/s10107-002-0349-3 – ident: ref16 doi: 10.1109/TAES.2021.3131140 – ident: ref31 doi: 10.1016/j.cam.2014.12.031 – ident: ref36 doi: 10.1145/2558904 – ident: ref18 doi: 10.1109/CDC.2016.7798816 – year: 2018 ident: ref20 article-title: Successive convexification: A superlinearly convergent algorithm for non-convex optimal control problems – ident: ref22 doi: 10.1007/s40295-020-00235-y – ident: ref24 doi: 10.1137/S1052623498344562 – ident: ref29 doi: 10.1007/s40295-015-0061-1 – ident: ref9 doi: 10.2514/1.27553 – ident: ref28 doi: 10.2514/1.G001210 – ident: ref1 doi: 10.2514/1.G002745 – ident: ref13 doi: 10.1016/j.actaastro.2020.12.019 – ident: ref19 doi: 10.2514/1.G005376 – ident: ref25 doi: 10.1137/S1052623402413227 – ident: ref2 doi: 10.1016/j.paerosci.2018.07.007 – ident: ref14 doi: 10.1109/TAES.2021.3128869 – ident: ref4 doi: 10.2514/2.4350 – ident: ref32 doi: 10.2514/2.4862 – ident: ref12 doi: 10.1109/taes.2022.3153761 – ident: ref5 doi: 10.2514/2.4712 |
| SSID | ssj0014843 |
| Score | 2.4892392 |
| Snippet | This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1217 |
| SubjectTerms | Aerodynamics Ascent trajectories Ascent trajectory optimization Chebyshev approximation Computational geometry Convergence Convexity feasible sequential convex programming inexact restoration (IR) Iterative methods launch vehicle Least squares method Mathematical programming Orbits Picard iterations Polynomials Programming Restoration Robustness Robustness (mathematics) Trajectory optimization Vehicle dynamics |
| Title | Feasible Sequential Convex Programming With Inexact Restoration for Multistage Ascent Trajectory Optimization |
| URI | https://ieeexplore.ieee.org/document/9851852 https://www.proquest.com/docview/2799860784 |
| Volume | 59 |
| WOSCitedRecordID | wos000974895700035&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9603 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014843 issn: 0018-9251 databaseCode: RIE dateStart: 19650101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aPOjBt1itkoMncdt9JN3NsRSLXlS0orclj4kP-hCtUv-9k2ysgiJ420MCS75M5pvkmxlCDlIdc9O2MgJZCJeSIyMlQEYm4RrZiVA5N77ZRH52Vtzeios5cjTLhQEALz6Dpvv0b_lmrF_dVVlLID0oOB6483nernK1Zi8GrAgKuQQNGJ12eMFMYtHqd46vMBJM06bbb21fjfnLB_mmKj9OYu9eeiv_-7FVshxoJO1UuK-RORitk6VvxQU3yBDZHe73AdArL5dGUx7QrhOZT-lFpcoa4kB68zC5p6cjmEo9oZe-0YxHiyKdpT4_FwnkHdCOr_tE0bk9-pv-d3qOx80w5HFukuvecb97EoXmCpFGDz9BbJSxVmRIIIBhkGi4sEjeEpUJyThwUJynKrWpTLniWilmCyWdqo0LQA6SbZHaaDyCbUJtUsS5NprxxLAkySTTWkipC2at4ZDVSfy53KUOlcddA4xB6SOQWJQOodIhVAaE6uRwNuWpKrvx1-ANB8lsYECjThqfmJbBMF_KNMf4so28iO38PmuXLLqO8pU4p0Fqk-dX2CML-g1X-3nf77kPf_HWpA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS2MxEB5EBdcHr7tYrW4efBKPnkvSnjyWoii6VbSyvh1ymaxKW0Wr6L93ksYqKMK-nYcEDvkymW-SmfkANnOTCttwKkFVSl-SoxItUSU2E4bYidRNYYPYRLPTKS8v5ekEbI9rYRAxJJ_hjv8Mb_n21jz6q7JdSfSgFHTgTnnlrFitNX4z4GXMkcvIhMltxzfMLJW73dbeOcWCeb7jd1wj9GN-90JBVuXTWRwczP78__3aAsxFIslaI-QXYQIHSzD7ob3gMvSJ39GO7yE7DwnTZMw91vZp5s_sdJSX1aeB7O_18IodDvBZmSE7C1IzAS9GhJaFCl2ikP-QtULnJ0bu7Sbc9b-wEzpw-rGS8ydc7O912wdJlFdIDPn4IaGjrXOyIAqBnMJEK6Qj-pbpQiouUKAWIte5y1UutDBac1dq5fPahERiIcUvmBzcDnAFmMvKtGms4SKzPMsKxY2RSpmSO2cFFjVI35a7MrH3uJfA6FUhBkll5RGqPEJVRKgGW-Mpd6PGG98NXvaQjAdGNGpQf8O0iqb5UOVNijAbxIz46tezfsPMQffPcXV82Dlagx9eX36UqlOHyeH9I67DtHmilb_fCPvvFdR92e0 |
| 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=Feasible+Sequential+Convex+Programming+With+Inexact+Restoration+for+Multistage+Ascent+Trajectory+Optimization&rft.jtitle=IEEE+transactions+on+aerospace+and+electronic+systems&rft.au=Ma%2C+Yangyang&rft.au=Pan%2C+Binfeng&rft.au=Yan%2C+Rui&rft.date=2023-04-01&rft.pub=IEEE&rft.issn=0018-9251&rft.volume=59&rft.issue=2&rft.spage=1217&rft.epage=1230&rft_id=info:doi/10.1109%2FTAES.2022.3196636&rft.externalDocID=9851852 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9251&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9251&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9251&client=summon |