Improved sequential convex programming using modified Chebyshev–Picard iteration for ascent trajectory optimization
- 25 November 2021
- journal article
- research article
- Published by Elsevier BV in Aerospace Science and Technology
- Vol. 120, 107234
- https://doi.org/10.1016/j.ast.2021.107234
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Efficient ascent trajectory optimization using convex models based on the Newton–Kantorovich/Pseudospectral approachAerospace Science and Technology, 2017
- Entry Trajectory Optimization by Second-Order Cone ProgrammingJournal of Guidance, Control, and Dynamics, 2016
- GPOPS-IIACM Transactions on Mathematical Software, 2014
- Picard Iteration, Chebyshev Polynomials and Chebyshev-Picard Methods: Application in AstrodynamicsThe Journal of the Astronautical Sciences, 2013
- Modified Chebyshev-Picard Iteration Methods for Solution of Initial Value ProblemsThe Journal of the Astronautical Sciences, 2012
- Modified Chebyshev-Picard Iteration Methods for Solution of Boundary Value ProblemsThe Journal of the Astronautical Sciences, 2011
- Highly Constrained Optimal Launch Ascent GuidanceJournal of Guidance, Control, and Dynamics, 2010
- Convex Programming Approach to Powered Descent Guidance for Mars LandingJournal of Guidance, Control, and Dynamics, 2007
- Closed-Loop Endoatmospheric Ascent GuidanceJournal of Guidance, Control, and Dynamics, 2003
- Optimization of Launch Vehicle Ascent Trajectories with Path Constraints and Coast ArcsJournal of Guidance, Control, and Dynamics, 2001