The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Convex Programming Approach to Powered Descent Guidance for Mars Landing
Abstract
We present a convex programming algorithm for the numerical solution of the minimum fuel powered descent guidance problem associated with Mars pinpoint landing. Our main contribution is the formulation of the trajectory optimization problem, which has nonconvex control constraints, as a finite-dimensional convex optimization problem, specifically as a second-order cone programming problem. Second-order cone programming is a subclass of convex programming, and there are efficient second-order cone programming solvers with deterministic convergence properties. Consequently, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Principles of mathematical analysis
Rudin, W. (1964) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 5,195
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
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Principles of mathematical analysis
Hammer, C. (1953) · Journal of the Franklin Institute · doi:10.1016/0016-0032(53)90617-6 · Cited by 3,985
Deterministic and Stochastic Optimal Control
Fleming, W., & Rishel, R. (1975) · Springer eBooks · doi:10.1007/978-1-4612-6380-7 · Cited by 2,733
Deterministic and Stochastic Optimal Control.
Bather, J. A., Fleming, W. H., & Rishel, R. (1976) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344363 · Cited by 2,690
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
Cited by
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
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
Acikmese, B., Carson, J. M., & Blackmore, L. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2237346 · Cited by 316
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
A semi-analytical guidance algorithm for autonomous landing
Lunghi, P., Lavagna, M., & Armellin, R. (2015) · Advances in Space Research · doi:10.1016/j.asr.2015.02.022 · Cited by 32
Metadata
- Authors
- Acikmese, B., & Ploen, S. R.
- Venue
- Journal of Guidance, Control, and Dynamics
- Published
- 2007-09
- Volume
- 30
- Issue
- 5
- Pages
- 1353-1366
- ISSN
- 0731-5090 (ISSN-L)
- 1533-3884
- OpenAlex
- W2038818107
- Cited by
- 697
- References
- 20
- FWCI
- 8.47
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convex Programming Approach to Powered Descent Guidance for Mars Landing. https://app.cochat.ai/papers/10.2514/1.27553
- The paper
- Acikmese, B., & Ploen, S. R. (2007). Convex Programming Approach to Powered Descent Guidance for Mars Landing. Journal of Guidance, Control, and Dynamics. https://doi.org/10.2514/1.27553
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.
