Optimal finite-thrust spacecraft trajectories using direct transcription and nonlinear programming
Enright, Paul James
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/22370
Description
Title
Optimal finite-thrust spacecraft trajectories using direct transcription and nonlinear programming
Author(s)
Enright, Paul James
Issue Date
1991
Doctoral Committee Chair(s)
Conway, Bruce A.
Department of Study
Aerospace Engineering
Discipline
Aerospace Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Aerospace
Computer Science
Language
eng
Abstract
"A class of methods for the numerical solution of optimal control problems is analyzed and applied to the optimization of finite-thrust spacecraft trajectories. These methods use discrete approximations to the state and control histories, and a discretization of the equations of motion to derive a mathematical programming problem which approximates the optimal control problem, and which is solved numerically. This conversion is referred to as ""transcription."" Transcription methods were developed in the sixties and seventies; however, for nonlinear problems, they were used in conjunction with a ""state-elimination"" procedure which propagated the integration forward over the trajectory, and resulted in a relatively unconstrained programming problem which was easier to handle. Recent advances in nonlinear programming, however, have made it feasible to solve the original heavily-constrained nonlinear programming problem, which is referred to as the ""direct transcription"" of the optimal control problem. This method is referred to as ""direct transcription and nonlinear programming."""
A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables and enforces the equations of motion via a collocation procedure, resulting in a nonlinear programming problem, which is solved numerically. This method is identified as being of the general class of direct transcription methods described above. Also, a new direct transcription method which discretizes the equations of motion using a parallel-shooting approach is developed. For both methods, the relationship between the original optimal control problem and the approximating nonlinear programming problem is investigated by comparing the optimal control necessary conditions with the optimality conditions for the discretized problem.
Both methods are applied to thrust-limited spacecraft trajectory problems, including finite-thrust transfer, rendezvous, and orbit insertion, a low-thrust escape, and a low-thrust Earth-moon transfer. The basic methods have been modified to accurately model discontinuities in the optimal control, to provide efficient handling of those portions of the trajectory which can be determined analytically, i.e., coast arcs of the two-body problem, and to allow the simultaneous use of several coordinate systems.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
