The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Entry Trajectory Optimization by Second-Order Cone Programming
Abstract
Convex optimization has found wide applications in recent years due to its unique theoretical advantages and the polynomial-time complexity of state-of-the-art solution algorithms for convex programming. This paper represents an attempt to apply second-order cone programming, a branch of convex optimization, to the class of highly nonlinear trajectory optimization problems in entry flight. The foremost challenge in applying convex optimization in most aerospace engineering problems lies in the nonlinearity and nonconvexity of the problem. Exclusive reliance on linearization does not always work well, as is the case in entry trajectory optimization. This paper focuses on how to formulate realistic, highly constrained entry trajectory optimization problems in a fashion suitable to be solved by second-order cone programming with a combination of successive linearization and relaxation techniques. Rigorous analysis is conducted to support the soundness of the approach. Numerical demonstrations are provided to show the efficacy and effectiveness of the proposed method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
The Journal of the Astronautical Sciences
(2013) · The Journal of the Astronautical Sciences · doi:10.1007/40295.2195-0571 · Cited by 2,775
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
Betts, J. T. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718577 · Cited by 1,567
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Practical Methods for Optimal Control using Nonlinear Programming
Betts, & Kolmanovsky (2002) · Applied Mechanics Reviews · doi:10.1115/1.1483351 · Cited by 1,443
ECOS: An SOCP solver for embedded systems
Domahidi, A., Chu, E., & Boyd, S. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669541 · Cited by 727
Convex Programming Approach to Powered Descent Guidance for Mars Landing
Acikmese, B., & Ploen, S. R. (2007) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.27553 · Cited by 697
On implementing a primal-dual interior-point method for conic quadratic optimization
Andersen, E. D., Roos, C., & Tamás Terlaky, B. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0349-3 · Cited by 674
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Nesterov, Y. E., & Todd, M. J. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.1 · Cited by 612
Time-Optimal Path Tracking for Robots: A Convex Optimization Approach
Verscheure, D., Demeulenaere, B., Swevers, J., De Schutter, J., & Diehl, M. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2028959 · Cited by 536
Model Predictive Control of Swarms of Spacecraft Using Sequential Convex Programming
Morgan, D., Chung, S.-J., & Hadaegh, F. Y. (2014) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g000218 · Cited by 384
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
Blackmore, L., Açikmeşe, B., & Scharf, D. P. (2010) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.47202 · Cited by 378
Solving Nonconvex Optimal Control Problems by Convex Optimization
Liu, X., & Lu, P. (2014) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.62110 · Cited by 358
Self-citationAcikmese, B., Carson, J. M., & Blackmore, L. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2237346 · Cited by 316
Autonomous Trajectory Planning for Rendezvous and Proximity Operations by Conic Optimization
Lu, P., & Liu, X. (2013) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.58436 · Cited by 301
Self-citationLossless convexification of a class of optimal control problems with non-convex control constraints
Açıkmeşe, B., & Blackmore, L. (2011) · Automatica · doi:10.1016/j.automatica.2010.10.037 · Cited by 242
Sturm, J. F. (2002) · Optimization Methods and Software · doi:10.1080/1055678021000045123 · Cited by 192
Lossless convexification of non-convex optimal control problems for state constrained linear systems
Harris, M. W., & Acikmese, B. A. (2014) · Automatica · doi:10.1016/j.automatica.2014.06.008 · Cited by 124
Regularization Methods for Ill-Posed Problems
Cheng, J., & Bernd Hofmann, A. (2010) · Springer eBooks · doi:10.1007/978-0-387-92920-0_3 · Cited by 122
Autonomous Trajectory Planning by Convex Optimization
Liu, X. (2013) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/etd-180810-3525 · Cited by 32
Self-citation
Cited by
Communication and Control in Collaborative UAVs: Recent Advances and Future Trends
Javaid, S., Saeed, N., Qadir, Z., Fahim, H., He, B., Song, H., & Bilal, M. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3248841 · Cited by 345
Survey of convex optimization for aerospace applications
Liu, X., Lu, P., & Pan, B. (2017) · Astrodynamics · doi:10.1007/s42064-017-0003-8 · Cited by 341
Self-citationMalyuta, D., Reynolds, T. P., Szmuk, M., Lew, T., Bonalli, R., Pavone, M., & Açıkmeşe, B. (2022) · IEEE Control Systems · doi:10.1109/mcs.2022.3187542 · Cited by 259
Metadata
- Authors
- Liu, X., Shen, Z., & Lu, P.
- Venue
- Journal of Guidance, Control, and Dynamics
- Published
- 2016-02
- Volume
- 39
- Issue
- 2
- Pages
- 227-241
- ISSN
- 0731-5090 (ISSN-L)
- 1533-3884
- OpenAlex
- W1490395035
- Cited by
- 349
- References
- 24
- FWCI
- 17.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.