The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Autonomous Trajectory Planning for Rendezvous and Proximity Operations by Conic Optimization
Abstract
Autonomous rendezvous and proximity operations of spacecraft require the capability of onboard planning and executing highly constrained trajectories without ground support. This paper presents a general and rigorous methodology and algorithmic procedure toward this goal with a target vehicle that can be in an arbitrary orbit. The rendezvous and proximity operations problem is formulated as a nonlinear optimal control problem, subject to various state and control inequality constraints and equality constraints on interior points and terminal conditions. By a lossless relaxation technique, a relaxed problem is formed, the solution of which is proven to be equivalent to that of the original rendezvous and proximity operations problem. The relaxed problem is then solved by a novel successive solution process, in which the solutions of a sequence of constrained subproblems with linear, time-varying dynamics are sought. After discretization, each of these problems becomes a second-order cone programming problem. Their solutions, if they exist, are guaranteed to be found by a primal-dual interior-point algorithm. The efficacy of the proposed methodology is strongly supported by numerical experiments.
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
Applied Optimal Control: Optimization, Estimation, and Control
Bryson, A. E., & Ho, Y.-C. (2018) · Routledge eBooks · doi:10.1201/9781315137667 · Cited by 6,015
Introduction to Numerical Analysis.
Froberg, C.-E., Stoer, J., & Bulirsch, R. (1981) · Mathematics of Computation · doi:10.2307/2007454 · Cited by 5,463
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 Mathematical Theory of Optimal Processes.
Blum, E. K., Pontryagin, Boltyanskii, Gamkrelidze, & Mishchenko (1963) · The American Mathematical Monthly · doi:10.2307/2312867 · Cited by 4,261
Mathematical Theory of Optimal Processes
Pontryagin, L. S. (2018) · Routledge eBooks · doi:10.1201/9780203749319 · Cited by 3,713
J., J. E. (1979) · Technometrics · doi:10.1080/00401706.1979.10489803 · Cited by 3,073
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
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Terminal Guidance System for Satellite Rendezvous
CLOHESSY, W. H., & WILTSHIRE, R. S. (1960) · Journal of the Aerospace Sciences · doi:10.2514/8.8704 · Cited by 2,084
Foundations of Optimal Control Theory.
Wishart, D. M. G., Lee, E. B., & Markus, L. (1969) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343766 · Cited by 1,862
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
IEEE Transactions on Control Systems Technology
(2023) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.87 · Cited by 722
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
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
Acikmese, B., Carson, J. M., & Blackmore, L. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2237346 · Cited by 316
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Ström, T. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712055 · Cited by 255
Lossless 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
Navigating the Road to Autonomous Orbital Rendezvous
Woffinden, D. C., & Geller, D. K. (2007) · Journal of Spacecraft and Rockets · doi:10.2514/1.30734 · Cited by 202
History of Space Shuttle Rendezvous and Proximity Operations
Goodman, J. L. (2006) · Journal of Spacecraft and Rockets · doi:10.2514/1.19653 · Cited by 171
Orion Rendezvous, Proximity Operations and Docking Design and Analysis
Souza, C. D., Hannak, C., Spehar, P., Clark, F., & Jackson, M. (2007) · AIAA Guidance, Navigation, and Control Conference and Exhibit · doi:10.2514/6.2007-6683 · Cited by 33
Cited by
Terminal Guidance System for Satellite Rendezvous
CLOHESSY, W. H., & WILTSHIRE, R. S. (1960) · Journal of the Aerospace Sciences · doi:10.2514/8.8704 · Cited by 2,084
Model Predictive Control in Aerospace Systems: Current State and Opportunities
Eren, U., Prach, A., Koçer, B. B., Raković, S. V., Kayacan, E., & Açıkmeşe, B. (2017) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g002507 · Cited by 410
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-citationEntry Trajectory Optimization by Second-Order Cone Programming
Liu, X., Shen, Z., & Lu, P. (2016) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g001210 · Cited by 349
Self-citationSurvey 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-citation
Metadata
- Authors
- Lu, P., & Liu, X.
- Venue
- Journal of Guidance, Control, and Dynamics
- Published
- 2013-03
- Volume
- 36
- Issue
- 2
- Pages
- 375-389
- ISSN
- 0731-5090 (ISSN-L)
- 1533-3884
- OpenAlex
- W2161443056
- Cited by
- 301
- References
- 24
- FWCI
- 17.69
- 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.