Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming
This paper proposes a novel method to efficiently construct the aerocapture attainability set based on convex optimization. Using dimensionality reduction, constructing the attainability set is equivalent to solving a set of discrete points on its boundary. As solving each of the boundary points is...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-06-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/13/6437 |
| _version_ | 1827655487785533440 |
|---|---|
| author | Rui Teng Hongwei Han Jilin Chen |
| author_facet | Rui Teng Hongwei Han Jilin Chen |
| author_sort | Rui Teng |
| collection | DOAJ |
| description | This paper proposes a novel method to efficiently construct the aerocapture attainability set based on convex optimization. Using dimensionality reduction, constructing the attainability set is equivalent to solving a set of discrete points on its boundary. As solving each of the boundary points is a typical nonlinear optimal control problem, a sequential convex programming method is adopted. The efficiency and accuracy of the proposed algorithm is demonstrated by high-fidelity numerical results. This is the first time that the configuration of the aerocapture attainability set is precisely described by the state variables at atmospheric exit. Since the quantification of the set is significant for assessing the feasibility of performing an aerocapture maneuver, the proposed method can be used as a reliable tool for systematic design for aerocapture mission. |
| first_indexed | 2024-03-09T22:08:25Z |
| format | Article |
| id | doaj.art-5c91a267da8a4099aba7970dde520ec2 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T22:08:25Z |
| publishDate | 2022-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-5c91a267da8a4099aba7970dde520ec22023-11-23T19:36:37ZengMDPI AGApplied Sciences2076-34172022-06-011213643710.3390/app12136437Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex ProgrammingRui Teng0Hongwei Han1Jilin Chen2School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100811, ChinaSchool of Aerospace Engineering, Beijing Institute of Technology, Beijing 100811, ChinaSchool of Aerospace Engineering, Beijing Institute of Technology, Beijing 100811, ChinaThis paper proposes a novel method to efficiently construct the aerocapture attainability set based on convex optimization. Using dimensionality reduction, constructing the attainability set is equivalent to solving a set of discrete points on its boundary. As solving each of the boundary points is a typical nonlinear optimal control problem, a sequential convex programming method is adopted. The efficiency and accuracy of the proposed algorithm is demonstrated by high-fidelity numerical results. This is the first time that the configuration of the aerocapture attainability set is precisely described by the state variables at atmospheric exit. Since the quantification of the set is significant for assessing the feasibility of performing an aerocapture maneuver, the proposed method can be used as a reliable tool for systematic design for aerocapture mission.https://www.mdpi.com/2076-3417/12/13/6437aerocapture attainability setdimensionality reductionboundary pointssequential convex programming |
| spellingShingle | Rui Teng Hongwei Han Jilin Chen Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming Applied Sciences aerocapture attainability set dimensionality reduction boundary points sequential convex programming |
| title | Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming |
| title_full | Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming |
| title_fullStr | Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming |
| title_full_unstemmed | Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming |
| title_short | Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming |
| title_sort | rapid construction of aerocapture attainability sets using sequential convex programming |
| topic | aerocapture attainability set dimensionality reduction boundary points sequential convex programming |
| url | https://www.mdpi.com/2076-3417/12/13/6437 |
| work_keys_str_mv | AT ruiteng rapidconstructionofaerocaptureattainabilitysetsusingsequentialconvexprogramming AT hongweihan rapidconstructionofaerocaptureattainabilitysetsusingsequentialconvexprogramming AT jilinchen rapidconstructionofaerocaptureattainabilitysetsusingsequentialconvexprogramming |